The dining freemasons: security protocols for secret societies

Authors:
Mike Bond;George Danezis
Affiliations:
Computer Laboratory, University of Cambridge, UK;Computer Laboratory, University of Cambridge, UK
Venue:
Proceedings of the 13th international conference on Security protocols
Year:
2005

Citing 2
Cited 1

Natural Language Watermarking: Design, Analysis, and a Proof-of-Concept Implementation

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Toward a broader view of security protocols

SP'04 Proceedings of the 12th international conference on Security Protocols

SILENTKNOCK: practical, provably undetectable authentication

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

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.