Proceedings Article10.1145/800070.802214
Cryptographic protocols
Richard A. DeMillo,Nancy Lynch,Michael Merritt +2 more
- 05 May 1982
pp 383-400
287
TL;DR: A cryptographic transformation is a mapping f from a set of cleartext messages, M, to aSet of ciphertext messages, f, so that f(m) should be difficult to infer from f and public knowledge about f.
read more
Abstract: A cryptographic transformation is a mapping f from a set of cleartext messages, M, to a set of ciphertext messages. Since for m e M, f(m) should hide the contents of m from an enemy, f-1 should, in a certain technical sense, be difficult to infer from f(m) and public knowledge about f. A cryptosystem is a model of computation and communication which permits the manipulation of messages by cryptographic transformations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
4.7K
Impossibility of distributed consensus with one faulty process
Michael J. Fischer,Nancy Lynch,Mike Paterson +2 more
- 21 Mar 1983
TL;DR: It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem.
3.7K
A logic of authentication
Michael Burrows,Martín Abadi,Roger M. Needham +2 more
- 01 Nov 1989
TL;DR: This paper describes the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication, and gives the results of the analysis of four published protocols.
A logic of authentication
TL;DR: This paper describes the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication, and gives the results of the analysis of four published protocols.
2.8K
A randomized protocol for signing contracts
TL;DR: The 1-out-of-2 oblivious transfer as discussed by the authors allows one party to transfer exactly one secret, out of two recognizable secrets, to his counterpart, while the sender is ignorant of which secret has been received.
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Communication theory of secrecy systems
TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
On the security of public key protocols
Danny Dolev,Andrew Chi-Chih Yao +1 more
TL;DR: Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.