Abstract
The motivation for the current report lies in a number of questions concerning the current state of the art in security protocol design and analysis. Why is it so hard to develop a complete set of security requirements for a particular problem? For instance, even in the seemingly simple case of defining the secrecy property of an encryption algorithm it has taken decades to reach a degree of consensus, and even now new definitions are required in specific contexts. Similarly, even after more than twenty years of research on e-voting, there is still a lack of consensus as to which properties an e-voting protocol should satisfy. What did we learn from this research experience on e-voting? Can we apply the knowledge accumulated in this domain to similar domains and problems? Is there a methodology underlying the process of understanding a security protocol domain?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33(1), 167–226 (2004)
Crépeau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319–330. Springer, Heidelberg (1994)
Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. 41st Annual ACM Symposium on Theory of Computing (STOC 2009), pp. 169–178. ACM (2009)
Heather, J., Schneider, S., Teague, V.: Cryptographic protocols with everyday objects. Formal Aspects of Computing 26(1), 37–62 (2014)
Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 162–177. Springer, Heidelberg (2000)
Liberti, L., Raimondi, F.: The Secret Santa problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 271–279. Springer, Heidelberg (2008)
Andrew Neff, C.: Verifiable mixing (shuffling) of ElGamal pairs (2004)
Ramchen, K., Teague, V.: Parallel shuffling and its application to Prêt à Voter. In: Proc. Int. Conf. on Electronic Voting Technology/Workshop on Trustworthy Elections (EVT/WOTE 2010) (2010)
Roscoe, A.W.: Intensional specifications of security protocols. In: Proc. 9th IEEE Computer Security Foundations Workshop (CSFW 1996), pp. 28–38. IEEE (1996)
Stanley, R.P.: Enumerative combinatorics, vol. 1. Wadsworth Publ. Co., Belmont (1986)
Tel, G.: Cryptografie – Beveiliging van de digitale maatschappij. Addison-Wesley (2002)
Verelst, J.: Secure computing and distributed solutions to the Secret Santa problem. Master’s thesis, Computer Science Dept., University of Utrecht (2003)
Wikström, D.: Simplified submission of inputs to protocols. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 293–308. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauw, S., Radomirović, S., Ryan, P.Y.A. (2014). Security Protocols for Secret Santa. In: Christianson, B., Malcolm, J. (eds) Security Protocols XVIII. Security Protocols 2010. Lecture Notes in Computer Science, vol 7061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45921-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-45921-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45920-1
Online ISBN: 978-3-662-45921-8
eBook Packages: Computer ScienceComputer Science (R0)