The Secret Santa Problem

Liberti, Leo; Raimondi, Franco

doi:10.1007/978-3-540-68880-8_26

Cited by 4 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Liberti and Raimondi studied the problem from a different point of view. They are not proposing a protocol but an algorithm to determine if a solution exists under certain constraints, including an anonymity requirement [3]. Definition 1.…”

Section: Related Workmentioning

confidence: 99%

Security Protocols for Secret Santa

Mauw

Radomirović

Ryan

2014

Security Protocols XVIII

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Security Protocols for Secret Santa

Mauw

Radomirović

Ryan

2014

Security Protocols XVIII

View full text Add to dashboard Cite

“…If the family S is the set of all Vertex Disjoint Circuit Covers (VDCCs), we obtain the Secret Santa Problem described in [2].…”

Section: Secret Santa Problemmentioning

confidence: 99%

“…As shown in [2] it can be done in O(n 1 2 m) by solving an assignment problem on a bipartite graph B = (U 1 , U 2 , A ), where U 1 = U 2 = V \ {i, j} and A = P .…”

Section: Secret Santa Problemmentioning

confidence: 99%

The Anonymous Subgraph Problem

Bettinelli

Liberti

Raimondi

et al. 2013

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

“…Secret Santa is a Christmas tradition, where members of a group are randomly assigned to another person, to whom they have to offer a gift. The identity of the person offering the present is usually secret [12,14,15], as well as the price of the present. Moreover, the participants often determine a common bound for the gift's prices.…”

Section: Introductionmentioning

confidence: 99%

A Faster Cryptographer's Conspiracy Santa

Bultel¹,

Dreier²,

Dumas³

et al. 2020

Preprint

View full text Add to dashboard Cite

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 exist good greedy approximations. Second, we present a greedy distributed secure solution to Conspiracy Santa. This solution allows a group of n 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 to 2 • n + 1 with respect to a naïve aggregation of n • (n − 2). 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, over Internet, using a cryptocurrency.

show abstract

The Secret Santa Problem

Cited by 4 publications

References 8 publications

Security Protocols for Secret Santa

Security Protocols for Secret Santa

The Anonymous Subgraph Problem

A Faster Cryptographer's Conspiracy Santa

Contact Info

Product

Resources

About