On the security of public key protocols

@article{Dolev1981OnTS,
  title={On the security of public key protocols},
  author={Danny Dolev and Andrew Chi-Chih Yao},
  journal={22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)},
  year={1981},
  pages={350-357}
}
  • D. Dolev, A. Yao
  • Published 1 March 1983
  • Computer Science
  • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
Recently the use of public key encryption to provide secure network communication has received considerable attention. Such public key systems are usually effective against passive eavesdroppers, who merely tap the lines and try to decipher the message. It has been pointed out, however, that an improperly designed protocol could be vulnerable to an active saboteur, one who may impersonate another user or alter the message being transmitted. Several models are formulated in which the security of… 
The Verifiability of Two-Party Protocols
TLDR
Dolev and Yao have shown how informal arguments about protocols can lead to erroneous conclusions, and they have developed formal models of two-party protocols, both cascade protocols and name-stamp protocols that are secure.
Why and how to establish a private code on a public network
TLDR
It is shown how users, which are more powerful adversarys than the traditionally considered passive eavesdroppers, can decrypt other users messages, in implementations of Public Key Cryptosystem using the RSA function, the Rabin function and the Goldwasser&Micali scheme.
Encryption-Scheme Security in the Presence of Key-Dependent Messages
TLDR
A new notion of security, KDM security, appropriate for key-dependent messages, makes sense in both the public-key and shared-key settings and is shown to be easily achievable within the random-oracle model.
Informal Analysis Schemes of Cryptographic Protocols
TLDR
An informal analysis approach based on trusted freshness is presented, and the analysis results suggest the correctness of a protocol or the way to construct attacks intuitively from the absence of security properties.
Simple Three-Party Password-Based Key Exchange Protocol with Provable Security
TLDR
A simple 3PAKE protocol based upon elliptic curve cryptography along with formal security proof under the decisional Diffie–Hellman assumption is proposed, which has lower computation costs and lighter communication loads.
A NOVEL APPROACH TO INFORMATION SECURITY USING SAFE EXCHANGE OF ENCRYPTED DATA (SEED)
TLDR
Application of this crypto-system will have a huge impact in the future of transmitting secure data especially in the fiel d of business transaction and military operations.
A Bound on Attacks on Authentication Protocols
  • S. Stoller
  • Computer Science, Mathematics
    IFIP TCS
  • 2002
TLDR
A bound on the number of protocol executions that could be useful in attacks is established, which applies to a large class of protocols, which contains versions of some well-known authentication protocols, including the Yahalom, Otway-Rees, and Needham-Schroeder-Lowe protocols.
A Complete Characterization of Secure Human-Server Communication
TLDR
A general communication topology model is introduced to facilitate the analysis of security protocols in this setting and can serve to guide the design of novel solutions for applications and to quickly exclude proposals that cannot possibly offer secure communication.
A Complete Characterization of Secure Human-Server Communication
TLDR
A general communication topology model is introduced to facilitate the analysis of security protocols in this setting and is used to completely characterize all topologies that allow secure communication between a human and a remote server via a compromised computer.
Active Protection of Trusted Security Services
TLDR
A method to detect anomalies in Public Key Infrastructure traffic based on techniques proven in intrusion detection research and products is offered and proper autonomic responses to the anomalies that it can detect are suggested.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
Multiuser cryptographic techniques
TLDR
It is shown how such a public key cryptosystem would allow the development of an authentication system which generates an unforgeable, message dependent digital signature.
Using encryption for authentication in large networks of computers
Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of
A method for obtaining digital signatures and public-key cryptosystems
TLDR
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
New directions in cryptography
TLDR
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.
A Linear Time Algorithm for Deciding Subject Security
TLDR
A particular protection mechanism from the protection hterature-the take and grant system--is presented and it is shown that the safety problem can be solved in linear time.
Reaching Agreement in the Presence of Faults
TLDR
It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.
Protection in operating systems
TLDR
A model of protection mechanisms in computing systems is presented and its appropriateness is argued and it can be shown that this problem is decidable, i.e. there is an algorithm to determine whether a system in a particular configuration is safe.
The Byzantine Generals Strike Again
  • D. Dolev
  • Computer Science
    J. Algorithms
  • 1982
A linear time algorithm for deciding
  • IEEE TRANSACTIONS ON INFORMATION THEORY
  • 1983
Encryption protocols , public key algoritJuns , and digital signatures in corn puter networks
  • Foundations of Secure ( Jomputation
  • 1980
...
1
2
3
...