Abstract
In our opinion, the Foundations of Cryptography are the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems. In this essay, we survey some of these paradigms, approaches and techniques as well as some of the fundamental results obtained using them. Special effort is made in attempt to dissolve common misconceptions regarding these paradigms and results.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr. RSA/Rabin Functions: Certain Parts are As Hard As the Whole. SIAMJ. on Comput., Vol. 17, April 1988, pages 194–209.
D. Beaver. Foundations of Secure Interactive Computing. In Crypto91, Springer-Verlag LNCS (Vol. 576), pages 377–391.
M. Bellare, R. Canetti and H. Krawczyk. Pseudorandom functions Revisited: The Cascade Construction and its Concrete Security. In 37th FOCS, pages 514–523, 1996.
M. Bellare, R. Canetti and H. Krawczyk. Keying Hash Functions for Message Authentication. In Crypto96, Springer LNCS (Vol. 1109), pages 1–15.
M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In Crypto92, Springer-Verlag LNCS (Vol. 740), pages 390–420.
M. Bellare, O. Goldreich and S. Goldwasser. Incremental Cryptography: the Case of Hashing and Signing. In Crypto94, Springer-Verlag LNCS (Vol. 839), pages 216–233, 1994.
M. Bellare, O. Goldreich and S. Goldwasser. Incremental Cryptography and Application to Virus Protection. In 27th STOC, pages 45–56, 1995.
M. Bellare, S. Goldwasser and D. Micciancio. “Pseudo-random” Number Generation within Cryptographic Algorithms: the DSS Case. These proceedings.
M. Bellare, R. Guerin and P. Rogaway. XORMACs: New Methods for Message Authentication using Finite Pseudorandom Functions. In Crypto95, Springer-Verlag LNCS (Vol. 963), pages 15–28.
M. Bellare, J. Kilian and P. Rogaway. The Security of Cipher Block Chaining. In Crypto94, Springer-Verlag LNCS (Vol. 839), pages 341–358.
M. Bellare and S. Micali. How to Sign Given Any Trapdoor Function. J. of the ACM, Vol. 39, pages 214–233, 1992.
M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In 1st Conf. on Computer and Communications Security, ACM, pages 62–73,1993.
M. Bellare and P. Rogaway. Entity Authentication and Key Distribution. In Crypto93, Springer-Verlag LNCS (Vol. 773), pages 232–249, 1994.
M. Bellare and P. Rogaway. Provably Secure Session Key Distribution: The Three Party Case. In 27th STOC, pages 57–66,1995.
M. Bellare and P. Rogaway. The Exact Security of Digital Signatures: How to Sign with RSA and Rabin. In EuroCrypt96, Springer LNCS (Vol. 1070).
M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson. Multi-Prover Interactive Proofs: How to Remove Intractability. In 20th STOC, pages 113–131,1988.
M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1–10, 1988.
L. Blum, M. Blum and M. Shub. A Simple Secure Unpredictable Pseudo-Random Number Generator. SIAMJ. on Comput., Vol. 15, 1986, pages 364–383.
M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-Interactive Zero-Knowledge Proof Systems. SIAM J. on Comput., Vol. 20, No. 6, pages 1084–1118, 1991. (Considered the journal version of [20].)
M. Blum, P. Feldman and S. Micali. Non-Interactive Zero-Knowledge and its Applications. In 20th STOC, pages 103–112, 1988. See [19].
M. Blum and S. Goldwasser. An Efficient Probabilistic Public-Key Encryption Scheme which hides all partial information. In Crypto84, LNCS (Vol. 196) Springer-Verlag, pages 289–302.
M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAMJ. on Comput., Vol. 13, pages 850–864, 1984.
D. Boneh, R. DeMillo and R. Lipton. On the Importance of Checking Cryptographic Protocols for Faults. In EuroCrypt97, Springer LNCS (Vol. 1233), pages 37–51, 1997.
J.B. Boyar. Inferring Sequences Produced by Pseudo-Random Number Generators. J. of the ACM, Vol. 36, pages 129–141, 1989.
G. Brassard, D. Chaum and C. Crépeau. Minimum Disclosure Proofs of Knowledge. J. of Comp. and Sys. Sci., Vol. 37, No. 2, pages 156–189, 1988.
G. Brassard and C. Crépeau. Zero-Knowledge Simulation of Boolean Circuits. In Crypto86, Springer-Verlag LNCS (Vol. 263), pages 223–233, 1987.
R. Canetti. Studies in Secure Multi-Party Computation and Applications. Ph.D. Thesis, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, June 1995. Available from from http://theory.lcs.mit.edu/~tcryptol/BOOKS/ran-phd.html.
R. Canetti. Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information. These proceedings.
R. Canetti, C. Dwork, M. Naor and R. Ostrovsky. Deniable Encryption. These proceedings.
R. Canetti and R. Gennaro. Incoercible Multiparty Computation. In 37th FOCS, pages 504–513, 1996.
R. Canetti, S. Halevi and A. Herzberg. How to Maintain Authenticated Communication in the Presence of Break-Ins. In 16th Symp. on Principles of Distributed Computing, 1997.
R. Canetti and A. Herzberg. Maintaining Security in the Presence of Transient Faults. In Crypto94, Springer-Verlag LNCS (Vol. 839), pages 425–439.
L. Carter and M. Wegman. Universal Hash Functions. J. of Comp. and Sys. Sci, Vol. 18, 1979, pages 143–154.
D. Chaum. Blind Signatures for Untraceable Payments. In Crypto82, Plenum Press, pages 199–203, 1983.
D. Chaum, C. Crépeau and I. Damgård. Multi-party unconditionally Secure Protocols. In 20th STOC, pages 11–19, 1988.
D. Chaum, A. Fiat and M. Naor. Untraceable Electronic Cash. In Crypto88, Springer-Verlag LNCS (Vol. 403), pages 319–327.
B. Chor and N. Gilboa. Computationally Private Information Retrieval. In 29th STOC, pages 304–313, 1997.
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, Private Information Retrieval. In 36th FOCS, pages 41–50, 1995.
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In 26th FOCS, pages 383–395,1985.
R. Cleve. Limits on the Security of Coin Flips when Half the Processors are Faulty. In 18th STOC, pages 364–369,1986.
I. Damgård. Collision Free Hash Functions and Public Key Signature Schemes. In Euro-Crypt87, Springer-Verlag, LNCS (Vol. 304), pages 203–216.
I. Damgård. A Design Principle for Hash Functions. In Crypto89, Springer-Verlag LNCS (Vol. 435), pages 416–427.
I. Damgård, O. Goldreich, T. Okamoto and A. Wigderson. Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. In Crypto95, Springer-Verlag LNCS (Vol. 963), pages 325–338, 1995.
A. De-Santis, Y. Desmedt, Y. Frankel and M. Yung. How to Share a Function Securely. In 26th STOC, pages 522–533, 1994.
Y. Desmedt and Y. Frankel. Threshold Cryptosystems. In Crypto89, Springer-Verlag LNCS (Vol. 435), pages 307–315.
W. Diffie, and M.E. Hellman. New Directions in Cryptography. IEEE Trans. on Info. Theory, IT-22 (Nov. 1976), pages 644–54.
D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. In 23rd STOC, pages 542–552, 1991.
C. Dwork, and M. Naor. Pricing via Processing or Combatting Junk Mail. In Crypto92, Springer-Verlag LNCS (Vol. 740), pages 139–147.
C. Dwork, and M. Naor. An Efficient Existentially Unforgeable Signature Scheme and its Application. To appear in J. of Crypto.. Preliminary version in Crypto94.
S. Even, O. Goldreich and S. Micali. On-line/Off-line Digital signatures. J. of Crypto., Vol. 9, 1996, pages 35–67.
U. Feige, A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. J. of Crypto., Vol. 1, 1988, pages 77–94.
U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String. In 31th FOCS, pages 308–317, 1990. To appear in SIAM J. on Comput..
U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416–426, 1990.
P. Feldman. A Practical Scheme for Non-interactive Verifiable Secret Sharing. In 28th FOCS, pages 427–437, 1987.
A. Fiat. Batch RSA. J. of Crypto., Vol. 10, 1997, pages 75–88.
A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. In Crypto86, Springer-Verlag LNCS (Vol. 263), pages 186–189, 1987.
R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. In Euro-Crypt97, Springer LNCS (Vol. 1233), pages 267–279, 1997.
A.M. Frieze, J. Håstad, R. Kannan, J.C. Lagarias, and A. Shamir. Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAMJ. on Comput., Vol. 17, pages 262–280, 1988.
P.S. Gemmell. An Introduction to Threshold Cryptography. In CryptoBytes, RSA Lab., Vol. 2, No. 3, 1997.
O. Goldreich. Two Remarks Concerning the GMR Signature Scheme. In Crypto86, Springer-Verlag LNCS (Vol. 263), pages 104–110, 1987.
O. Goldreich. Lecture Notes on Encryption, Signatures and Cryptographic Protocol. Spring 1989. Available from http://theory.lcs.mit.edu/~oded/ln89.html
O. Goldreich. Foundation of Cryptography — Fragments of a Book. February 1995. Available from http://theory, les.mit.edu/~oded/frag.html
O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. J. of the ACM, Vol. 33, No. 4, pages 792–807, 1986.
O. Goldreich, S. Goldwasser, and S. Micali. On the Cryptographic Applications of Random Functions. In Crypto84, Springer-Verlag LNCS (Vol. 263), pages 276–288, 1985.
O. Goldreich, R. Impagliazzo, L.A. Levin, R. Venkatesan, and D. Zuckerman. Security Preserving Amplification of Hardness. In 31st FOCS, pages 318–326, 1990.
O. Goldreich and H. Krawczyk. On theComposition of Zero-Knowledge Proof Systems. SIAM J. on Comput., Vol. 25, No. 1, February 1996, pages 169–192.
O. Goldreich and L.A. Levin. Hard-core Predicates for any One-Way Function. In 21st STOC, pages 25–32, 1989.
O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. J. of the ACM, Vol. 38, No. 1, pages 691–729, 1991. See also preliminary version in 27th FOCS, 1986.
O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game — A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218–229, 1987.
O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. J. of Crypto., Vol. 7, No. 1, pages 1–32, 1994.
O. Goldreich and R. Ostrovsky. Software Protection and Simulation on Oblivious RAMs. J. of the ACM, Vol. 43, 1996, pages 431–473.
S. Goldwasser and L. A. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In Crypto90, Springer-Verlag LNCS (Vol. 537), pages 77–93.
S. Goldwasser and S. Micali. Probabilistic Encryption. J. of Comp. and Sys. Sci., Vol. 28, No. 2, pages 270–299, 1984. See also preliminary version in 14th STOC, 1982.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. on Comput., Vol. 18, pages 186–208, 1989.
S. Goldwasser, S. Micali, and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. on Comput., April 1988, pages 281–308.
S. Goldwasser, S. Micali and P. Tong. Why and How to Establish a Private Code in a Public Network. In 23rd FOCS, 1982, pages 134–144.
S. Goldwasser, S. Micali and A.C. Yao. Strong Signature Schemes. In 15th STOC, pages 431–439, 1983.
J. Håstad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One-Way Function. To appear in SIAM J. on Comput. Preliminary versions by Impagliazzo et. al. in 21st STOC (1989) and Håstad in 22nd STOC (1990).
J. Håstad, A. Schrift and A. Shamir. The Discrete Logarithm Modulo a Composite Hides O(n) Bits. J. of Comp. and Sys. Sci., Vol. 47, pages 376–404, 1993.
A. Herzberg, S. Jarecki, H. Krawczyk and M. Yu. Proactive Secret Sharing, or How to Cope with Perpetual Leakage. In Crypto95, Springer-Verlag LNCS (Vol. 963), pages 339–352.
R. Impagliazzo and M. Luby. One-Way Functions are Essential for Complexity Based Cryptography. In 30th FOCS, pages 230–235, 1989.
R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provable as Secure as Subset Sum. J. of Crypto., Vol. 9, 1996, pages 199–216.
R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-Way Permutations. In 21st STOC, pages 44–61, 1989.
R. Impagliazzo and M. Yung. Direct Zero-Knowledge Computations. In Crypto87, Springer-Verlag LNCS (Vol. 293), pages 40–51, 1987.
A. Juels, M. Luby and R. Ostrovsky. Security of Blind Digital Signatures. These proceedings.
J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. In 24th STOC, pages 723–732, 1992.
J. Kilian and E. Petrank. An Efficient Non-Interactive Zero-Knowledge Proof System for NP with General Assumptions. To appear in J. of Crypto..
E. Kushilevitz and R. Ostrovsky. Replication Is NOT Needed: A SINGLE Database, Computational PIR. TR CS0906, Department of Computer Science, Technion, May 1997.
L.A. Levin. One-Way Function and Pseudorandom Generators. Combinatorica, Vol. 7, pages 357–363, 1987.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
M. Luby and C. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. on Comput., Vol. 17, 1988, pages 373–386.
R.C. Merkle. Protocols for public key cryptosystems. In Proc. of the 1980 Symposium on Security and Privacy.
R.C. Merkle. A Digital Signature Based on a Conventional Encryption Function. In Crypto87, Springer-Verlag LNCS (Vol. 293), 1987, pages 369–378.
R.C. Merkle. A Certified Digital Signature Scheme. In Crypto89, Springer-Verlag LNCS (Vol. 435), pages 218–238.
S. Micali. Fair Public-Key Cryptosystems. In Crypto92, Springer-Verlag LNCS (Vol. 740), pages 113–138.
S. Micali and P. Rogaway. Secure Computation. In Crypto91, Springer-Verlag LNCS (Vol. 576), pages 392–404.
National Institute for Standards and Technology. Digital Signature Standard (Dss), Federal Register, Vol. 56, No. 169, August 1991.
M. Naor. Bit Commitment using Pseudorandom Generators. J. of Crypto., Vol. 4, pages 151–158, 1991.
M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung. Zero-Knowledge Arguments for NP can be Based on General Assumptions. In Crypto92, Springer-Verlag LNCS (Vol. 740), pages 196–214.
M. Naor and B. Pinkas. Visual Authentication and Identification. These proceedings.
M. Naor and O. Reingold. Synthesizers and their Application to the Parallel Construction of Pseudo-Random Functions. In 36th FOCS, pages 170–181, 1995.
M. Naor and O. Reingold. On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. In 29th STOC, pages 189–199,1997.
M. Naor and A. Shamir. Visual Cryptography. In EuroCrypt94, Springer-Verlag LNCS (Vol. 950), 1995, pages 1–12.
M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Application. 21st STOC, 1989, pp. 33–43.
M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks. In 22nd STOC, pages 427–437, 1990.
R. Ostrovsky and A. Wigderson. One-Way Functions are essential for Non-Trivial Zero-Knowledge. ⇎nd Israel Symp.on Theory of Computing and Systems, IEEE Comp. Soc. Press, pages 3–17, 1993.
R. Ostrovsky and M. Yung. How to Withstand Mobile Virus Attacks. In 10th Symp. on Principles of Distributed Computing, pages 51–59, 1991.
B. Pfitzmann. Digital Signature Schemes (General Framework and Fail-Stop Signatures). Springer LNCS (Vol. 1100), 1996.
M.O. Rabin. Digitalized Signatures. In Foundations of Secure Computation (R.A. DeMillo et. al. eds.), Academic Press, 1977.
M.O. Rabin. Digitalized Signatures and Public Key Functions as Intractable as Factoring. MIT/LCS/TR-212, 1979.
M.O. Rabin. How to Exchange Secrets by Oblivious Transfer. Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981.
T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In 21st STOC, pages 73–85, 1989.
R. Rivest, A. Shamir and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. CACM, Vol. 21, Feb. 1978, pages 120–126.
J. Rompel. One-way Functions are Necessary and Sufficient for Secure Signatures. In 22nd STOC, 1990, pages 387–394.
C.E. Shannon. Communication Theory of Secrecy Systems. Bell Sys. Tech. J., Vol. 28, pages 656–715, 1949.
A. Shamir. How to Share a Secret. CACM, Vol. 22, Nov. 1979, pages 612–613.
U.V. Vazirani and V.V. Vazirani. Efficient and Secure Pseudo-Random Number Generation. 25th FOCS, pages 458–463, 1984.
M. Wegman and L. Carter. New Hash Functions and their Use in Authentication and Set Equality. J. of Comp. and Sys. Sci., Vol. 22, 1981, pages 265–279.
A.C. Yao. Theory and Application of Trapdoor Functions. In 23rd FOCS, pages 80–91, 1982.
A.C. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162–167, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Goldreich, O. (1997). On the foundations of modern cryptography. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052227
Download citation
DOI: https://doi.org/10.1007/BFb0052227
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive