A general completeness theorem for two party games

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A general completeness theorem for two party games

Full text

Pdf (632 KB)

Source

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

New Orleans, Louisiana, United States

Pages: 553 - 560

Year of Publication: 1991

ISBN:0-89791-397-3

Author

Joe Kilian

Massachusetts Institute of Technology, Cambridge

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 28, Citation Count: 6

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/103418.103475 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	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]
	2	R. Ostrovsky, Venkatesan and M. Yung. Manuscript.
	3	Brassard, Gilles, Claude Cr@peau, and Jean- Marc Robert. "Information Theoretic Reductions Among Disclosure Problems," Proceedings of the 27TM FOCS, IEEE, 1986, 168-173.
	4	C. Cr@peau. On the Equivalence of Two Types of Oblivious Transfer. Proc. Crypto87.
	5	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]
	6	C. Cr#peau and J. Kilian Achieving oblivious transfer under weakened security assumption. Proc. FOCS88.
	7	Shimon Even , Oded Goldreich , Abraham Lempel, A randomized protocol for signing contracts, Communications of the ACM, v.28 n.6, p.637-647, June 1985 [doi>10.1145/3812.3818]
	8	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]
	9	E. Kushilevitz. Privacy and Communication Complexity, Proc. of FOCS89.
	10	Rabin, M., "How to exchange secrets by oblivious transfer", Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
	11	A. C. Yao. Protocols for Secure Computations, Proc. of FOCS82.
	12	A. C. Yao. How to Generate and Exchange Secrets, Proc. of FOCS86.

CITED BY 7

	Maurizio Kliban Boyarsky, Public-key cryptography and password protocols: the multi-user case, Proceedings of the 6th ACM conference on Computer and communications security, p.63-72, November 01-04, 1999, Kent Ridge Digital Labs, Singapore
	Donald Beaver, Correlated pseudorandomness and the complexity of private computations, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.479-488, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	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
	Joe Kilian, More general completeness theorems for secure two-party computation, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.316-324, May 21-23, 2000, Portland, Oregon, United States
	Danny Harnik , Moni Naor , Omer Reingold , Alon Rosen, Completeness in two-party secure computation: a computational view, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Dov S. Gordon , Hazay Carmit , Jonathan Katz , Yehuda Lindell, Complete fairness in secure two-party computation, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	I-Cheng Wang , Chih-hao Shen , Justin Zhan , Tsan-sheng Hsu , Churn-Jung Liau , Da-Wei Wang, Toward empirical aspects of secure scalar product, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, v.39 n.4, p.440-447, July 2009

INDEX TERMS

Primary Classification:
G. Mathematics of Computing

Additional Classification:
E. Data
E.3 DATA ENCRYPTION

General Terms:
Algorithms, Security, Theory

Collaborative Colleagues:

Joe Kilian: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player