Cryptography with constant input locality

Journal of Cryptology

Volumn 22, Issue 4, 2009, Pages 429-469

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

^a Princeton University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cryptography with low complexity; Hardness of decoding random linear code; Input locality; NC 0

Indexed keywords

BINARY LINEAR CODES; CRYPTOGRAPHIC ASSUMPTIONS; CRYPTOGRAPHIC HARDWARE; CRYPTOGRAPHIC PRIMITIVES; DIGITAL SIGNATURE; ERROR CORRECTING CODE; FAN-OUT; INPUT INFLUENCE; INPUT LOCALITY; LOW COMPLEXITY; MCELIECE CRYPTOSYSTEM; MESSAGE AUTHENTICATION; NC 0; NEW CONSTRUCTION; NON-MALLEABILITY; NON-MALLEABLE; ONE-WAY FUNCTIONS; PSEUDORANDOM GENERATORS; PUBLIC-KEY ENCRYPTION SCHEME;

AUTHENTICATION; DECODING; HARDNESS; PUBLIC KEY CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 68549121004     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-009-9039-0     Document Type: Article

References (52)

1. M. Alekhnovich, More on average case vs approximation complexity, in Proc. 44th FOCS, 2003, pp. 298-307
2. B. Applebaum Y. Ishai E. Kushilevitz 2006 Computationally private randomizing polynomials and their applications Comput. Complex. 15 2 115 162 Preliminary version in Proc. 20th CCC, 2005
3. 0 SIAM J. Comput. 36 4 845 888 Preliminary version in Proc. 45th FOCS, 2004
4. 0, in Proc. 10th Random, 2006
5. B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography with constant latency. Manuscript, 2009
6. S. Arora S. Safra 1998 Probabilistic checking of proofs: A new characterization of np J. ACM 45 1 70 122 Preliminary version in Proc. 33rd FOCS, 1992
7. S. Arora C. Lund R. Motwani M. Sudan M. Szegedy 1998 Proof verification and hardness of approximation problems J. ACM 45 3 501 555 Preliminary version in Proc. 33rd FOCS, 1992
8. L. Babai 1987 Random oracles separate PSPACE from the polynomial-time hierarchy Inf. Process. Lett. 26 1 51 53
9. E.R. Berlekamp R.J. McEliece H.C. van Tilborg 1978 On the inherent intractability of certain coding problems IEEE Trans. Inf. Theory 24 3 384 386
10. M. Blum 1983 Coin flipping by telephone: a protocol for solving impossible problems SIGACT News 15 1 23 27
11. M. Blum S. Micali 1984 How to generate cryptographically strong sequences of pseudo-random bits SIAM J. Comput. 13 850 864 Preliminary version in Proc. 23rd FOCS, 1982
12. A. Blum, M. Furst, M. Kearns, R.J. Lipton, Cryptographic primitives based on hard learning problems, in Advances in Cryptology: Proc. of CRYPTO '93, LNCS, vol. 773 (1994), pp. 278-291
13. A. Blum A. Kalai H. Wasserman 2003 Noise-tolerant learning, the parity problem, and the statistical query model J. ACM 50 4 506 519 Preliminary version in Proc. 32nd STOC, 2000
14. R.B. Boppana J.C. Lagarias 1987 One-way functions and circuit complexity Inf. Comput. 74 3 226 240
15. S.A. Cook, The complexity of theorem-proving procedures, in STOC '71: Proceedings of the Third Annual ACM Symposium on Theory of Computing, New York, NY, USA (ACM Press, New York, 1971), pp. 151-158
16. 0, in Proc. 26th MFCS, 2001, pp. 272-284
17. D. Dolev C. Dwork M. Naor 2000 Non-malleable cryptography SIAM J. Comput. 30 2 391 437
18. U. Feige, J. Killian, M. Naor, A minimal model for secure computation (extended abstract), in Proc. of the 26th STOC, 1994, pp. 554-563
19. V. Feldman, P. Gopalan, S. Khot, A.K. Ponnuswami, New results for learning noisy parities and halfspaces, in Proc. 47th FOCS, 2006, pp. 563-574
20. O. Goldreich, Candidate one-way functions based on expander graphs. Electron. Colloq. Comput. Complex. (ECCC) 7(090) (2000)
21. O. Goldreich, Foundations of Cryptography: Basic Tools (Cambridge University Press, Cambridge, 2001)
22. O. Goldreich, Foundations of Cryptography: Basic Applications (Cambridge University Press, Cambridge, 2004)
23. O. Goldreich, L. Levin, A hard-core predicate for all one-way functions, in Proc. 21st STOC, 1989, pp. 25-32
24. O. Goldreich S. Goldwasser S. Micali 1986 How to construct random functions J. ACM 33 792 807
25. O. Goldreich H. Krawczyk M. Luby 1993 On the existence of pseudorandom generators SIAM J. Comput. 22 6 1163 1175 Preliminary version in Proc. 29th FOCS, 1988
26. S. Goldwasser S. Micali 1984 Probabilistic encryption J. Comput. Syst. Sci. 28 2 270 299 Preliminary version in Proc. STOC '82
27. J. Håstad R. Impagliazzo L.A. Levin M. Luby 1999 A pseudorandom generator from any one-way function SIAM J. Comput. 28 4 1364 1396
28. T. Holenstein, Pseudorandom generators from one-way functions: A simple construction for any hardness, in Proc. 3rd TCC, 2006, pp. 443-461
29. N.J. Hopper, M. Blum, Secure human identification protocols, in Advances in Cryptology: Proc. of ASIACRYPT '01, LNCS, vol. 2248 (2001), pp. 52-66
30. R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography, in Proc. of the 30th FOCS, 1989, pp. 230-235
31. R. Impagliazzo M. Naor 1996 Efficient cryptographic schemes provably as secure as subset sum J. Cryptol. 9 4 199 216 Preliminary version in FOCS '89
32. Y. Ishai, E. Kushilevitz, Randomizing polynomials: A new representation with applications to round-efficient secure computation, in Proc. 41st FOCS, 2000, pp. 294-304
33. Y. Ishai, E. Kushilevitz, Perfect constant-round secure computation via perfect randomizing polynomials, in Proc. 29th ICALP, 2002, pp. 244-256
34. H. Janwa O. Moreno 1996 Mceliece public key cryptosystems using algebraic-geometric codes Des. Codes Cryptogr. 8 3 293 307
35. A. Juels, S. Weis, Authenticating pervasive devices with human protocols, in Advances in Cryptology: Proc. of CRYPTO '05, LNCS, vol. 3621 (2005), pp. 293-308
36. J. Katz, J.-S. Shin, Parallel and concurrent security of the hb and hb+ protocols, in Advances in Cryptology: Proc. of Eurocrypt 06', LNCS, vol. 4004 (2006), pp. 73-87
37. J. Katz, M. Yung, Complete characterization of security notions for probabilistic private-key encryption, in Proc. 32nd STOC, 2000, pp. 245-254
38. M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R.E. Schapire, L. Sellie, On the learnability of discrete distributions, in Proc. 26th STOC, 1994, pp. 273-282
39. M.J. Kearns 1998 Efficient noise-tolerant learning from statistical queries J. ACM 45 6 983 1006
40. J. Kilian, Founding cryptography on oblivious transfer, in Proc. 20th STOC, 1988, pp. 20-31
41. L.A. Levin, Universal sequential search problems. PINFTRANS: Probl. Inf. Transm. Translated from Problemy Peredachi Informatsii (Russian) 9 (1973)
42. N. Linial Y. Mansour N. Nisan 1993 Constant depth circuits, Fourier transform, and learnability J. ACM 40 3 607 620 Preliminary version in Proc. 30th FOCS, 1989
43. V. Lyubashevsky, The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem, in Proc. 9th Random, 2005
44. R.J. McEliece, A public-key cryptosystem based on algebraic coding theory. Technical Report DSN PR 42-44, Jet Prop. Lab., 1978
45. 0, in Proc. 44th FOCS, 2003, pp. 136-145
46. M. Naor O. Reingold 1999 Synthesizers and their application to the parallel construction of pseudo-random functions J. Comput. Syst. Sci. 58 2 336 375 Preliminary version in Proc. 36th FOCS, 1995
47. C. Papadimitriou M. Yannakakis 1991 Optimization, approximation, and complexity classes J. Comput. Syst. Sci. 43 425 440 Preliminary version in Proc. 20th STOC, 1988
48. O. Regev, On lattices, learning with errors, random linear codes, and cryptography, in Proc. 37th STOC, 2005, pp. 84-93
49. M. Sudan, Algorithmic introduction to coding theory-lecture notes, 2002. http://theory.csail.mit.edu/~madhu/FT01/
50. R. Varshamov 1957 Estimate of the number of signals in error correcting codes Dokl. Akad. Nauk SSSR 117 739 741
51. E. Viola, On constructing parallel pseudorandom generators from one-way functions, in Proc. IEEE Conference on Computational Complexity 2005, pp. 183-197
52. A.C. Yao, Theory and application of trapdoor functions, in Proc. 23rd FOCS, 1982, pp. 80-91