Cryptographic protocols

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: David L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, v.24 n.2, p.84-90, Feb. 1981 [doi>10.1145/358549.358563]
• 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: Alan G. Konheim, Cryptography, a Primer, John Wiley & Sons, Inc., New York, NY, 1981
• 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: Roger M. Needham , Michael D. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, v.21 n.12, p.993-999, Dec. 1978 [doi>10.1145/359657.359659]
• 14: M. Pease , R. Shostak , L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM (JACM), v.27 n.2, p.228-234, April 1980 [doi>10.1145/322186.322188]
• 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. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION, Massachusetts Institute of Technology, Cambridge, MA, 1979
• 17: R. L. Rivest , A. Shamir , L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, v.21 n.2, p.120-126, Feb. 1978 [doi>10.1145/359340.359342]
• 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.