- 1.N. Alon and J. Spencer. The Probabilistlc Method. Wiley, 1992.Google Scholar
- 2.D. Beaver, "Foundations of Secure Interactive Computing", CRYPTO, 1991. Google ScholarDigital Library
- 3.D. Beaver, "Secure Multi-party Protocols and Zero- Knowledge Proof Systems Tolerating a Faulty Minority", J. Cryptology (1991) 4: 75-122.Google Scholar
- 4.D. Beaver and S. Goldwasser, "Multi-parry computation with faulty majority", 30th FOCS, 1989, pp. 468-473.Google Scholar
- 5.M. Ben-Or, S. Goldwa~ser and A. Wigderson, "Complcteness Theorems for Non-Cryptographic Fault- Tolerant Distributed Computation", ~Oth STOC~ 1988, pp. 1-10. Google ScholarDigital Library
- 6.R. Canerti, "Security and composition of multi-party protocols", Available at the Theory of Cryptography Library, http://philby, ucsd.edu, 1998.Google Scholar
- 7.R. Canerti, U. Feige, O. Goldreich and M. Naor, "Adaptively Secure Computation", ~8th $TOC, 1996. Fuller version in MIT-LCS-TR #682, 1996. Google ScholarDigital Library
- 8.R. Canetti, E. Kushilevitz, R. Ostrovsky and A. Rosen, "Randomness vs. Fault-Tolerance", Available at the Theory of Cryptography Library, http://philby, ucsd.edu, 1998. Preliminary version at I6th PODC, 35-45, 1997. Google ScholarDigital Library
- 9.R. Canetti, T. Malkin, Y. Yishay, in preparation.Google Scholar
- 10.D. Chaum, C. Crepeau, and I. Damgard. Multi-party Unconditionally Secure Protocols. In Proc. 20th Annual Syrup. on the Theory of Computing, pages 11-19. ACM, 1988. Google ScholarDigital Library
- 11.G. Di Crescenzo, 1~. Ostrovsky and S. Rajagopalan, "Conditional Oblivious Transfer and Sender-Anonymous Timed-Release Encryption" In Proceedings of E URO- CRYPT 99, to appear. Google ScholarDigital Library
- 12.I.B. Damg,~rd, '~Collision free hash functions and public key signature schemes", EUROCRYPT 87 (LNCS 30,i), pp. 203-216, 1988.Google Scholar
- 13.A. Fiat and M. Naor, "Broadcast Encryption", Advances in Cryptology- Crypto '92, Springer-Verlag LNCS 839, pp. 257-270, 1994.Google ScholarCross Ref
- 14.M. Fcedman, J. Komlos, and E. Szemeredi "Storing A Sparse Table with O(1) Access Time" Journal of the A CM 31, 1984, pp. 538-544. Google ScholarDigital Library
- 15.J. Garay and Y. Moses. Fully Polynomial Byzantine Agreement in t -F 1 Pounds. SIAM Journal on Computing, 27(1), 1998. Google ScholarDigital Library
- 16.O. Goldreich. "Secure Multi-Party Computation" 1998. First draft available at http://theory, lcs.mit.edu/~odedGoogle Scholar
- 17.O. Goldreich, S. Micali and A. Wigderson, "How to Play any Mental Game", 19th STOC, 1987, pp. 218-229. Google ScholarDigital Library
- 18.O. Goldreich and Y. Oren, "On the cunning power of cheating verifiers: Some observations about Zero- Knowledge proofs", in preparation. Preliminary version by Y. Oren in 2Sth FOCS, 1987.Google Scholar
- 19.S. GoIdwasser, and L. Levin, "Fair Computation of General Functions in Presence of Immoral Majority", CRYPTO, 1990. Google ScholarDigital Library
- 20.S. Goldwasser and S. Micali, Probabitistic encryption, JCSS, Vol. 28, No 2, April 1984, pp. 270-299.Google ScholarCross Ref
- 21.J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, "Construction of a Pseudo-Random Generator from One-Way Function", to appear in SIAM J. on Computing. previous versions: FOCS 89 and STOC 90. Google ScholarDigital Library
- 22.E. Kushilevitz, and A. Rosin, "A Randomness-Rounds Tradeoff in Private Computation", CRYPTO-94, LNCS 839, pp. 397-410, 1994. Google ScholarDigital Library
- 23.E. Kushilevitz, S. Micali, and R. Ostrovsky, "Reducibility and Completeness in Multi-Party Private Computations", Proc. of 35th FOCS, 1994, pp. 478-489. (full version joint, with J. Kitian to appear in SICOMP).Google ScholarDigital Library
- 24.E. Kushilevitz, R. Ostrovsky, and A. Ros4n, "Characterizing Linear Size Circuits in Terms of Privacy", Invited paper to the Journal of Computer and System Sciences special issue for STOC 96. Appeared in Vot 58, Decemher 1998. Preliminary version in the Proc. of 28th STOC, pp. 541-550, 1996. Google ScholarDigital Library
- 25.E. Kushilevitz, R. Ostrovsky, and A. Rosin, "Amortizing Randomness in Private Multiparty Computations" Proc. of 17~h PODC, pp. 81-90, 1998. Google ScholarDigital Library
- 26.S. Micali and P. Rogaway, "Secure Computation", unpublished manuscript, 1992. Preliminary version in CRYPTO 91.Google Scholar
- 27.T. Rabin and M. Ben-Or, "Verifiable Secret Sharing and Multi-party Protocols with Honest Majority", ~lst $TOC, 1989, pp. 73-85. Google ScholarDigital Library
- 28.A. Yao, "theory and applications of trapdoor functions", In Proc. 23rd Annual Syrup. on Foundations of Computer Science, pages 80-91. IEEE, 1982.Google ScholarDigital Library
- 29.A. Yao, "Protocols for Secure Computation", In Proc. 23rd Annual Syrup. on Foundations of Computer Science, pages 160-164. IEEE, 1982.Google Scholar
- 30.A. Yao, "How to generate and exchange secrets", In Pro~. 27th Annual Syrup. on Foundations of Computer Science, pages 162-167. IEEE, 1986.Google ScholarDigital Library
Index Terms
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?
Recommendations
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityIn the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, the efficiency of secure two-party computation has ...
1/p-Secure multiparty computation without honest majority and the best of both worlds
CRYPTO'11: Proceedings of the 31st annual conference on Advances in cryptologyA protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In ...
Round-Optimal Secure Multiparty Computation with Honest Majority
Advances in Cryptology – CRYPTO 2018AbstractWe study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimaln-party protocols, tolerating any corruptions.
- Security with abort: We give the first construction of two ...
Comments