The Dining Freemasons (Security Protocols for Secret Societies)

  • Mike Bond
  • George Danezis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4631)


We continue the popular theme of offline security by considering how computer security might be applied to the challenges presented in running a secret society. We discuss membership testing problems and solutions, set in the context of security authentication protocols, and present new building blocks which could be used to generate secret society protocols more robustly and generically, including the lie channel and the compulsory arbitrary decision model.


Authentication Protocol Security Protocol Computer Security Replay Attack Covert Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blaze, M.: Toward a Broader View of Security Protocols. In: Twelfth International Workshop on Security Protocols, Cambridge, UK (April 26-28, 2004)Google Scholar
  2. 2.
    Schneier, B.: Crypto-Gram Newsletter (August 15, 2004)Google Scholar
  3. 3.
  4. 4.
    Clocksin, W.: University of Cambridge, Computer Science Tripos 2000, Paper 9, Question 9 (2000),
  5. 5.
    Atallah, M.J., Raskin, V., Crogan, M., Hempelmann, C., Kerschbaum, F., Mohamed, D., Naik, S.: Natural Language Watermarking: Design, Analysis, and a Proof-of-Concept Implementation. In: Moskowitz, I.S. (ed.) Information Hiding. LNCS, vol. 2137, pp. 185–199. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mike Bond
    • 1
  • George Danezis
    • 1
  1. 1.Computer Laboratory, University of Cambridge, JJ Thompson Av., CB3 0FDUK

Personalised recommendations