. Bitcoin, , pp.2018-2020

. Splitwise, , pp.2018-2020

. Zcash, , pp.2018-2020

X. Bultel, J. Dreier, J. Dumas, and P. Lafourcade, A cryptographer's conspiracy Santa, 9th International conference on Fun with algorithms (FUN 2018), vol.100, pp.1-13, 2018.

D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988.

H. Thomas, C. Cormen, R. L. Stein, and C. E. Rivest, 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, . Karp-;-michael, T. M. Jünger, D. Liebling, G. L. Naddef et al., Reducibility among combinatorial problems, From the Early Years to the State-of-the-Art, pp.219-241, 1958.

L. Liberti and F. Raimondi, The secret Santa problem, Algorithmic Aspects in Information and Management, pp.271-279, 2008.

Q. Ma and P. Deng, Secure multi-party protocols for privacy preserving data mining, Wireless Algorithms, Systems, and Applications, pp.526-537, 2008.

S. Mauw, S. Radomirovi?, and P. Y. Ryan, Security protocols for secret Santa, Security Protocols XVIII, pp.175-184, 2014.

Y. A. Peter, . Ryan, and . Santa, The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His 85th Birthday, pp.543-549, 2016.

D. Vávra, Mobile Application for Group Expenses and Its Deployment, 2012.