A Framework for the Study of Cryptographic Protocols

Authors:
Richard Berger;Sampath Kannan;René Peralta
Affiliations:
-;-;-
Venue:
CRYPTO '85 Advances in Cryptology
Year:
1985

Citing 8
Cited 0

An efficient probabilistic public key encryption scheme which hides all partial information

Proceedings of CRYPTO 84 on Advances in cryptology
Cryptoprotocols: Subscription to a public key, the secret blocking and the multi-player mental poker game

Proceedings of CRYPTO 84 on Advances in cryptology
Poker protocols

Proceedings of CRYPTO 84 on Advances in cryptology
The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to exchange (secret) keys

ACM Transactions on Computer Systems (TOCS)
On the Security of Ping-Pong Protocols when Implemented using the RSA

CRYPTO '85 Advances in Cryptology
Cryptographic protocols

Cryptographic protocols
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a simple model of computation under which to study the meaning of cryptographic protocol and security. We define a protocol as a mathematical object and security as a possible property of this object, Having formalized the concept of a secure protocol we study its general properties. We back up our contention that the model is reasonable by solving some well known cryptography problems within the framework of the model.