Cryptography with constant computational overhead

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 433-442

  Ishai, Yuval ^a   Ostrovsky, Rafail ^b   Kushilevitz, Eyal ^a   Sahai, Amit ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Engineering IV   (Israel)

Author keywords

Constant computational overhead; Cryptography; Universal hashing

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; HASH FUNCTIONS; NETWORK SECURITY; POLYNOMIAL APPROXIMATION;

COMMUNICATION COMPLEXITY; COMPUTATIONAL OVERHEADS; CONSTANT COMPUTATIONAL OVERHEAD; CRYPTOGRAPHIC PRIMITIVES; OBLIVIOUS TRANSFER PROTOCOLS; PSEUDORANDOM GENERATORS; SECURE TWO-PARTY COMPUTATIONS; UNIVERSAL HASHING;

AUTHENTICATION;

EID: 57049124387     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374438     Document Type: Conference Paper

References (47)

1. M. Alekhnovich. More on average case vs approximation complexity. In Proc. 44th FOCS, pages 298-307, 2003.
2. N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38(2) (1992).
3. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in NC̊. SIAM J. Comput., 36(4):845-888, 2006. Earlier version in FOCS 2004.
4. B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. Computional Complexity, 15(2): 115-162, 2006. Earlier version in CCC 2005.
5. B. Applebaum, Y. Ishai, and E. Kushilevitz. On pseudorandom generators with linear stretch in NC̊. In Proc. 10th Random, 2006.
6. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography with Constant Input Locality. In Proc. of Crypto, 2007.
7. Y. Aumann and Yehuda Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In Proc. TCC 2007, pages 137-156.
8. D. Beaver. Precomputing oblivious transfer. In CRYPTO, pages 97-109, 1995.
9. D. Beaver. Correlated pseudorandomness and the complexity of private computations. In 28th STOC, pages 479-488, 1996.
10. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pages 1-10, 1988.
11. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. In Proc. of 32nd STOC, pages 435-440, 2000.
12. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13:850-864, 1984. Preliminary version in FOCS 82.
13. J. L. Bordewijk. Inter-reciprocity applied to electrical networks. Applied Scientific Research B: Electrophysics, Acoustics, Optics, Mathematical Methods, 6: 1-74, 1956.
14. R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1), 2000.
15. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-Resilient Functions and All-or-Nothing Transforms. In Proc EUROCRYPT 2000, pages 453-469.
16. M. R. Capalbo, O. Reingold, S. P. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In Proc. STOC 2002, pages 659-668.
17. L. Carter and M. N. Wegman. Universal Classes of Hash Functions. J. Comput. Syst. Sci. 18(2): 143-154 (1979).
18. B. Chor, O. Goldreich, J. Haastad, J. Friedman, S. Rudich, and R. Smolensky. The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) In Proc. FOCS 1985, pages 396-407.
19. M. Cryan and P. B. Miltersen. On pseudorandom generators in NC̊. In Proc: 26th MFCS, 2001.
20. R. L. Dobrushin, S. I. Gelfand, and M. S. Pinsker. On complexity of coding. In Proc. 2nd Internat. Symp. on Information Theory, pages 174-184, 1973.
21. D. Dolev, C. Dwork and M. Naor. Non-malleable Cryptography. SIAM Journal of Computing, 30(2):391-437, 2000.
22. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
23. U. Feige, J. Killian, and M. Naor. A minimal model for secure computation (extended abstract). In Proc. of the 26th STOC, pages 554-563, 1994.
24. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004, pages 1-19.
25. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
26. O. Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
27. O. Goldreich. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090), 2000.
28. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM 33(4): 792-807, 1986.
29. S. Goldwasser, S. Micali, and P. Tong. Why and How to Establish a Private Code on a Public Network. In FOCS 1982, pages 134-144.
30. O. Goldreich, S. Micali, and A. Wigderson. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In CRYPTO 1986, pages 171-185.
31. V. Guruswami and P. Indyk. Expander-Based Constructions of Efficiently Decodable Codes. In Proc. FOCS 2001, pages 658-667.
32. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proc. STOC 1989, pages 12-24.
33. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In Proc. 29th ICALP, pages 244-256, 2002.
34. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Zero-Knowledge from Secure Multiparty Computation. In Proc. STOC 2007.
35. J. Kilian. Founding cryptography on oblivious transfer. In 20th STOC, pages 20-31, 1988.
36. V. Lyubashevsky. The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. In Proc. APPROX-RANDOM 2005, pages 378-389.
37. Y. Mansour, N. Nisan, and P. Tiwari. The Computational Complexity of Universal Hashing. In Proc. STOC 1990, pages 235-243.
38. E. Mossel, A. Shpilka, and L. Trevisan. On ε-biased generators in NC̊. In Proc. 44th FOCS, pages 136-145, 2003.
39. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993.
40. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. 33rd STOC, pages 590-599, 2001.
41. Moni Naor, Moti Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In Proc. STOC 1989, pages 33-43.
42. M.O. Rabin. How to exchange secrets by oblivious transfer. TR-81, Harvard, 1981.
43. M. Sipser and D. A. Spielman. Expander Codes. In Proc. FOCS 1994, pages 566-576.
44. W. D. Smith. 1. AES seems weak. 2. Linear time secure cryptography. Cryplology ePrint report 2007/248.
45. D. A. Spielman. Linear-time encodable and decodable error-correcting codes. STOC 1995: 388-397
46. A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd FOCS, pages 80-91, 1982.
47. A. C. Yao. How to generate and exchange secrets. In Proc. 27th FOCS, pages 162-167, 1986.