Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Bond, M., & Danezis, G. (2007). The dining freemasons (security protocols for secret societies). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4631 LNCS, pp. 258–265). Springer Verlag. https://doi.org/10.1007/978-3-540-77156-2_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
