Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

Full text

Pdf (1.06 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing table of contents

Santa Barbara, California, United States

Pages: 25 - 34

Year of Publication: 1997

ISBN:0-89791-952-1

Authors

Martin Hirt	Department of Computer Science, Swiss Federal Institute of Technology (ETH), Zurich, CH-8092 Zurich, Switzerland
Ueli Maurer	Department of Computer Science, Swiss Federal Institute of Technology (ETH), Zurich, CH-8092 Zurich, Switzerland

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 34, Citation Count: 11

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/259380.259412 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	Donald Beaver, Foundations of Secure Interactive Computing, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.377-391, August 11-15, 1991
	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	CANETTI, R. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995.
	4	Ran Canetti , Uri Feige , Oded Goldreich , Moni Naor, Adaptively secure multi-party computation, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.639-648, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.238015]
	5	R. Canetti , R. Gennaro, Incoercible multiparty computation, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.504, October 14-16, 1996
	6	David Chaum, The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptographically from majorities, Proceedings on Advances in cryptology, p.591-602, July 1989, Santa Barbara, California, United States
	7	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]
	8	David Chaum , Ivan Damgård , Jeroen van de Graaf, Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.87-119, August 16-20, 1987
	9	B. Chor , E. Kushilevitz, A zero-one law for Boolean privacy, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.62-72, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73013]
	10	CRAMER, R., FRANKLIN, M., SCHOENMAKERS, B., AND YUNC, M. Multi-authority secret-ballot elections with linear work. InAdvances in Cryptolog~t ~ E U- ROCRYPT '96 (1996), vol. 1070 of Lecture Notes in Computer Science, IACR, SpringeroVerlag, pp. 72-83.
	11	Claude Crépeau , Jeroen van de Graaf , Alain Tapp, Committed Oblivious Transfer and Private Multi-Party Computation, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.110-123, August 27-31, 1995
	12	Uri Feige , Joe Killian , Moni Naor, A minimal model for secure computation (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.554-563, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195408]
	13	Paul Feldman , Silvio Micali, Optimal algorithms for Byzantine agreement, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.148-161, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62225]
	14	FITZI, M. Erweiterte Zugriffstrukturen in Multi-Party- Computation. Diploma thesis, ETH Ziirich, 1996.
	15	Matthew K. Franklin , Michael K. Reiter, The Design and Implementation of a Secure Auction Service, IEEE Transactions on Software Engineering, v.22 n.5, p.302-312, May 1996 [doi>10.1109/32.502223]
	16	FRANKLIN, M., AND YUNG, M. The varieties of secure distributed computation. In Sequences II: Methotis in Communication, Security, and Computer Science ( 1991 ), Springer-Verlag, pp. 392-417.
	17	Matthew Keith Franklin, Complexity and security of distributed protocols, Columbia University, New York, NY, 1994
	18	Matthew Franklin , Moti Yung, Communication complexity of secure computation (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.699-710, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129780]
	19	Zvi Galil , Stuart Haber , Moti Yung, Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.135-155, August 16-20, 1987
	20	GrNNAaO, R. Theory and Practice of Verifiable Se. cret Sharing. PhD thesis, Massachusetts Institute of Technology (MIT), May 1996.
	21	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]
	22	KUSnILSVITZ, E. Privacy and communication complexity (extended abstract). In Proc. 30th iEEE Symposium on the Foundations o{ Computer Science (FOES) (1989), pp. 416-421.
	23	Leslie Lamport , Robert Shostak , Marshall Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.382-401, July 1982 [doi>10.1145/357172.357176]
	24	Silvio Micali , Phillip Rogaway, Secure Computation (Abstract), Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.392-404, August 11-15, 1991
	25	M. Pease , R. Shostak , L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM (JACM), v.27 n.2, p.228-234, April 1980 [doi>10.1145/322186.322188]
	26	Tal Rabin, Robust sharing of secrets when the dealer is honest or cheating, Journal of the ACM (JACM), v.41 n.6, p.1089-1109, Nov. 1994 [doi>10.1145/195613.195621]
	27	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]
	28	Alfredo De Santis , Yvo Desmedt , Yair Frankel , Moti Yung, How to share a function securely, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.522-533, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195405]
	29	YAO, A. C. Protocols for secure computations. In Proc. ~Srd IEEE Symposium on the Foundations o! Computer Science (FOES) (1982), IEEE, pp. 160-164

CITED BY 11

	Ronald Cramer , Ivan Damgård , Stefan Dziembowski, On the complexity of verifiable secret sharing and multiparty computation, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.325-334, May 21-23, 2000, Portland, Oregon, United States
	S. Amitanand , I. Sanketh , K. Srinathant , V. Vinod , C. Pandu Rangan, Distributed consensus in the presence of sectional faults, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.202-210, July 13-16, 2003, Boston, Massachusetts
	M V N Ashwin Kumar , Pranava R. Goundan , K Srinathan , C. Pandu Rangan, On perfectly secure communication over arbitrary networks, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California
	Moni Naor, Cryptography and mechanism design, Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, July 08-10, 2001, Siena, Italy
	Rachid Guerraoui , Marko VukoliĆ, Refined quorum systems, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, August 12-15, 2007, Portland, Oregon, USA
	Ran Canetti, Security and composition of cryptographic protocols: a tutorial (part I), ACM SIGACT News, v.37 n.3, September 2006
	Ueli Maurer, Secure multi-party computation made simple, Discrete Applied Mathematics, v.154 n.2, p.370-381, 1 February 2006
	Kannan Srinathan , C. Pandu Rangan, Possibility and complexity of probabilistic reliable communication in directed networks, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, July 23-26, 2006, Denver, Colorado, USA
	Sergio Rajsbaum, ACM SIGACT news distributed computing column 24, ACM SIGACT News, v.37 n.4, December 2006
	Qunwei Zheng , Sibabrata Ray , Xiaoyan Hong , Lei Tang , Li Gao, Integrity and its applications, Proceedings of the 45th annual southeast regional conference, March 23-24, 2007, Winston-Salem, North Carolina
	Arpita Patra , Ashish Choudhary , C. Pandu Rangan , Kannan Srinathan , Prasad Raghavendra, Perfectly reliable and secure message transmission tolerating mobile adversary, International Journal of Applied Cryptography, v.1 n.3, p.200-224, February 2009