Multi party computations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multi party computations: past and present

Full text

Pdf (439 KB)

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: 1 - 6

Year of Publication: 1997

ISBN:0-89791-952-1

Author

Shafi Goldwasser

MIT Laboratory for Computer Science, 545 Technology, Square, Cambridge, MA and The Weizmann, Institute

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): 10, Downloads (12 Months): 119, Citation Count: 26

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.259405 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.

	Be	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
	BH	D. Beaver and S. Haber, "Cryptographic Protocols Provably secure Against Dynamic Adversaries", Eurocrypt, 1992.
	BR1	Mihir Bellare , Phillip Rogaway, Entity authentication and key distribution, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.232-249, January 1994, Santa Barbara, California, United States
	BT	Josh Benaloh , Dwight Tuinstra, Receipt-free secret-ballot elections (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.544-553, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195407]
	BCG	Michael Ben-Or , Ran Canetti , Oded Goldreich, Asynchronous secure computation, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.52-61, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167109]
	BGW	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]
	BKR	Michael Ben-Or , Boaz Kelmer , Tal Rabin, Asynchronous secure computations with optimal resilience (extended abstract), Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.183-192, August 14-17, 1994, Los Angeles, California, United States [doi>10.1145/197917.198088]
	BL	M. Ben-Or and N. Linial, "Collective Coin Flipping", Advances in Computing Research, Vol. 5, 1989, pp. 91-115.
	BCC	Gilles Brassard , David Chaum , Claude Crépeau, Minimum disclosure proofs of knowledge, Journal of Computer and System Sciences, v.37 n.2, p.156-189, October 1988 [doi>10.1016/0022-0000(88)90005-0]
	C	R. Canetti, "Asynchronous Secure Computation'', Technical Report no. 755, CS department, Technion, 1992.
	CK	C. Crepeau and J. Kilian, "Achieving Oblivious Transfer Using Weakened security Assumptions", 29th FOC$, pp. 42- 52.
	CDNO	R. Canetti, C. Dwork, M. Nax)r and R. Ostrovsky, "Deniable Encryptions", manuscript.
	CFGN	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]
	CG	R. Canetti and R. Genaro, "Deniable Multiparty Computation", manuscript.
	CaH	Ran Canetti , Amir Herzberg, Maintaining Security in the Presence of Transient Faults, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.425-438, August 21-25, 1994
	CR	Ran Canetti , Tal Rabin, Fast asynchronous Byzantine agreement with optimal resilience, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.42-51, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167105]
	CCD	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]
	CGMA	B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults", 26th FOCS, 1985, pp. 383-395.
	CK	Benny Chor , Eyal Kushilevitz, A zero-one law for Boolean privacy, SIAM Journal on Discrete Mathematics, v.4 n.1, p.36-47, Feb. 1991 [doi>10.1137/0404004]
	CM	B. Chor and L. Moscovici, "Solvability in Asynchronous Environments" 30th FOC$, 1989.
	DH	W. Diftie and M. Hellman, "New directions in cryptography", IEEE Trans. on Info. Theory, IT-22(6), 1976, pp. 644-654.
	DDN	Danny Dolev , Cynthia Dwork , Moni Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.542-552, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103474]
	FM	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]
	FY	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]
	G	O. Goldreich, "Foundations of Cryptography (Fragments of a Book)", ed. Dept. of Computer Science and Applied Mathemetics, Weizmann Institute, 1995.
	GGL	Oded Goldreich , Shafi Goldwasser , Nathan Linial, Fault-tolerant computation in the full information model (extended abstract), Proceedings of the 32nd annual symposium on Foundations of computer science, p.447-457, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185405]
	GMW1	O. Goldreich, S. Micali and A. Wigderson, "Proof that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design", 27th FOC$, 1986, pp. 174-187.
	GMW2	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]
	GM	S. Goldwasser, and S. Micali, "Probabilistic Encryption", SOTC, 1982. Journal version appeared in the JCSS special issue.
	GwL	Shafi Goldwasser , Leonid A. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.77-93, August 11-15, 1990
	GMR	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	HJKY	Amir Herzberg , Stanislaw Jarecki , Hugo Krawczyk , Moti Yung, Proactive Secret Sharing Or: How to Cope With Perpetual Leakage, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.339-352, August 27-31, 1995
	K	Joe Kilian, Founding crytpography on oblivious transfer, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.20-31, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62215]
	MR	S. Micali and P. Rogaway, "Secure Computation". Preliminary version in CR YPTO 91.
	OY	Rafail Ostrovsky , Moti Yung, How to withstand mobile virus attacks (extended abstract), Proceedings of the tenth annual ACM symposium on Principles of distributed computing, p.51-59, August 19-21, 1991, Montreal, Quebec, Canada [doi>10.1145/112600.112605]
	MRa1	M. Rabin, "How to exchange secrets by oblivious transfer", Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981.
	RB	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]
	TRa	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]
	SK	I(. Sako and J. Kilian, "Receipt-Free Mix- Type Voting Scheme", Eurocrypt 1995, pp. 393-403.
	Sh	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]
	Y1	A. Yao, "Protocols for Secure Computation'', 23th FOC$, 1982, pp. 160-164.

