Parallel reducibility for information-theoretically secure computation

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

Volumn 1880, Issue , 2000, Pages 74-92

  Dodis, Yevgeniy ^a   Micali, Silvio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

MODULAR COMPOSITION; MODULAR DESIGNS; PROTOCOL CANS; ROUND COMPLEXITY; SECURE COMPUTATION; SECURE FUNCTION EVALUATION; SPECIFIC CLASS;

INFORMATION THEORY;

EID: 84974597111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_5     Document Type: Conference Paper

References (17)

1. D. Beaver, Foundations of Secure Interactive Computing. Proc. Of CRYPTO’91, pp. 377-391, 1991.
2. D. Beaver, Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty majority. Journal of Cryptology, 4(2), pp. 75-122, 1991.
3. D. Beaver and S. Goldwasser, Multi-party computation with faulty majority, Proc. Of the 30th FOCS, pp. 468-473, 1989.
4. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proc. Of the 20th STOC, pp. 1-10, 1998.
5. R. Canetti, Security and Composition of Multi-party Cryptographic Protocols. Journal of Cryptology, 13(1):143-202.
6. R. Canetti, Studies in Secure Multi-party Computation and Application, Ph.D. Thesis, Weizmann Institute, Israel, 1995.
7. D. Chaum, C. Crépeau and I. Damgård, Multiparty unconditionally secure protocols, Proc. Of the 20th STOC, pp. 11-19, 1988.
8. R. Cramer, U. Maurer, and I. Damgård, General secure multiparty computation from any linear secret-sharing scheme, Proc. EUROCRYPT’00, pp. 316-334, 2000.
9. Y. Dodis and S. Micali. Parallel Reducibility for Information-Theoretically Secure Computation. Manuscript in progress.
10. P. Feldman and S. Micali, Optimal algorithms for Byzantine agreement, SIAM J. On Computing, 26(4):873-933, 1997.
11. S. Goldwasser and L. Levin, Fair computation of general functions in presence of immoral majority, Proc. CRYPTO ’90, pp. 75-84, 1990.
12. O. Goldreich, Secure Multi-Party Computation, First draft available at http://theory.lcs.mit.edu/˜oded.
13. O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, Proc. Of the 19th STOC, pp. 218-229, 1987.
14. K. Kilian, E. Kushilevitz, S. Micali and R. Ostrovsky, Reducibility and Completeness in Private Computations, To appear in SIAM J. On Computing, preliminary versions in Proc. Of the 23rd STOC, 1991 by Kilian and in Proc. Of the 35th FOCS, 1994 by Kushilevitz, Micali and Ostrovsky.
15. S. Micali and P. Rogaway, Secure computation, Proc. CRYPTO ’91, pp. 392-404, 1991. Also in Workshop On Multi-Party Secure Computation, Weizmann Institute, Israel, 1998.
16. T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multi-party Protocols with Honest Majority, Proc. Of 21st STOC, pp. 75-83, 1989.
17. A. Yao, Protocols for secure computation, Proc. Of the 23rd FOCS, pp. 160-164, 1982.