Document Open Access Logo

A Cryptographer's Conspiracy Santa

Authors Xavier Bultel , Jannik Dreier , Jean-Guillaume Dumas , Pascal Lafourcade



PDF
Thumbnail PDF

File

LIPIcs.FUN.2018.13.pdf
  • Filesize: 475 kB
  • 13 pages

Document Identifiers

Author Details

Xavier Bultel
  • LIMOS, University Clermont Auvergne, Campus des Cézeaux, Aubière, France
Jannik Dreier
  • Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
Jean-Guillaume Dumas
  • Université Grenoble Alpes, Laboratoire Jean Kuntzmann, UMR CNRS 5224, 700 avenue centrale, IMAG - CS 40700, 38058 Grenoble cedex 9, France
Pascal Lafourcade
  • LIMOS, University Clermont Auvergne, Campus des Cézeaux, Aubière, France

Cite AsGet BibTex

Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, and Pascal Lafourcade. A Cryptographer's Conspiracy Santa. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 13:1-13:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FUN.2018.13

Abstract

In Conspiracy Santa, a variant of Secret Santa, a group of people offer each other Christmas gifts, where each member of the group receives a gift from the other members of the group. To that end, the members of the group form conspiracies, to decide on appropriate gifts, and usually divide the cost of each gift among all participants of that conspiracy. This requires to settle the shared expenses per conspiracy, so Conspiracy Santa can actually be seen as an aggregation of several shared expenses problems. First, we show that the problem of finding a minimal number of transaction when settling shared expenses is NP-complete. Still, there exists good greedy approximations. Second, we present a greedy distributed secure solution to Conspiracy Santa. This solution allows a group of people to share the expenses for the gifts in such a way that no participant learns the price of his gift, but at the same time notably reduces the number of transactions with respect to a naive aggregation. Furthermore, our solution does not require a trusted third party, and can either be implemented physically (the participants are in the same room and exchange money using envelopes) or, virtually, using a cryptocurrency.

Subject Classification

ACM Subject Classification
  • Security and privacy → Privacy-preserving protocols
  • Security and privacy → Formal security models
  • Theory of computation → Problems, reductions and completeness
Keywords
  • Secret Santa
  • Conspiracy Santa
  • Secure Multi-Party Computation
  • Cryptocurrency
  • Physical Cryptography

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Bitcoin. https://bitcoin.org/. Accessed: 2018-02-13.
  2. Monero. https://getmonero.org/. Accessed: 2018-02-13.
  3. Settle up. https://settleup.io/. Accessed: 2018-02-13.
  4. Splitwise. https://www.splitwise.com/. Accessed: 2018-02-13.
  5. Tricount. https://www.tricount.com/. Accessed: 2018-02-13.
  6. Zcash. https://z.cash/. Accessed: 2018-02-13.
  7. David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology, 1(1):65-75, 1988. URL: http://dx.doi.org/10.1007/BF00206326.
  8. Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2nd edition, 2001. Google Scholar
  9. Michael R. Garey and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman &Co., New York, NY, USA, 1990. Google Scholar
  10. Richard M. Karp. Reducibility among combinatorial problems. In Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, and Laurence A. Wolsey, editors, 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, pages 219-241. Springer, Berlin, Heidelberg, 2010. Google Scholar
  11. Qingkai Ma and Ping Deng. Secure multi-party protocols for privacy preserving data mining. In Yingshu Li, Dung T. Huynh, Sajal K. Das, and Ding-Zhu Du, editors, Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings, volume 5258 of Lecture Notes in Computer Science, pages 526-537. Springer, 2008. URL: http://dx.doi.org/10.1007/978-3-540-88582-5_49.
  12. David Vávra. Mobile Application for Group Expenses and Its Deployment. Master’s thesis, Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Computer Graphics and Interaction, 2012. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail