Player simulation and general adversary structures in perfect multiparty computation

Journal of Cryptology

Volumn 13, Issue 1, 2000, Pages 31-60

  Hirt, Martin ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Adversary structures; General adversaries; Information theoretic security; Multiparty computation; Player simulation

Indexed keywords

EID: 33745999816     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/S001459910003     Document Type: Article

References (52)

1. [AR] S. Akers and T. Robbins. Logical design with three-input majority gates. Computer Design, pp. 1227, Mar. 1963.
2. [BB] J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. Sth ACM Symposium on Principles ofDistributed Computing (PODC), pp. 201-210, Aug. 1989.
3. [BDDS] A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong. Shifting gears: changing algorithms on the fly to expedite Byzantine agreement. Information and Computation, 97(2):205-233, Apr. 1992.
4. [Bel] D. Beaver. Perfect privacy for two-party protocols. In Proc. DIMACS Workshop on Distributed Computing and Cryptography, Oct. 1989.
5. [Be2] D. Beaver. Foundations of secure interactive computing. In Advances in Cryptology-CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pp. 377-391. Springer-Verlag, Berlin, 1991.
6. [Be3] D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryplology, 4(2): 75-122, 1991
7. [BGW] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic faulttolerant distributed computation. In Proc. 20th ACM Symposium on the Tlieory of Computing (STOQ.pp. 1-10, 1988.
8. [BL] J. C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology -CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pp. 27-35. Springer-Verlag, Berlin, 1988.
9. [BW] D. Beaver and A. Wool. Quorum-based secure multi-party computation. In Advances in Cryptology - EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pp. 346-360. Springer-Verlag, Berlin, 1998.
10. [Canl] R. Canetti. Studies in Secure Multiparty Computation and Applications. Ph.D. thesis, Weizmann Institute of Science, Rehovot 76100, June 1995.
11. [Can2] R. Canetti. Personal communications, 1998.
12. [Can3] R. Canetti. Security and composition of multi-party cryptographic protocols. Manuscript, June 1998. Former (more general) version: Modular composition of multi-party cryptographic protocols, Nov. 1997.
13. [CCD] D. Chaum, C. Crépeau, and I. Damgard. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20;/i ACM Symposium on the Theory of Computing (STOC), pp. 11-19,1988.
14. [CDG] D. Chaum, I. Damgard, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In Advances in Cryptology -CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pp. 87-119. Springer-Verlag, Berlin, 1987.
15. [COM] R. Cramer, I. Damgard, and U. Maurer. Span programs and general multi-party computation. Manuscript, 1998.
16. [CFGN] R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multiparty computation. In Proc. 2&th ACM Symposium on the Tlieory of Computing (STOC), pp. 639-648, Nov. 1996.
17. [CFSY] R. Cramer, M. K. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. In Advances in Cryplology -EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pp. 72-83. IACR/Springer-Verlag, Berlin, May 1996.
18. [CG] R. Canetti and R. Gennaro. Incoercible multiparty computation. In P we. 31 ih IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 504-513, 1995.
19. [CGKS] B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. 36//i IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 41-51, Oct. 1995.
20. [CGT] C. Crépeau, J. van de Graaf, and A. Tapp. Committed oblivious transfer and private multi-party computation. In Advances in Cryptology-CRYPTO '95, volume 963 of Lecture Notes in Computer Science, pp. 110-123. Springer-Verlag, Berlin, 1995.
21. [CH] R. Canetti and A. Herzberg. Maintaining security in the presence of transient faults. In Advances in Cryptology -CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pp. 425-4t38. Springer-Verlag, Berlin, 1994.
22. [Cha] D. Chaum. The spymasters double-agent problem. In Advances in Cryptology -CRYPTO "89, volume 435 of Lecture Notes in Computer Science, pp. 591-602. Springer-Verlag, Berlin, 1989.
23. [CK] B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. In Proc. 2lst ACM Symposium on the Theory of Computing (STOQ, pp. 62-72, 1989.
24. [CKOR] R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosen. Randomness vs. fault-tolerance. In Proc. 16//I ACM Symposium on Principles of Distributed Computing (PODC), pp. 35-44, Aug. 1997.
25. [dDFY] A. de Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. 26th ACM Symposium on the Theory of Computing (STOQ, pp. 522-533, 1994.
26. [FHM1] M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Advances in Cryptology-CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pp. 121-136. Springer-Verlag, Berlin, 1998. Corrected version available on-line.
27. [FHM2] M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. In Advances in Cryptology -ASIACRYPT ' 99, volume 1716 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999.
28. [Fit] M. Fitzi. Erweiterte Zugriffstrukturen in Multi-Party-Computation. Student's project, 1996.
29. [FKN] U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc, 26th ACM Symposium on the Theory of Computing (STOC), pp. 554-563, 1994.
30. [FMI] P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Sym-posium on the Theory of Computing (STOQ, pp. 148-161, 1988.
31. [FM2] P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4):873-933, Aug. 1997.
32. [FM3] M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In Dis-tributed Computing -DISC '98, volume 1499 of Lecture Notes in Computer Science, pp. 134-148. Springer-Verlag, Berlin, Sept. 1998.
33. [FR] M. K. Franklin and M. K. Reiter. The design and implementation of a secure auction service. IEEE Transactions on Sofm-are Engineering, 22(5):302-312, May 1996.
34. [FY] M. K. Franklin and M. Yung. Communication complexity of secure computation. In Proc. 24th ACM Symposium on the Theory of Computing (STOQ, pp. 699-710, 1992.
35. [Gen] R. Gennaro. Theory and Practice of Verifiable Secret Sharing. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, May 1996.
36. [GHY] Z. GaliI, S. Haber, and M. Yung. Cryptographic computation: secure fault-tolerant protocols and the public-key model. In Advances in Cryptology -CRYPTO '87, volume 293 of Lecture Notes in Computer Science, pp. 135-155. Springer-Verlag, Berlin, 1987.
37. [GJKR1] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In N. Koblitz, editor, Advances in Cryptology -CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pp. 157-172. Springer-Verlag, Berlin, Aug. 1996.
38. [GJKR2] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In U. Maurer, editor, Advances in Cryptology -EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pp. 354-371. Springer-Verlag, Berlin, May 1996.
39. [GMW] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game-a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on the Theory of Computing (STOQ, pp. 218-229,1987.
40. [GRR] R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. llth ACM Symposium on Principles of Distributed Computing (PODC), 1998.
41. [HM] M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-part computation. In Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC) pp. 25-34, Aug. 1997.
42. [ISN] M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. I Proceedings IEEE Globecom '81, pp. 99-102. IEEE, New York, 1987.
43. [KO] E. Kushilevitz and R. Ostrovsky. Replication is not needed: single data base computationally-privat information retrieval. In Proc. 38th IEEE Symposium on the Foundations of Computer Scienc (FOCS), pp. 354-373, 1997.
44. [Kus] E. Kushilevitz. Privacy and communication complexity (extended abstract). In Proc. 30th IEE Symposium on the Foundations of Computer Science (FOCS), pp. 416-421, 1989.
45. [LSP] L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions o Programming Languages and Systems, 4(3):382-401, July 1982.
46. [MR] S. Micali and P. Rogaway. Secure computation. In Advances in Cryptohgy -CRYPTO '91, volum 576 of Lecture Notes in Computer Science, pp. 392-4104. Springer-Verlag, Berlin, 1991.
47. [OY] R. Ostrovsky and M. Yung. How to withstand mobile virus attacks (extended abstract). In Proc lOlh ACM Symposium on Principles of Distributed Computing (PODC), pp. 51-59, Aug. 1991.
48. [PSL] M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of th ACM, 27(2):228-234, Apr. 1980.
49. [Rab] T. Rabin. Robust sharing of secrets when the dealer is honest or cheating. Journal of the ACM 41(6):1089-1109, Nov. 1994.
50. [RB] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority In Proc. list ACM Symposium on the Theory of Computing (STOC), pp. 73-85, 1989.
51. [SS] A. Smith and A. Stiglic. Multiparty computation unconditionally secure against Q2 adversary structures. Manuscript, July 1998.
52. [Yao] A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on the Foundation of Computer Science (FOCS), pp. 160-164. IEEE, New York, 1982.