Cryptography in NC0

SIAM Journal on Computing

Volumn 36, Issue 4, 2006, Pages 845-888

  Applebaum, Benny ^a   Ishai, Yuval ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Constant depth circuits; Cryptographic primitives; Cryptography; NC0; One way function; Pseudorandom generator; Randomizing polynomials

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; NUMBER THEORY; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

CONSTANT DEPTH CIRCUITS; CRYPTOGRAPHIC PRIMITIVES; ONE-WAY FUNCTIONS; PSEUDORANDOM GENERATORS; RANDOMIZING POLYNOMIALS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 34547843026     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705446950     Document Type: Article

References (54)

1. M. AGRAWAL, E. ALLENDER, AND S. RUDICH, Reductions in circuit complexity: An isomorphism theorem and a gap theorem, J. Comput. System Sci., 57 (1998), pp. 127-143.
2. M. AJTAI, Generating hard instances of lattice problems, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 1996, pp. 99-108; full version in Electronic Colloquium on Computational Complexity (ECCC).
3. M. AJTAI AND C. DWORK, A public-key cryptosystem with worst-case/average-case equivalence, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 1997, pp. 284-293.
4. B. APPLEBAUM, Y. ISHAI, AND E. KUSHILEVITZ, Computationally private randomizing polynomials and their applications, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC), 2005, pp. 260-274.
5. B. APPLEBAUM, Y. ISHAI, AND E. KUSHILEVITZ, On One-way Functions with Optimal Locality, unpublished manuscript, 2005; available online at http://www.cs.technion.ac.il/~abenny.
6. L. BABAI, N. NISAN, AND M. SZEGEDY, Multiparty protocols and logspace-hard pseudorandom sequences, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), 1989, pp. 1-11.
7. 1, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, pp. 1-5.
8. A. BLUM, M. FURST, M. KEARNS, AND R. J. LIPTON, Cryptographic primitives based on hard learning problems, in Advances in Cryptology - CRYPTO '93, Lecture Notes in Comput. Sci. 773, Springer-Verlag, Berlin, 1994, pp. 278-291.
9. M. BLUM, Coin flipping by telephone: A protocol for solving impossible problems, SIGACT News, 15 (1983), pp. 23-27.
10. M. BLUM AND S. GOLDWASSER, An efficient probabilistic public-key encryption scheme which hides all partial information, in Advances in Cryptology - CRYPTO '84, Lecture Notes in Comput. Sci. 196, Springer-Verlag, Berlin, 1985, pp. 289-299.
11. M. BLUM AND S. MICALI, HOW to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput., 13 (1984), pp. 850-864.
12. R. CANETTI, H. KRAWCZYK, AND J. B. NIELSEN, Relaxing chosen ciphertext security, in Advances in Cryptology - CRYPTO '03, Lecture Notes in Comput. Sci. 2729, Springer-Verlag, Berlin, 2003, pp. 565-582.
13. M. CAPALBO, O. REINGOLD, S. VADHAN, AND A. WIGDERSON, Randomness conductors and constant-degree lossless expanders, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 659-668.
14. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM J. Comput., 17 (1988), pp. 230-261.
15. R. CRAMER, S. FEHR, Y. ISHAI, AND E. KUSHILEVITZ, Efficient multi-party computation over rings, in Advances in Cryptology - EUROCRYPT '03, Springer-Verlag, Berlin, 2003, pp. 596-613.
16. 0, in Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 2136, Springer-Verlag, Berlin, 2001, pp. 272-284.
17. I. B. DAMGÅRD, Collision free hash functions and public key signature schemes, in Advances in Cryptology-EUROCRYPT '87, Lecture Notes in Comput. Sci. 304, Springer-Verlag, Berlin, 1988, pp. 203-216.
18. I. B. DAMGÅRD, T. P. PEDERSEN, AND B. PFITZMANN, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, J. Cryptology, 10 (1997), pp. 163-194.
19. T. ELGAMAL, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, 31 (1985), pp. 469-472.
20. A. V. GOLDBERG, M. KHARITONOV, AND M. YUNG, Lower bounds for pseudorandom number generators, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1989, pp. 242-247.
21. O. GOLDREICH, Modern Cryptography, Probabilistic Proofs, and Pseudorandomness, Algorithms Combin. 17, Springer-Verlag, Berlin, 1999.
22. O. GOLDREICH, Candidate one-way functions based on expander graphs, Electronic Colloquium on Computational Complexity (ECCC), 7 (2000).
23. O. GOLDREICH, Foundations of Cryptography: Basic Tools, Cambridge University Press, Cambridge, UK, 2001.
24. O. GOLDREICH, Foundations of Cryptography: Basic Applications, Cambridge University Press, Cambridge, UK, 2004.
25. O. GOLDREICH, S. GOLDWASSER, AND S. HALEVI, Collision-free hashing from lattice problems, Electronic Colloquium on Computational Complexity, 96 (1996).
26. O. GOLDREICH AND A. KAHAN, HOW to construct constant-round zero-knowledge proof systems for NP, J. Cryptology, 9 (1996), pp. 167-189.
27. O. GOLDREICH, H. KRAWCZYK, AND M. LUBY, On the existence of pseudorandom generators, SIAM J. Comput., 22 (1993), pp. 1163-1175.
28. O. GOLDREICH AND L. LEVIN, A hard-core predicate for all one-way functions, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), 1989, pp. 25-32.
29. S. GOLDWASSER AND S. MICALI, Probabilistic encryption, J. Comput. System Sci., 28 (1984), pp. 270-299.
30. I. HAITNER, D. HARNIK, AND O. REINGOLD, On the Power of the Randomized Iterate, Tech. report, ECCC TR05-135, 2005.
31. S. HALEVI AND S. MICALI, Practical and provably-secure commitment schemes from collision-free hashing, in Advances in Cryptology-CRYPTO '96, Lecture Notes in Comput. Sci. 1109, Springer-Verlag, Berlin, 1996, pp. 201-215.
32. 0, Inform. Process. Lett., 26 (1987), pp. 153-155.
33. J. HÅSTAD, R. IMPAGLIAZZO, L. A. LEVIN, AND M. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
34. C. Y. HSIAO AND L. REYZIN, Finding collisions on a public road, or do secure hash functions need secret coins?, in Advances in Cryptology - CRYPTO '04, Lecture Notes in Comput. Sci. 3152, Springer-Verlag, Berlin, 2004, pp. 92-105.
35. R. IMPAGLIAZZO AND M. LUBY, One-way functions are essential for complexity based cryptography, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1989, pp. 230-235.
36. R. IMPAGLIAZZO AND M. NAOR, Efficient cryptographic schemes provably as secure as subset sum, J. Cryptology, 9 (1996), pp. 199-216.
37. Y. ISHAI AND E. KUSHILEVITZ, Randomizing polynomials: A new representation with applications to round-efficient secure computation, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 294-304.
38. Y. ISHAI AND E. KUSHILEVITZ, Perfect constant-round secure computation via perfect randomizing polynomials, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 244-256.
39. M. KHARITONOV, Cryptographic hardness of distribution- specific learning, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), 1993, pp. 372-381.
40. J. KILIAN, Founding cryptography on oblivious transfer, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), 1988, pp. 20-31.
41. M. KRAUSE AND S. LUCKS, On the minimal hardware complexity of pseudorandom function generators (extended abstract), in STACS 2001, Lecture Notes in Comput. Sci. 2010, Springer-Verlag, Berlin, 2001, pp. 419-430.
42. N. LINIAL, Y. MANSOUR, AND N. NISAN, Constant depth circuits, Fourier transform, and learnability, J. ACM, 40 (1993), pp. 607-620.
43. 0, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 136-145.
44. M. NAOR AND O. REINGOLD, Number-theoretic constructions of efficient pseudo-random functions, J. ACM, 51 (2004), pp. 231-262.
45. N. NISAN, Pseudorandom generators for space-bounded computation, Combinatorica, 12 (1992), pp. 449-461.
46. T. PEDERSEN, Noninteractive and information-theoretic secure verifiable secret sharing, in Advances in Cryptology - CRYPTO '91, Lecture Notes in Comput. Sci. 576, Springer-Verlag, Berlin, 1991, pp. 129-149.
47. M. O. RABIN, Digitalized Signatures and Public Key Functions as Intractable as Factoring, Tech. report 212, Laboratory for Computer Science, MIT, 1979.
48. O. REGEV, New lattice based cryptographic constructions, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 407-416.
49. R. L. RIVEST, A. SHAMIR, AND L. M. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), pp. 120-126.
50. E. VIOLA, On constructing parallel pseudorandom generators from one-way functions, in Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC), 2005, pp. 183-197.
51. A. WIGDERSON, NL/poly ⊆ ⊕L/poly, in Proceedings of the 9th Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 59-62.
52. A. C. YAO, Theory and application of trapdoor functions, in Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1982, pp. 80-91.
53. A. C. YAO, HOW to generate and exchange secrets, in Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1986, pp. 162-167.
54. X. YU AND M. YUNG, Space lower-bounds for pseudorandom-generators, in Proceedings of the 9th Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 186-197.