D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-7510, 1988.
DOI : 10.1007/BF00206326
URL : http://www.cs.ucsb.edu/~ravenben/classes/595n-s07/papers/dcnet-jcrypt88.pdf

H. Thomas, C. Cormen, R. L. Stein, C. E. Rivest, and . Leiserson, Introduction to Algorithms, 2001.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

M. Richard, T. M. Karp-michael-jünger, D. Liebling, G. L. Naddef, W. R. Nemhauser et al., Reducibility among combinatorial problems Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, pp.50-219, 2010.

Q. Ma and P. Deng, Secure Multi-party Protocols for Privacy Preserving Data Mining, Wireless Algorithms, Systems, and Applications, pp.526-537, 2008.
DOI : 10.1109/SFCS.1986.25

D. Vávra, Mobile Application for Group Expenses and Its Deployment Master's thesis, 2012.