Cryptographic protocols

Authors:
Richard A. DeMillo;Nancy A. Lynch;Michael J. Merritt
Affiliations:
-;-;-
Venue:
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Year:
1982

Citing 6
Cited 51

Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Using encryption for authentication in large networks of computers

Communications of the ACM
Cryptography, a Primer

Cryptography, a Primer
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

A randomized protocol for signing contracts

Communications of the ACM
Distributing the power of a government to enhance the privacy of voters

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A secure and privacy-protecting protocol for transmitting personal information between organizations

Proceedings on Advances in cryptology---CRYPTO '86
Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
Secure and verifiable schemes for election and general distributed computing problems

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A hundred impossibility proofs for distributed computing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A logic of authentication

SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
A logic of authentication

ACM Transactions on Computer Systems (TOCS)
A universal problem in secure and verifiable distributed computation

CRYPTO '88 Proceedings on Advances in cryptology
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Bounds on the time to reach agreement in the presence of timing uncertainty

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Augmented encrypted key exchange: a password-based protocol secure against dictionary attacks and password file compromise

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Bounds on the time to reach agreement in the presence of timing uncertainty

Journal of the ACM (JACM)
Receipt-free secret-ballot elections (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
On the importance of securing your bins: the garbage-man-in-the-middle attack

Proceedings of the 4th ACM conference on Computer and communications security
Digital signatures with RSA and other public-key cryptosystems

Communications of the ACM
Impossibility of distributed consensus with one faulty process

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
Taming the Adversary

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Ping-Pong Protocols when Implemented using the RSA

CRYPTO '85 Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Secure Computation (Abstract)

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Cryptographic Scheme for Computerized Elections

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provably Unforgeable Signatures

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Optimistic Trust with Realistic eNvestigators (Position Paper)

Proceedings of the 6th International Workshop on Security Protocols
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Anonymity without 'Cryptography'

FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Self-tallying Elections and Perfect Ballot Secrecy

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Bounds on information exchange for Byzantine Agreement

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Elections in the presence of faults

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Strong signature schemes

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Strong signature schemes

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Uniform consensus is harder than consensus

Journal of Algorithms
Privacy management for portable recording devices

Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Authentication: a practical study in belief and action

TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Knowledge and common knowledge in a byzantine environment I: crash failures

TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Simple verifiable elections

EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Ballot casting assurance via voter-initiated poll station auditing

EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Fair Exchange Is Incomparable to Consensus

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Administrative and public verifiability: can we have both?

EVT'08 Proceedings of the conference on Electronic voting technology
Approximating Imperfect Cryptography in a Formal Model

Electronic Notes in Theoretical Computer Science (ENTCS)
E-voting without 'cryptography'

FC'02 Proceedings of the 6th international conference on Financial cryptography
Security protocols: principles and calculi tutorial notes

Foundations of security analysis and design IV
On the number of synchronous rounds sufficient for authenticated byzantine agreement

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Limitations on design principles for public key protocols

SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Tree-Homomorphic encryption and scalable hierarchical secret-ballot elections

FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
A secure and practical electronic voting scheme

Computer Communications

Quantified Score

Hi-index	0.03

Visualization

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.