Security Protocols for Secret Santa

Mauw, Sjouke; Radomirović, Saša; Ryan, Peter Y. A.

doi:10.1007/978-3-662-45921-8_26

Cited by 3 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mauw, Radomirović and Ryan discuss this problem, and provide a solution [4]. Their algorithm gives an arbitrary derangement, so that it is guaranteed that no one is assigned to buy a gift for himself; it does not make any further restrictions on the nature of the assignments.…”

Section: Envelopes: Secret Santamentioning

confidence: 99%

Cryptographic protocols with everyday objects

2014

View full text Add to dashboard Cite

Abstract. Most security protocols appearing in the literature make use of cryptographic primitives that assume that the participants have access to some sort of computational device. However, there are times when there is need for a security mechanism to evaluate some result without leaking sensitive information, but computational devices are unavailable. We discuss here various protocols for solving cryptographic problems using everyday objects: coins, dice, cards, and envelopes.

show abstract

Section: Envelopes: Secret Santamentioning

confidence: 99%

Cryptographic protocols with everyday objects

2014

View full text Add to dashboard Cite

show abstract

“…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

Crypto Santa

Ryan

2016

The New Codebreakers

View full text Add to dashboard Cite

Security Protocols for Secret Santa

Cited by 3 publications

References 11 publications

Cryptographic protocols with everyday objects

Cryptographic protocols with everyday objects

A Faster Cryptographer's Conspiracy Santa

Crypto Santa

Contact Info

Product

Resources

About