Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM

Volumn 51, Issue 2, 2004, Pages 231-262

  Naor, Moni ^a   Reingold, Omer ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Constant depth threshold circuits; Decision diffie hellman; Factoring; Learning theory; Natural proofs; Pseudo random functions

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; DATA REDUCTION; FORMAL LOGIC; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PARAMETER ESTIMATION; PROBLEM SOLVING; STATISTICS; THEOREM PROVING;

CONSTANT-DEPTH THRESHOLD CIRCUITS; DECISION DIFFIE-HELLMAN; FACTORING; LEARNING THEORY; NATURAL PROOFS; PSEUDO-RANDOM FUNCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 4243054954     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/972639.972643     Document Type: Article

References (66)

1. ANGLUIN, D., AND KHARITONOV, M. 1995. When won't membership queries help?, J. Comput. Syst. Sci. 50, 336-355.
2. BEAME, P. W., COOK, S. A., AND HOOVER, H. J. 1986, Log depth circuits for division and related problems. SIAM J. Comput. 15, 994-1003.
3. BELLARE, M., AND GOLDWASSER, S. 1990. New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In Proceedings of Advances in Cryptology - CRYPTO '89. Lecture Notes in Computer Science, Springer-Verlag, New York, 194-211.
4. BELLARE, M., AND MICALI, S. 1990. Non-interactive oblivious transfer and applications. In Proceedings of Advances in Cryptology - CRYPTO '89. Lecture Notes in Computer Science, Springer-Verlag, New York, 547-557.
5. BIHAM, E. BONEH, D., AND REINGOLD, O. 1997. Breaking generalized Diffie-Hellman modulo a composite is no easier than Factoring. Theory of Cryptography Library, Record 97-14 at: http://theory.lea.mit.edu/tcryptol/ homepage.html
6. BLUM, L. BLUM, M., AND SHUB, M. 1986. A simple secure unpredictable pseudo-random number generator. SIAM J. Comput. 15, 364-383.
7. BLUM, M., EVANS, W., GEMMELL, P., KANNAN, S., AND NAOR, M. 1994. Checking the correctness of memories. Algorithmica, 225-244.
8. BLUM, M., AND GOLDWASSER, S. 1984. An efficient probabilistic public-key encryption scheme which hides all partial information. In Proceedings of Advances in Cryptology - CRYPTO '84. Lecture Notes in Computer Science, vol. 196. Springer-Verlag, New York, 289-302.
9. BLUM, M., AND MICALI, S. 1984. How to generate cryptographically strong sequence of pseudo-random bits. SIAM J. Comput. 13, 850-864.
10. BONEH, D. 1998. The decision Diffie-Hellman problem. In Proceedings of the 3rd Algorithmic Number Theory Symposium. Lecture Notes in Computer Science, vol. 1423. Springer-Verlag, New York, 48-63.
11. BONEH, D., AND LIPTON, R. 1996. Algorithms for black-box fields and their application to cryptography. In Proceedings of the Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science, vol. 1109. Springer-Verlag, New York, 283-297.
12. BONEH, D., AND VENKATESAN, R. 1996. Hardness of computing most significant bits in secret keys in Diffie-Hellman and related schemes. In Proceedings of Advances in Cryptology - CRYPTO '96. Lecture Notes in Computer Science, vol. 1109. Springer-Verlag, New York, 129-142.
13. BRANDS, S. 1993. An efficient off-line electronic cash system based on the representation problem. CWI Tech. Rep., CS-R9323.
14. BRASSARD, G. 1988. Modern cryptology. Lecture Notes in Computer Science, vol. 325. Springer-Verlag, New York.
15. BRICKELL, E. F., GORDON, D. M., MCCURLEY, K. S., AND WILSON, D. B. 1992. Fast exponentiation with precomputation. In Proceedings of Advances in Cryptology - EUROCRYPT '92. Lecture Notes in Computer Science, Springer-Verlag, New York, 200-207.
16. CANETTI, R. 1997. Towards realizing random oracles: hash functions that hide all partial information. In Proceedings of Advances in Cryptology - CRYPTO '97. Lecture Notes in Computer Science. Springer-Verlag, New York, 455-469.
17. CANETTI, R., FRIEDLANDER, J., AND SHPARLINSKI, I. 1997. On certain exponential sums and the distribution of Diffie-Hellman triples. Research report, IBM T. J. Watson Research Center, Number RC 20915 (92645), July.
18. CHAUM, D., AND VAN ANTWERPEN, H. 1990. Undeniable signatures. In Proceedings of Advances in Cryptology - CRYPTO '89. Lecture Notes in Computer Science. Springer-Verlag, New York, 212-216.
19. CHOR, B., FIAT, A., AND NAOR, M. 1994. Tracing traitors. In Proceedings of Advances in Cryptology CRYPTO ' 94. Lecture Notes in Computer Science, vol. 839. Springer-Verlag, 257-270.
20. CRAMER, R., AND SHOUP, V. 1998. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Proceedings of Advances in Cryptology - CRYPTO '98. Lecture Notes in Computer Science, vol. 1462. Springer-Verlag, New York, 13-25.
21. DE SANTIS, A., DESMEDT, Y., FRANKEL, Y., AND YUNG, M. 1994. How to share a function securely. In Proceedings of the 26th ACM Symposium on Theory of Computing. ACM, New York, 522-533.
22. DIFFIE, W., AND HELLMAN, M. 1976. New directions in cryptography. IEEE Trans. Inform. Theory 22, 6, 644-654.
23. EL GAMAL, T. 1985. A public-key cryptosy stem and a signature scheme based on discrete logarithms. In Proceedings of Advances in Cryptology - CRYPTO '84. Lecture Notes in Computer Science, vol. 196. Springer-Verlag, New York, 10-18.
24. FRANKLIN, M., AND HABER, S. 1996. Joint encryption and message-efficient secure computation. J. Cryptology 9, 4, 217-232.
25. GERTNER, Y., AND MALKIN, T. 1997. A PSRG based on the decision Diffie-Hellman assumption, preprint.
26. GOLDREICH, O. 1987. Two remarks concerning the Goldwasser-Micali-Rivest signature scheme. In Proceedings of Advances in Cryptology - CRYPTO' 86. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, New York, 104-110.
27. GOLDREICH, O. 1995. Foundations of Cryptography (fragments of a book). Electronic publication: http://www.eccc.uni-trier.de/eccc/info/ECCC-Books/eccc- books.html (Electronic Colloquium on Computational Complexity).
28. GOLDREICH, O. 1998. Modern cryptography, probabilistic proofs and pseudo-randomness. Algorithms Combin. 17.
29. GOLDREICH, O., GOLDWASSER, S., AND MICALI, S. 1985. On the cryptographic applications of random functions. In Proceedings of Advances in Cryptology - CRYPTO '84. Lecture Notes in Computer Science, vol. 196. Springer-Verlag, New York, 276-288.
30. GOLDREICH, O., GOLDWASSER, S., AND MICALI, S. 1986. How to construct random functions. J. ACM 33, 792-807.
31. GOLDREICH, O., AND LEVIN, L. 1989. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM, New York, 25-32.
32. GOLDWASSER, S., AND MICALI, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270-299.
33. GOLDREICH, O., AND OSTROVSKY, R. 1996. Software protection and simulation on oblivious RAMs. J. ACM 43, 3, 431-473.
34. HASTAD, J., IMPAGLIAZZO, R., LEVIN, L. A., AND LUBY, M. 1999. Construction of a pseudo-random generator from any one-way function. SIAM J. Comput. 28, 4, 1364-1396.
35. IMPAGLIAZZO, R., AND NAOR, M. 1996. Efficient cryptographic schemes provably secure as subset sum. J. Crypt. 9, 199-216.
36. IMPAGLIAZZO, R., AND ZUCKERMAN, D. 1989. Recycling random bits. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 248-253.
37. JOUX, A., AND NGUYEN, K. 2001. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups, Cryptology ePrint Archive, Report 2001/003, 2001. http://eprint.iacr.org.
38. KEARNS, M., AND VALIANT, L. 1994. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM 41, 1, 67-95.
39. KHARITONOV, M. 1993. Cryptographic hardness of distribution-specific learning. In Proceedings of the 25th ACM Symposium on Theory of Computing. 372-381.
40. KRAUSE, M., AND LUCKS, S. 2001. On the minimal hardware complexity of pseudorandom function generators. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science 419-430.
41. LANGBERG, M. 1998. An implementation of efficient pseudo-random functions. At: http://www.wisdom.weizmann.ac.il/~naor/p_r_func/abs/abs.html.
42. LINIAL, N. MANSOUR, Y., AND NISAN, N. 1993. Constant depth circuits, Fourier transform, and learnability. J. ACM 40, 3, 607-620.
43. LUBY, M. 1996. Pseudo-randomness and applications. Princeton University Press, Princeton, N.J.
44. LUBY, M., AND RACKOFF, C. 1988. How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Comput. 17, 373-386.
45. MAURER, U., AND WOLF, S. 1999. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput. 28, 5, 1689-1721.
46. MCCURLEY, K. 1988. A key distribution system equivalent to factoring. J. Crypt. 1, 95-105.
47. MCCURLEY, K. 1990. The discrete logarithm problem. In Cryptography and Computational Number Theory, Proceedings of the Symposium on Applied Mathematics. AMS Lecture Notes, vol. 42, 49-74.
48. NAOR, M., AND PINKAS, B. 1998. Secure and efficient metering. In Proceedings of Advances in Cryptology - EUROCRYPT '98. Lecture Notes in Computer Science, vol. 1462. Springer-Verlag, New York.
49. NAOR, M., AND PINKAS, B. 1999. Oblivious transfer with adaptive queries. In Proceedings of Advances in Cryptology - CRYPTO '99. Lecture Notes in Computer Science, vol. 1666, Springer-Verlag, New York. 573-590.
50. NAOR, M., PINKAS, B., AND REINGOLD, O. 1999. Distributed pseudo-random functions and KDCs. In Proceedings of Advances in Cryptology-Eurocrypt '99. Lecture Notes in Computer Science, vol. 1592. Springer-Verlag, New York, 327-346.
51. NAOR, M., AND REINGOLD, O. 1997. Number-theoretic constructions of efficient pseudo-random functions. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 458-467. (Full version at http://www.wisdom.weizmann.ac.il/%7Enaor/ PAPERS/gdh_abs. html.)
52. NAOR, M., AND REINGOLD, O. 1999a. On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. Crypt. 12, 1, 29-66. (Preliminary version: STOC'97.)
53. NAOR, M., AND REINGOLD, O. 1999b. Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58, 2, 336-375. (Preliminary version: FOCS'95.)
54. NAOR, M., REINGOLD, O., AND ROSEN, A. 2000. Pseudo-random functions and factoring. In Proceedings of the 32nd ACM Symposium on Theory of Computing. ACM, New York.
55. ODLYZKO, A. M. 1993. Discrete logarithms and smooth polynomials. Contemp. Math.
56. RAZBOROV, A., AND RUDICH, S. 1997, Natural proofs. J. Comput. Syst. Sci. 55, 1, 24-35.
57. REIF, J. 1987, On threshold circuits and polynomial computation. In Proceedings of the 2nd Conference on Structure in Complexity Theory. 118-123.
58. REIF, J., AND TATE, S. 1992. On threshold circuits and polynomial computation. SIAM J. Comput. 5, 896-908.
59. SHMUELY, Z. 1985. Composite Diffie-Hellman public-key generating systems are hard to break, Tech. Rep. No. 356, Computer Science Dept., Technion, Technion City, Israel.
60. SHOUP, V. 1997. Lower bounds for discrete logarithms and related problems. In Proceedings of Advances in Cryptology-EUROCRYPT '97. Lecture Notes in Computer Science, vol. 1233. Springer-Verlag, New York, 256-266.
61. SIU, K.-Y., BRUCK, J., KAILATH, T., AND HOFMEISTER, T. 1993. Depth efficient neural network for division and related problems, IEEE Trans. Inform. Theory 39, 946-956.
62. SIU, K.-Y., AND ROYCHOWDHURY, V. P. 1994. On optimal depth threshold circuits for multiplication and related problems. SIAM J. Disc. Math. 7, 2, 284-292.
63. STADLER, M. 1996. Publicly verifiable secret sharing. In Proceedings of Advances in Cryptology - EUROCRYPT '96, Lecture Notes in Computer Science, vol. 1070. Springer-Verlag, New York, 190-199.
64. STEINER, M., TSUDIK, G., AND WAIDNER, M. 1996. Diffie-Hellman key distribution extended to group communication. In Proceedings of the 3rd ACM Conference on Computer and Communications Security. ACM, New York, 31-37.
65. VALIANT, L. G. 1984. A theory of the learnable. Commun. ACM 27, 1134-1142.
66. YAO, A. C. 1982. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science. ACM, New York, 80-91.