Cryptography with constant input locality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4622 LNCS, Issue , 2007, Pages 92-110

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTATIONAL COMPLEXITY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MESSAGE PASSING; PROBLEM SOLVING;

CONSTANT INPUT LOCALITY; CRYPTOGRAPHIC PRIMITIVES; MESSAGE AUTHENTICATION; PSEUDORANDOM GENERATORS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049158077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_6     Document Type: Conference Paper

References (26)

1. Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. 44th FOCS, pp. 298-307 (2003)
2. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computional Complexity 15(2), 115-162 (2006)
3. 0. SIAM J. Comput. 36(4), 845-888 (2006)
4. 0. In: Proc. 10th Random (2006)
5. Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278-291. Springer, Heidelberg (1994)
6. Cook, S.A.: The complexity of theorem-proving procedures. In: STOC '71: Proceedings of the third annual ACM symposium on Theory of computing, pp. 151-158. ACM Press, New York (1971)
7. 0. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 272-284. Springer, Heidelberg (2001)
8. Feige, U., Killian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: Proc. of the 26th STOC, pp. 554-563 (1994)
9. Goldreich, O.: Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090) (2000)
10. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)
11. Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)
12. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. of the ACM. 33, 792-807 (1986)
13. Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM J. Comput. 22(6), 1163-1175 (1993)
14. Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proc. 21st STOC, pp. 25-32 (1989)
15. Impagliazzo, R., Levin, L.A., Luby, M.: Pseudorandom generation from one-way functions. In: Proc. 21st STOC, pp. 12-24 (1989)
16. Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: Proc. 41st FOCS, pp. 294304 (2000)
17. Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 244-256. Springer, Heidelberg (2002)
18. Janwa, H., Moreno, O.: Mceliece public key cryptosystems using algebraicgeometric codes. Des. Codes Cryptography 8(3), 293-307 (1996)
19. Kilián, J.: Founding cryptography on oblivious transfer. In: Proc. 20th STOC, pp. 20-31 (1988)
20. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM 40(3), 607-620 (1993)
21. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical Report DSN PR 42-44, Jet Prop. Lab (1978)
22. 0. In: Proc. 44th FOCS, pp. 136-145 (2003)
23. Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. of Computer and Systems Sciences 58(2), 336-375 (1999)
24. Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. of Computer and Systems Sciences 43, 425-440 (1991)
25. Sudan, M.: Algorithmic introduction to coding theory - lecture notes (2002), http://theory.csail.mit.edu/~madhu/FT01/
26. Varshamov, R.: Estimate of the number of signals in error correcting codes. Doklady Akademii Nauk SSSR 117, 739-741 (1957)