James Heather
Abstract
Abstract
Most security protocols appearing in the literature make use of cryptographic primitives that assume that the participants have access to some sort of computational device. However, there are times when there is need for a security mechanism to evaluate some result without leaking sensitive information, but computational devices are unavailable. We discuss here various protocols for solving cryptographic problems using everyday objects: coins, dice, cards, and envelopes.
- Cha88 The dining cryptographers problem: unconditional sender and recipient untraceabilityJ Cryptol198811657510.1007/BF002063260654.94012935902Google Scholar
Cross Ref
- ElG85 A public-key cryptosystem and a signature scheme based on discrete logarithmsIEEE Trans Inf Theory19853146947210.1109/TIT.1985.10570740571.94014798552Google ScholarDigital Library
- For97 Formal Systems (Europe) Ltd (1997) Failures-divergence refinement—FDR 2 user manual. Formal Systems’ web site. http://www.formal.demon.co.uk/FDR2.htmlGoogle Scholar
- GW05 Goldsmith M, Whittaker P (2005) A CSP frontend for probabilistic tools. Technical report, The FORWARD project, June 2005. http://forward-project.org.uk/PDF_Files/D14.pdf. Accessed 14 Aug 2012Google Scholar
- KLN+06 Comparing BDD and SAT based techniques for model checking Chaum’s dining cryptographers protocolFundam Inf2006721–32152341097.680742265163Google ScholarDigital Library
- MMSS96 Refinement-oriented probability for CSPForm Asp Comp19968661764710.1007/BF012134920862.68050Google ScholarDigital Library
- MRR10 Mauw S, Radomirović S, Ryan PY (2010) Security protocols for Secret Santa. In: Proceedings of 18th Security Protocols workshop, 24–26 March 2010. Lecture notes in computer science. SpringerGoogle Scholar
- RGG+95 Roscoe AW, Gardiner PHB, Goldsmith M, Hulance JR, Jackson DM, Scattergood JB (1995) Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: Brinksma Ed, Cleaveland R, Guldstrand Larsen K, Margaria T, Steffen B (eds) TACAS. Lecture notes in computer science, vol 1019. Springer, Berlin, pp 133–152Google Scholar
- Ros10 Understanding concurrent systems20101New YorkSpringer10.1007/978-1-84882-258-01211.68205Google ScholarCross Ref
- Sch99a Schneider SA (1999) Concurrent and real-time systems: the CSP approach. WileyGoogle Scholar
- Sch99b Schneier B (1999) The solitaire encryption algorithm. http://www.schneier.com/solitaire.html. Accessed 22 March 2011Google Scholar
- Sin11 Singh S (2011) Personal communication, March 2011Google Scholar
- SS96 Schneider S, Sidiropoulos A (1996) CSP and anonymity. In: Bertino E, Kurth H, Martella G, Montolivo E (eds) European symposium on Research Into Computer Security (ESORICS) 96. Lecture notes in computer science, vol 1146, pp 198–218. Springer, Berlin-HeidelbergGoogle Scholar
- Ste00 Stephenson N (2000) Cryptonomicon. Arrow BooksGoogle Scholar
- vdMS04 van der Meyden R, Su K (2004) Symbolic model checking the knowledge of the dining cryptographers. In: Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW), June 2004Google Scholar
Index Terms
- Cryptographic protocols with everyday objects
Recommendations
A rational approach to cryptographic protocols
This work initiates an analysis of several cryptographic protocols from a rational point of view using a game-theoretical approach, which allows us to represent not only the protocols but also possible misbehaviours of parties. Concretely, several ...
Stateless Cryptographic Protocols
FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer ScienceSecure computation protocols inherently involve multiple rounds of interaction among the parties where, typically a party has to keep a state about what has happened in the protocol so far and then \emph{wait} for the other party to respond. We study if ...
Resource Fairness and Composability of Cryptographic Protocols
We introduce the notion of resource-fair protocols. Informally, this property states that if one party learns the output of the protocol, then so can all other parties, as long as they expend roughly the same amount of resources. As opposed to ...
Comments