On the complexity of verifiable secret sharing and multiparty computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the complexity of verifiable secret sharing and multiparty computation

Full text

Pdf (1.13 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents

Portland, Oregon, United States

Pages: 325 - 334

Year of Publication: 2000

ISBN:1-58113-184-4

Authors

Ronald Cramer	Aarhus University, Basic Research in Computer Science, center of the Danish National Research Foundation
Ivan Damgård	Aarhus University, BRICS
Stefan Dziembowski	Aarhus University, BRICS

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 55, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335343 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Beimel: Secure Schemes for Secret Sharing and Key Distribution, Ph.D.-thesis, Technion, Haifa, June 1996.
	2	Michael Ben-Or , Shafi Goldwasser , Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.1-10, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62213]
	3	David Chaum , Claude Crépeau , Ivan Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.11-19, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62214]
	4	B. Chor, S. Goldwasser, S. Micali, B. Awerbuch: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proc. of IEEE FOGS '85, pp. 383- 395, 1985.
	5	R. Cramer, I. Damg~rd, S. Dziembowski, M. Hirt, T. Rabin: E~cient Multiparty Computations with Dishonest Minority, Proc. of EUROCRYPT '99, Springer Verlag LNCS, vol. 1592, pp. 311-326, 1999.
	6	R. Cramer, I. Damg~rd, U. Maurer' Secure and Efficient General Multiparty Computations from any Linear Secret Sharing Scheme, Proc. of EUROCRYPT '00, Springer Verlag LNCS, 2000.
	7	Matthias Fitzi , Ueli M. Maurer, Efficient Byzantine Agreement Secure Against General Adversaries, Proceedings of the 12th International Symposium on Distributed Computing, p.134-148, September 24-26, 1998
	8	Rosario Gennaro , Silvio Micali, Theory and practice of verifiable secret sharing, 1996
	9	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States [doi>10.1145/28395.28420]
	10	Martin Hirt , Ueli Maurer, Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract), Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.25-34, August 21-24, 1997, Santa Barbara, California, United States [doi>10.1145/259380.259412]
	11	M. Ito, A. Saito, T. Nishizeki: Secret sharing schemes realizing general access structures, Proc. of iEEE GlobeCom '87 Tokyo, pp. 99-102, 1987.
	12	Joe Kilian, A note on efficient zero-knowledge proofs and arguments (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.723-732, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129782]
	13	M. Kaxchmer, A. Wigderson: On Span Programs, Proc. of Structure in Complexity '93, pp. 102-111, 1993.
	14	M. Naor: Bit commitment using pseudorandomness, Journal of Cryptology, 4(2):151-158, 1991.
	15	T. Rabin , M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.73-85, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73014]
	16	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	17	A. Yao: Protocols for Secure Computation, Proc. of IEEE FOGS '82, pp. 160-164, 1982.