Article

Free access

Cryptographic protocols

Authors:

Richard A. DeMillo,

Nancy A. Lynch,

Michael J. MerrittAuthors Info & Claims

STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing

Pages 383 - 400

https://doi.org/10.1145/800070.802214

Published: 05 May 1982 Publication History

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.

References

[1]

M. Blum, M. Rabin, Applications of the oblivious transfer, presented at the CRYPTO81 workshop in Santa Barbara (1981).

[2]

D. Chaum, Untraceable electronic mail, return addresses and digital pseudonyms, CACM (February 1981) Vol. 24: #2 84-88.

Digital Library

[3]

R. DeMillo, R. Lipton, A system architecture to support a verifiably secure multilevel security system, Proceedings 1980 IEEE Symposium on Security and Privacy (April 1980) Berkeley, Ca.

[4]

W. Diffie, M. Hellman, New directions in cryptography, IEEE Trans. on Inf. Theory (1976) Vol. IT-22, 644-654.

[5]

D. Dolev, A. Yao, On the security of public key protocols, Proc. 22nd Ann. FOCS Symp. (28-30 October 1981) 350-357.

[6]

S. Even, Y. Ya-&-ccedil;obi, Relations among public key signature systems, Technion Technical Report #175 (March 1980).

[7]

M. Fischer, N. Lynch, L. Lamport, A lower bound for the time to assure intereractive consistency, 1981, to appear.

[8]

Konnheim, Cryptography: A Primer Wiley and Sons (1981) New York.

Digital Library

[9]

E. Leiss, A note on a signature system based on probabilistic logic, Information Processing Letters (20 October 1980) Vol. 11: #2, 110-113.

[10]

R. Lipton, On the safety of cryptosystems (1980) manuscript.

[11]

S. Matyas, Digital Signatures-&-mdash;An Over-view Computer Networks Vol 3 (1979), .pp 87-94.

[12]

R. Merkle, Protocols for public key cryptosystems Proc. IEEE 1980 Symp. on Security and Privacy (14-16 April 1980) Oakland, Ca. 122-136.

[13]

R. Needham, M. Schroeder, Using Encryption for authentication in large networks of computers, CACM (December 1978) Vol. 21: #21, 993-999.

Digital Library

[14]

M. Pease, R. Shostak, L. Lamport, Reaching agreement in the presence of Faults, JACM (April 1980) Vol. 27: #2, 228-234.

Digital Library

[15]

M. Rabin, Digitalized signatures, in: R.A. DeMillo, D.P. Dobkin, A.K. Jones and R.J. Lipton, Eds., {ul Foundations of Secure Computation} (Academic Press, 1978) 155-168.

[16]

M. Rabin, Digitalized signatures and public-key functions as intractable as factorization, MIT Report (January 1979).

Digital Library

[17]

R. Rivest, A. Shamir and L. Adleman A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol. 21, no. 2 (February, 1978), pp. 120-126.

Digital Library

[18]

A. Shamir, R. Rivest, L. Adleman, Mental Poker, MIT/LCS/TM-125 (29 January 1979).

[19]

C. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J. (October 1949) Vol. 28, 656-715.

Cited By

Pan HTa QZhang MZhao ZChee YChen GOoi B(2024)FC: Adaptive Atomic Commit via Failure Detection2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00162(2026-2039)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00162
Banerjee PMuthaiah ARuj S(2021)Blockchain Enabled Data Trading with User Consent2021 International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS51098.2021.9352817(263-271)Online publication date: 5-Jan-2021
https://doi.org/10.1109/COMSNETS51098.2021.9352817
Gupta SHellings JRahnama SSadoghi M(2020)Building high throughput permissioned blockchain fabricsProceedings of the VLDB Endowment10.14778/3415478.341556513:12(3441-3444)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3415478.3415565
Show More Cited By

Cryptographic protocols

Recommendations

On the computational soundness of formal analysis of cryptographic protocols
Cryptographic tamper evidence
CCS '03: Proceedings of the 10th ACM conference on Computer and communications security

We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div can determine whether one of them was generated by the forger. ...
Escrow-free encryption supporting cryptographic workflow

Since Boneh and Franklin published their seminal paper on identity based encryption (IBE) using the Weil pairing, there has been a great deal of interest in cryptographic primitives based on elliptic-curve pairings. One particularly interesting ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing

May 1982

408 pages

ISBN:0897910702

DOI:10.1145/800070

Copyright © 1982 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 May 1982

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
472
Total Downloads

Downloads (Last 12 months)226
Downloads (Last 6 weeks)29

Reflects downloads up to 22 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Pan HTa QZhang MZhao ZChee YChen GOoi B(2024)FC: Adaptive Atomic Commit via Failure Detection2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00162(2026-2039)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00162
Banerjee PMuthaiah ARuj S(2021)Blockchain Enabled Data Trading with User Consent2021 International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS51098.2021.9352817(263-271)Online publication date: 5-Jan-2021
https://doi.org/10.1109/COMSNETS51098.2021.9352817
Gupta SHellings JRahnama SSadoghi M(2020)Building high throughput permissioned blockchain fabricsProceedings of the VLDB Endowment10.14778/3415478.341556513:12(3441-3444)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3415478.3415565
Renggli CRimanic LKolar LWu WZhang C(2020)Ease.ml/snoopy in actionProceedings of the VLDB Endowment10.14778/3415478.341548813:12(2837-2840)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3415478.3415488
Gan YRen XRipberger DBlanas SWang Y(2020)IsoDiffProceedings of the VLDB Endowment10.14778/3407790.340786013:12(2773-2786)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.14778/3407790.3407860
Xu MDing BWang TZhou J(2020)Collecting and analyzing data jointly from multiple services under local differential privacyProceedings of the VLDB Endowment10.14778/3407790.340785913:12(2760-2772)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407859
Fang JShen YWang YChen L(2020)Optimizing DNN computation graph using graph substitutionsProceedings of the VLDB Endowment10.14778/3407790.340785713:12(2734-2746)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.14778/3407790.3407857
Glasbergen BAbebe MDaudjee KLevi A(2020)SentinelProceedings of the VLDB Endowment10.14778/3407790.340785613:12(2720-2733)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407856
Piao CZheng WRong YCheng H(2020)Maximizing the reduction ability for near-maximum independent set computationProceedings of the VLDB Endowment10.14778/3407790.340783813:12(2466-2478)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.14778/3407790.3407838
Suprem AArulraj JPu CFerreira J(2020)ODINProceedings of the VLDB Endowment10.14778/3407790.340783713:12(2453-2465)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407837
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents