Quorum-based secure multi-party computation

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

Volumn 1403, Issue , 1998, Pages 375-390

  Beaver, Donald ^a   Wool, Avishai ^b  

^a IBM   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DISTRIBUTED PARAMETER CONTROL SYSTEMS; INFORMATION THEORY;

ACCESS STRUCTURE; DISTRIBUTED CONTROL; EFFICIENT PROTOCOLS; MULTIPARTY COMPUTATION; PASSIVE ATTACKS; SECURE MULTI-PARTY COMPUTATION; SELF-INTERSECTIONS; THRESHOLD SYSTEMS;

COMPUTATION THEORY;

EID: 84957718798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054140     Document Type: Conference Paper

References (34)

1. [AE91] D. Agrawal and A. El-Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comp. Sys., 9(1):1-20, 1991.
2. [Bea91a] D. Beaver. Foundations of secure interactive computing. In Advances in Cryptology - CRYPTO’91, LNCS 576, pages 377-391. Springer-Verlag, 1991.
3. [Bea91b] D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J. Cryptology, 4(2):75-122, 1991.
4. [BG89] D. Beaver and S. Goldwasser. Multiparty computation with faulty majority. In Proc. 30th IEEE Symp. Foundations of Comp. Sci. (FOCS), pages 468-473, 1989.
5. [BH92] D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Advances in Cryptology - EUROCRYPT’92, LNCS 658, pages 307-323. Springer-Verlag, 1992.
6. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symp. Theory of Computing (STOC), pages 1-10, Chicago, Illinois, 2-4 May 1988.
7. [BKK94] S. Ben-David, M. Karchmer, and E. Kushilevitz. On ultrafilters and NP. In Proceedings of the 9th Annual Conference on Structure in Complexity Theory, pages 97-105. IEEE Computer Society Press, 1994.
8. [BL88] J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology - CRYPTO’88, LNCS 403, pages 27-36. Springer-Verlag, 1988.
9. [Bla79] G. R. Blakely. Safeguarding cryptographic keys. Proc. AFIPS, NCC, 48:313-317, 1979.
10. [CCD88] D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proc. 20th ACM Symp. Theory of Computing (STOC), pages 11-19, Chicago, Illinois, 2-4 May 1988.
11. [CFGN96] R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multiparty computation. In Proc. 28th ACM Symp. Theory of Computing (STOC), pages 639-648, 1996.
12. [CK91] B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. SIAM J. Discrete Math., 4:36-47, 1991.
13. [DDFY94] A. De Santis, Y. Desmet, Y. Frankel, and M. Yung. How to share a function securely. In Proc. 26th ACM Symp. Theory of Computing (STOC), pages 522-533, 1994.
14. [DGS85] S. B. Davidson, H. Garcia-Molina, and D. Skeen. Consistency in partitioned networks. ACM Computing Surveys, 17(3):341-370, 1985.
15. [Für88] Z. Füredi. Matchings and covers in hypergraphs. Graphs and Combinatorics, 4:115-206, 1988.
16. [GB85] H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. J. ACM, 32(4):841-860, 1985.
17. [GHY88] Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure faulttolerant protocols and the public-key model. In Advances in Cryptology - CRYPTO’87, LNCS 293, pages 135-155. Springer-Verlag, 1988.
18. [GMR89] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Computing, 18(1):186-208, 1989.
19. [GMW86] O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proc. 27th IEEE Symp. Foundations of Comp. Sci. (FOCS), pages 174-187. IEEE, 1986.
20. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symp. Theory of Computing (STOC), pages 218-229, 1987.
21. [Her84] M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.
22. [HM97] M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th ACM Symp. Princip. of Dist. Comp. (PODC), pages 25-34, August 1997.
23. [IK93] T. Ibaraki and T. Kameda. A theory of coteries: Mutual exclusion in distributed systems. IEEE Trans. Par. Dist. Sys., 4(7):779-794, 1993.
24. [ISN87] M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structure. In Proc. IEEE Global Telecommunication Conf. (Globecomm 87), pages 99-102, 1987.
25. [Kum91] A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Trans. Comput., 40(9):996-1004, 1991.
26. [Mae85] M. Maekawa. A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. Comp. Sys., 3(2):145-159, 1985.
27. [MR91] S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology-CRYPTO’91, LNCS 576, pages 392-404. Springer-Verlag, 1991.
28. [MV88] S. J. Mullender and P. M. B. Vitányi. Distributed match-making. Algorithmica, 3:367-391, 1988.
29. [NW94] M. Naor and A. Wool. The load, capacity and availability of quorum systems. In Proc. 35th IEEE Symp. Foundations of Comp. Sci. (FOCS), pages 214-225, 1994. To appear in SIAM J. Computing 1998.
30. [NW96] M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proc. 3rd ACM Conf. Comp, and Comm. Security, pages 157-168, New Delhi, India, 1996. Also available as Theory of Cryptography Library record 96-08, http://theory.lcs.mit.edu/~tcryptol/1996.html.
31. [Owe82] G. Owen. Game Theory. Academic Press, second edition, 1982.
32. [PW97] D. Peleg and A. Wool. Crumbling walls: A class of practical and efficient quorum systems. Distributed Computing, 10(2):87-98, 1997.
33. [RB89] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symp. Theory of Computing (STOC), pages 73-85, 1989.
34. [Sha79] A. Shamir. How to share a secret. Comm. ACM, 22(11):612-613, 1979.