Computationally private randomizing polynomials and their applications

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 260-274

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL FUNCTIONS; PSEUDORANDOM GENERATORS (PRO); RANDOMIZED MAPPING; RANDOMIZING POLYNOMIALS;

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FUNCTIONS; RANDOM NUMBER GENERATION; RANDOM PROCESSES; SECURITY OF DATA;

POLYNOMIALS;

EID: 27644557351     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. 0. In Proc. 45st FOCS, pages 166-175, 2004.
2. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pages 503-513, 1990.
3. 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.
4. M. Blum. Coin flipping by telephone: a protocol for solving impossible problems. SIGACT News, 15(1):23-27, 1983.
5. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13:850-864, 1984.
6. Preliminary version in FOCS 82.
7. R. Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, 13(1):143-202, 2000.
8. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42st FOCS, pages 136-145, 2001.
9. D. Chaum, C. Crépeau, and I. Damgárd. Multiparty unconditionally secure protocols (extended abstract). In Proc. of 20th STOC, pages 11-19, 1988.
10. R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient multi-party computation over rings. In Proc. EUROCRYPT 03, pages 596-613, 2003.
11. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
12. O. Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
13. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. of the ACM., 33:792-807, 1986.
14. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proc. 21st STOC, pages 25-32, 1989.
15. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pages 218-229, 1987.
16. S. Goldwasser and S. Micali, Probabilistic encryption. JCSS, 28(2):270-299, 1984.
17. Preliminary version in Proc. STOC 82.
18. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
19. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, pages 294-304, 2000.
20. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In Proc. 29th ICALP, pages 244-256, 2002.
21. Y. Lindell and B. Pinkas. A proof of Yao's protocol for secure two-party computation. Electronic Colloquium on Computational Complexity, 11(063), 2004.
22. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, fourier transform, and leamability. J. ACM, 40(3):607-620, 1993.
23. Preliminary version in Proc. 30th FOCS, 1989.
24. M. Naor. Bit commitment using pseudorandomness. J. of Cryptolosy, 4:151-158, 1991.
25. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. 1st ACM Conference on Electronic Commerce, pages 129-139, 1999.
26. M. Naor and O. Reingold. Synthesizers and their application to the parallel construction of pseudo-random functions. J. of Computer and Systems Sciences, 58(2):336-375, 1999.
27. Preliminary version in Proc. 36th FOCS, 1995.
28. M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. J. ACM. 51(2):231-262, 2004.
29. Preliminary version in Proc. 38th FOCS, 1997.
30. O. Reingold, L. Trevisan, and S. Vadhan. Notions of reducibility between cryptographic primitives. In TCC '04, volume 2951 of LNCS, pages 1-20, 2004.
31. P. Rogaway. The Round Complexity of Secure Protocols. PhD thesis, MIT, June 1991.
32. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28-4:656-715, 1949.
33. S. R. Tate and K. Xu. On garbled circuits and constant round secure function evaluation. CoPS Lab Technical Report 2003-02, University of North Texas, 2003.
34. E. Viola. On parallel pseudorandom generators. Electronic Colloquium on Computational Complexity, 11(074), 2004.
35. To appear in 20th IEEE Conference on Computational Complexity.
36. A. Wigderson. NL/poly ⊆ ⊕L/poly. In Proc. 9th Structure in Complexify Theory Conference, pages 59-62, 1994.
37. A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd FOCS, pages 80-91, 1982.
38. A. C. Yao. How to generate and exchange secrets. In Proc. 27th FOCS, pages 162-167, 1986.