Fair computation of general functions in presence of immoral majority

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

Volumn 537 LNCS, Issue , 1991, Pages 77-93

  Goldwasser, Shafi ^a   Levin, Leonid ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BUILDING BLOCKES; COMPUTABLE FUNCTIONS; GENERAL FUNCTIONS; OBLIVIOUS TRANSFER;

COMPUTATION THEORY;

EID: 84955564077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_6     Document Type: Conference Paper

References (31)

1. D. Beaver, S. Goldwasser. Multi Party Fault Tolerant Computation with Faulty Majority, Proceedings of Crypto89, Santa Barbara, CA, August 1989.
2. D. Beaver, S. Goldwasser. Multi Party Fault Tolerant Computation with Faulty Majority Based on Oblivious Transfer, Proceedings of FOCS89, Duke, NC, October 1989, pp. 468-473.
3. M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness Theorems for NonCryptographic Fault-Tolerant Distributed Computation. Proc. of 20th STOC 1988, pp. 1-10.
4. Ben-Or, Michael, Oded Goldreich, Shafi Goldwasser, Johan Hastad, Joe Kilian, Silvio Micali, Phillip Rogaway, “IP is in Zero-Knowledge,” Proceedings, Advances in Cryptology, Crypto 1988.
5. Rabin, T. and M. Ben-Or. “Verifiable Secret Sharing and Multiparty Protocols with Honest Majority.” Proc. of 21st STOC, ACM, 1989.
6. Blakely, T. Security Proofs for Information Protection Systems. Proceedings of the 1980 Symposium on Security and Privacy, IEEE Computer Society Press, NY, pp. 79-88, 1981.
7. Brassard, Gilles, Claude Crépeau, and David Chaum, “Minimum Disclosure Proofs of Knowledge,” manuscript.
8. Brassard, Gilles, Claude Crépeau, and Jean-Marc Robert. “Information Theoritic Reductions Among Disclosure Problems,” Proceedings of the 27th FOCS, IEEE, 1986, 168-173.
9. E. Brickell, D. Chaum, I. Damgaard, J. van de Graaf. Gradual and Verifiable Release of A Secret. CRYPTO 1987.
10. D. Chaum, C. Crépeau, I. Damgaard. Multiparty Unconditionally Secure Protocols. Proc. of 20th STOC 1988, pp. 11-19.
11. Chaum, David, Ivan Damgaard, and Jeroen van de Graaf. “Multiparty Computations Ensuring Secrecy of Each Party’s Input and Correctness of the Output,” Proceedings of CRYPTO '85, Springer-Verlag, 1986, 477-488.
12. R. Cleve. Limits on the Security of Coin Flips When Half the Processors are Faulty. STOC 1986.
13. Cohen, Fischer. A Robust and Verifiable Cryptographically Secure Election. FOCS 1985.
14. C. Crepeau and J. Kilian. Achieving Oblivious Transfer Using Weakened Security Assumptions. FOCS 1988.
15. Crépeau Claude, “On the Equivalence of Two Types of Oblivious Transfer”, Crypto87.
16. B. Chor, S. Goldwasser, S. Micali, B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. FOCS 1985.
17. B. Chor, M. Rabin. Achieving Independence in Logarithmic Number of Rounds. PODC 1986.
18. Even S., Goldreich O., and A. Lempel, A Randomized Protocol for Signing Contracts, CACM, vol. 28, no. 6, 1985, pp. 637-647.
19. Fischer M., Micali S., and Rackoff C. Oblivious Transfer Based in Quadratic Residuosity, Unpublished.
20. Z. Galil, S. Haber, M. Yung. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public Key Model. Proc. CRYPTO 1987.
21. O. Goldreich, S. Micali, A. Wigderson. How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority. Proc. of 19th STOC 1987, pp. 218-229.
22. Goldreich, O., Vainish, R. “How to Solve any Protocol Problem: An Efficiency Improvement”, Crypto 87.
23. Goldwasser, Micali, Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. of Comp 1989.
24. S. Haber. Multi-Party Cryptographic Computation: Techniques and Applications. Ph.D. Thesis, Columbia University, 1988.
25. Impagliazzo, Russell and Moti Yung, “Direct Minimum Knowledge Computations,” Proceedings, Advances in Cryptology, Crypto 1987.
26. Kilian, Joe, “On The Power of Oblivious Transfer,” Proceedings of the 20th STOC, ACM, 1988, pp. 20-29. Also appeared in Uses of Randomness In Algorithms and Protocols, An ACM Distinguished Dissertation 1989.
27. J. Kilian S. Micali, P. Rogaway Security Definitions for Multi Party Protocols. In Preparation.
28. Micali Luby Rackoff 83. The Miraculous Exchange of a Secret bit, Proc. of FOCS 1983.
29. A. Shamir. How to Share a Secret. CACM 22, 612-613, 1979.
30. Yao, Andrew C. “Protocols for Secure Computations,” Proceedings of the 23rd FOCS, IEEE, 1982, 160-164.
31. Yao, Andrew C. “How to Generate and Exchange Secrets,” Proceedings of the 27th poos, IEEE, 1986, 162-167.