Randomizing polynomials: A new representation with applications to round-efficient secure computation

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 294-304

  Ishai, Yuval ^a   Kushilevitz, Eyal ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOMIZING POLYNOMIALS; ROUND-EFFICIENT SECURE COMPUTATIONS;

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; NETWORK PROTOCOLS; POLYNOMIALS; RANDOM PROCESSES;

COMPUTER SCIENCE;

EID: 0034507841     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892118     Document Type: Article

References (36)

1. E. Allender R. Beals M. Ogihara The complexity of matrix rank and feasible systems of linear equations Proc. of 28nd STOC 503 513 Proc. of 28nd STOC 1996
2. J. Bar-Ilan D. Beaver Non-cryptographic fault-tolerant computing in a constant number of rounds Proc. of 8th PODC 201 209 Proc. of 8th PODC 1989
3. D. Barrington R. Beigel S. Rudich Representing Boolean functions as polynomials modulo composite numbers Proc. of 24th STOC 455 461 Proc. of 24th STOC 1992
4. D. Beaver Minimal-latency secure function evaluation Proc. EUROCRYPT 2000 335 350 Proc. EUROCRYPT 2000
5. D. Beaver J. Feigenbaum J. Kilian P. Rogaway Security with low communication overhead Proc. of CRYPTO '90 62 76 Proc. of CRYPTO '90
6. D. Beaver S. Micali P. Rogaway The round complexity of secure protocols (extended abstract) Proc. of 22nd STOC 503 513 Proc. of 22nd STOC 1990
7. R. Beigel The polynomial method in circuit complexity Proc. of structure in complexity theory 82 95 Proc. of structure in complexity theory 1993
8. A. Beimel A. Gal On arithmetic branching programs Proc. of the 13th Annu. IEEE Conf. on Computational Complexity 68 80 Proc. of the 13th Annu. IEEE Conf. on Computational Complexity 1998
9. M. Ben-Or S. Goldwasser A. Wigderson Completeness theorems for non-cryptographic fault-tolerant distributed computation Proc. of 20th STOC 1 10 Proc. of 20th STOC 1988
10. C. Cachin J. Camenisch J. Kilian J. Muller One-round secure computation and secure autonomous mobile agents ICALP 2000 ICALP 2000
11. R. Canetti Security and composition of multi-party cryptographic protocols J. Cryptology 13 1 143 202 2000
12. D. Chaum C. Crépeau I. Damgård Multiparty unconditionally secure protocols (extended abstract) Proc. of 20th STOC 11 19 Proc. of 20th STOC 1988
13. B. Chor O. Goldreich J. Hastad J. Friedman S. Rudich R. Smolensky The bit extraction problem of t-resilient functions (preliminary version) Proc. of 26th FOCS 396 407 Proc. of 26th FOCS 1985
14. R. Cramer I. Damgård S. Dziembowski M. Hirt T. Rabin Efficient multiparty computations secure against an adaptive adversary Proc. EUROCRYPT '99 311 326 Proc. EUROCRYPT '99
15. R. Cramer I. Damgård U. Maurer General secure multiparty computation from any linear secret-sharing scheme Proc. of EUROCRYPT 2000 316 334 Proc. of EUROCRYPT 2000
16. U. Feige J. Kilian M. Naor A minimal model for secure computation (extended abstract) Proc. of 26th STOC 554 563 Proc. of 26th STOC 1994
17. R. Gennaro M. O. Rabin T. Rabin Fact-track multiparty computations with applications to threshold cryptography Proc. of 17th PODC 101 111 Proc. of 17th PODC 1998
18. O. Goldreich Probabilstic Methods and Pseudo-Randomness 1999 Springer-Verlag Modern Cryptography
19. O. Goldreich S. Micali A. Wigderson How to play any mental game (extended abstract) Proc. of 19th STOC 218 229 Proc. of 19th STOC 1987
20. Y. Ishai E. Kushilevitz Private simultaneous messages protocols with applications Proc. of 5th ISTCS 174 183 Proc. of 5th ISTCS 1997
21. J. Kilian Founding cryptography on oblivious transfer Proc. of 20th STOC 20 31 Proc. of 20th STOC 1988
22. R. Lipton New directions in testing Proc. of DIMACS workshop on distributed computing and cryptography Proc. of DIMACS workshop on distributed computing and cryptography 1989
23. S. Micali P. Rogaway Secure computation Proc. of CRYPTO '91 392 404 Proc. of CRYPTO '91
24. N. Nisan M. Szegedy On the degree of Boolean functions as real polynomials Computational Complexity 4 301 313 1994
25. T. Rabin M. Ben-Or Verifiable secret sharing and multiparty protocols with honest majority Proc. of 21st STOC 73 85 Proc. of 21st STOC 1989
26. A. A. Razborov Lower bounds for the size of circuits of bounded depth with basis {\\^,♁} Math. notes of the Academy of Science of the USSR 41 4 333 338 1987
27. T. Sandler A. Young M. Yung Non-interactive cryptocomputing for NC1 Proc. of 40th FOCS 554 566 Proc. of 40th FOCS 1999
28. A. Shamir How to share a secret Commun. ACM 22 6 612 613 June 1979
29. R. Smolensky Algebraic methods in the theory of lower bounds for Boolean circuit complexity Proc. of 19th STOC 77 82 Proc. of 19th STOC 1987
30. J. Tarui Randomized polynomials, threshold circuits, and the polynomial hierarchy Proc. of 8th Symp. on Theoretical Aspects of Computer Science 238 250 Proc. of 8th Symp. on Theoretical Aspects of Computer Science 1991
31. S. Tsai Lower bounds on representing Boolean functions as polynomials in Zm Proceedings of the 8th Annual Structure in Complexity Theory 96 101 Proceedings of the 8th Annual Structure in Complexity Theory 1993
32. A. Wigderson NL/poly ⊆ ♁L/poly Proc. of the 9th Annual Structure in Complexity Theory 59 62 Proc. of the 9th Annual Structure in Complexity Theory 1994
33. A. C. Yao Protocols for secure computations (extended abstract) Proc. of 23rd FOCS 160 164 Proc. of 23rd FOCS 1982
34. A. C. Yao How to generate and exchange secrets Proc. of 27th FOCS 162 167 Proc. of 27th FOCS 1986