Perfect constant-round secure computation via perfect randomizing polynomials

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

Volumn 2380 LNCS, Issue , 2002, Pages 244-256

  Ishai, Yuval ^a   Kushilevitz, Eyal ^b  

^a PRINCETON UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; INFORMATION THEORY;

BRANCHING PROGRAMS; MULTI-PARTY PROTOCOLS; OUTPUT DISTRIBUTION; POLYNOMIAL REPRESENTATIONS; POLYNOMIAL SIZE; PROBABILITY OF FAILURE; RANDOMIZING POLYNOMIALS; SECURE COMPUTATION;

POLYNOMIALS;

EID: 84869164571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_22     Document Type: Conference Paper

References (26)

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. of 8th PODC, pages 201-209, 1989.
2. D. Beaver. Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority. J. Cryptology, Springer-Verlag, (1991) 4: 75-122.
3. D. Beaver. Minimal-latency secure function evaluation. EUROCRYPT 2000.
4. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Proc. of CRYPTO '90, pages 62-76.
5. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pages 503-513, 1990.
6. M. Ben-Or, S. Goldwasser, and A.Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. STOC, 1988.
7. C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In ICALP 2000.
8. R. Canetti. Security and composition of multiparty cryptographic protocols. J. of Cryptology, 13(1), 2000.
9. D. Chaum, C. Crépeau, and I. Damgrard. Multiparty unconditionally secure protocols (extended abstract). In Proc. of 20th STOC, pages 11-19, 1988.
10. R. Cramer and I. Damgrard. Secure distributed linear algebra in a constant number of rounds. In Proc. Crypto 2001.
11. R. Cramer, I. Damgrard, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT 2000.
12. R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient Multi-Party Computation over Rings. Manuscript, 2002.
13. U. Feige, J. Kilian, and M. Naor.Aminimal model for secure computation (extended abstract). In Proc. of 26th STOC, pages 554-563, 1994.
14. R. Gennaro,Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity ofVerifiable Secret Sharing and Secure Multicast. In Proc. 33rd STOC, 2001.
15. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO '90, LNCS 537, Springer-Verlag, 1990.
16. O. Goldreich. Secure multi-party computation. www.wisdom.weizmann.ac.il/ ~oded/pp.html, 2000.
17. O. Goldreich, S. Micali, and A.Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pages 218-229, 1987.
18. Y. Ishai and E. Kushilevitz. Private simultaneous messages protocols with applications. In Proc. of ISTCS '97, pp. 174-183, 1997.
19. Y. Ishai and E. Kushilevitz. Randomizing Polynomials:A New Representation with Applications to Round-Efficient Secure Computation. In Proc. of FOCS '00.
20. J. Kilian. Basing cryptography on oblivious transfer. STOC '98, pp. 20-31, 1988.
21. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In Prof. of Crypto '01.
22. S. Micali and P. Rogaway. Secure computation. In Proc. of CRYPTO '91.
23. M. Naor, B. Pinkas, and R. Sumner. Privacy Preserving Auctions and Mechanism Design. In Proc. ACM Conference on Electronic Commerce 1999, pages 129-139.
24. T. Sandler, A. Young, and M. Yung. Non-interactive cryptocomputing for NC1. In Proc. of 40th FOCS, pages 554-566, 1999.
25. A. C.Yao. Protocols for secure computations (extended abstract). In Proc. of FOCS 1982.
26. A. C.Yao. How to generate and exchange secrets. In Proc. of FOCS 1986.