Security protocols for secret Santa

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


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?
Original languageEnglish
Title of host publicationSecurity Protocols XVIII
EditorsBruce Christianson, James Malcolm
Number of pages10
ISBN (Electronic)9783662459218
ISBN (Print)9783662459201
Publication statusPublished - 2014
Event18th International Workshop Security Protocols 2010 - Cambridge, United Kingdom
Duration: 24 Mar 201026 Mar 2010

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference18th International Workshop Security Protocols 2010
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Security protocols for secret Santa'. Together they form a unique fingerprint.

Cite this