CITED BY 26

	Wenliang Du , Mikhail J. Atallah, Secure multi-party computation problems and their applications: a review and open problems, Proceedings of the 2001 workshop on New security paradigms, September 10-13, 2001, Cloudcroft, New Mexico
	Yair Frankel , Philip MacKenzie , Moti Yung, Adaptively secure distributed public-key systems, Theoretical Computer Science, v.287 n.2, p.535-561, 28 September 2002
	Wenliang Du , Zhijun Zhan, Building decision tree classifier on private data, Proceedings of the IEEE international conference on Privacy, security and data mining, p.1-8, December 01, 2002, Maebashi City, Japan
	Wenliang Du , Zhijun Zhan, A practical approach to solve Secure Multi-party Computation problems, Proceedings of the 2002 workshop on New security paradigms, September 23-26, 2002, Virginia Beach, Virginia
	Robert McGrew , Ryan Porter , Yoav Shoham, Towards a general theory of non-cooperative computation, Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge, June 20-22, 2003, Univerity of Indiana, Indiana
	Giovanni Di-Crescenzo , Yuval Ishai , Rafail Ostrovsky, Universal service-providers for database private information retrieval (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, p.91-100, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Keith B. Frikken , Mikhail J. Atallah, Privacy preserving route planning, Proceedings of the 2004 ACM workshop on Privacy in the electronic society, October 28-28, 2004, Washington DC, USA
	Keith B. Frikken , Mikhail J. Atallah, Privacy preserving electronic surveillance, Proceedings of the 2003 ACM workshop on Privacy in the electronic society, October 30, 2003, Washington, DC
	Mikhail Atallah , Marina Bykova , Jiangtao Li , Keith Frikken , Mercan Topkara, Private collaborative forecasting and benchmarking, Proceedings of the 2004 ACM workshop on Privacy in the electronic society, October 28-28, 2004, Washington DC, USA
	Wenjun Luo , Xiang Li, A study of secure multi-party elementary function computation protocols, Proceedings of the 3rd international conference on Information security, November 14-16, 2004, Shanghai, China
	Zhengli Huang , Wenliang Du , Biao Chen, Deriving private information from randomized data, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland
	Keith Frikken , Mikhail Atallah , Chen Zhang, Privacy-preserving credit checking, Proceedings of the 6th ACM conference on Electronic commerce, p.147-154, June 05-08, 2005, Vancouver, BC, Canada
	Sheng Zhang , Fillia Makedon, Privacy preserving learning in negotiation, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
	Shun-Dong Li , Yi-Qi Dai, Secure two-party computational geometry, Journal of Computer Science and Technology, v.20 n.2, p.258-263, March 2005
	Wan Haiping , He Huacan, Tools for privacy preserving Kernel methods in data mining, Proceedings of the 24th IASTED international conference on Artificial intelligence and applications, p.388-391, February 13-16, 2006, Innsbruck, Austria
	Li Xiong , Subramanyam Chitti , Ling Liu, Mining multiple private databases using a kNN classifier, Proceedings of the 2007 ACM symposium on Applied computing, March 11-15, 2007, Seoul, Korea
	Mayank Bawa , Roberto J. Bayardo, Jr. , Rakesh Agrawal, Privacy-preserving indexing of documents on the network, Proceedings of the 29th international conference on Very large data bases, p.922-933, September 09-12, 2003, Berlin, Germany
	Rhys Smith , Jianhua Shao, Privacy and e-commerce: a consumer-centric perspective, Electronic Commerce Research, v.7 n.2, p.89-116, June 2007
	Xu Wei-jiang , Jing Wei-wei , Huang Liu-sheng , Yao Yi-fei, Privacy-preserving collision detection of two circles, Proceedings of the 2nd international conference on Scalable information systems, June 06-08, 2007, Suzhou, China
	Li Shundong , Wang Daoshun , Dai Yiqi , Luo Ping, Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations, Information Sciences: an International Journal, v.178 n.1, p.244-255, January, 2008
	Justin Z. Zhan , Stan Matwin , LiWu Chang, Privacy-preserving multi-party decision tree induction, International Journal of Business Intelligence and Data Mining, v.2 n.2, p.197-212, June 2007
	Aviv Zohar , Jeffrey S. Rosenschein, Mechanisms for information elicitation, Artificial Intelligence, v.172 n.16-17, p.1917-1939, November, 2008
	Danfeng Yao , Keith B. Frikken , Mikhail J. Atallah , Roberto Tamassia, Private Information: To Reveal or not to Reveal, ACM Transactions on Information and System Security (TISSEC), v.12 n.1, p.1-27, October 2008
	Pawel Jurczyk , Li Xiong, Towards privacy-preserving integration of distributed heterogeneous data, Proceeding of the 2nd PhD workshop on Information and knowledge management, October 30-30, 2008, Napa Valley, California, USA
	Florian Kerschbaum , Daniel Dahlmeier , Axel Schröpfer , Debmalya Biswas, On the practical importance of communication complexity for secure multi-party computation protocols, Proceedings of the 2009 ACM symposium on Applied Computing, March 08-12, 2009, Honolulu, Hawaii
	Mayank Bawa , Roberto J. Bayardo, Jr , Rakesh Agrawal , Jaideep Vaidya, Privacy-preserving indexing of documents on the network, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.4, p.837-856, August 2009