How to play ANY mental game

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

How to play ANY mental game

Full text

Pdf (1.29 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the nineteenth annual ACM symposium on Theory of computing table of contents

New York, New York, United States

Pages: 218 - 229

Year of Publication: 1987

ISBN:0-89791-221-7

Authors

O. Goldreich	Dept. of Computer Sc. Technion Haifa, Israel
S. Micali	Lab. for Computer Sc. MIT Cambridge, MA
A. Wigderson	Inst. of Math. and CS, Hebrew University, Jerusalem, Israel

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 56, Downloads (12 Months): 360, Citation Count: 224

Additional Information:

abstract 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/28395.28420 What is a DOI?

ABSTRACT

We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution [C].

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.

	Ba	D A Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC¹, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.1-5, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12131]
	Bl	M. Blum, Coin Flipping by Telephone, IEEE COMPCON 1982, pp. 133-137.
	BH	R. Boppana and R. Hirschfeld, Pseudo-Random Generatoro and Complexity Clauses, To appear in Randomness and Computation, 5th volume of Advances in Computing Research, ed. S. Micali
	BM	Manuel Blum , Silvio Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing, v.13 n.4, p.850-864, Nov. 1984 [doi>10.1137/0213053]
	CG	B. Chor and O. Goldreich, RSA/Rabi, Bits Are 1/2 4- 1/poly(log N) Seeure, To appear SIAM J. on Computing. Earlier version in Proc. FOCS 1984, pp. 449- 463
	CGMA	B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults', Proc. 26th FOCS, 1985, pp. 383-395
	EGL	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]
	FMRW	M.Fiseher, S. Mieali, C. Raekoff and D. Witenberg, A Secure Protocol for the Oblivious Transfer, In preperation 1986.
	GM	S. Goldwa~ser, and S. Micali, Probabilisti~ Eneryption, JCSS Vol. 28, No. 2, April 1984. An earlier version (containing other results) was tiffed Probabilistic Encryption and How to Play Mental Poker Hideing All Partial Information,
	GMR	S Goldwasser , S Micali , C Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.291-304, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22178]
	GoMiRi	S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive, Chosen Gyphertext Attack To appear in SIAM J. on Computing (available from authors) Earlier version, titled 'A Paradoxical Solution to The Signature Problem, in Proc. 25th FOCS, 1984, pp. 441-448
	GMW	O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of U~ptographie Design, Proe. of FOCS 1986.
	HR	Joseph Y. Halpern , Michael O. Rabin, A logic to reason about likelihood, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.310-319, December 1983 [doi>10.1145/800061.808760]
	L	L A Levin, One-way functions and pseudorandom generators, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.363-365, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22185]
	Y	A.Yao, Theory and Application of Trapdoor Functions, Proc. of 23rd FOCS, IEEE, Nov., ~982, pp 80-9t.
	Y2	A.Yao, How to Generate and Exchang~ Secrets, Proc. 27th STOC, 1986, pp. 162-167

CITED BY 225

	Wei Jiang , Chris Clifton , Murat Kantarcıoğlu, Transforming semi-honest protocols to ensure accountability, Data & Knowledge Engineering, v.65 n.1, p.57-74, April, 2008
	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
	Murat Kantarcioĝlu , Chris Clifton, Assuring privacy when big brother is watching, Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, June 13-13, 2003, San Diego, California
	Rajiv Gupta , Scott A. Smolka , Shaji Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), v.26 n.1, p.7-86, March 1994
	Yair Frankel , Philip D. MacKenzie , Moti Yung, Robust efficient distributed RSA-key generation, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.663-672, May 24-26, 1998, Dallas, Texas, United States
	Ronald Fagin , Moni Naor , Peter Winkler, Comparing information without leaking it, Communications of the ACM, v.39 n.5, p.77-85, May 1996
	Donald Beaver, Server-assisted cryptography, Proceedings of the 1998 workshop on New security paradigms, p.92-106, September 22-26, 1998, Charlottesville, Virginia, United States
	Shlomi Dolev , Rafail Ostrobsky, Xor-trees for efficient anonymous multicast and reception, ACM Transactions on Information and System Security (TISSEC), v.3 n.2, p.63-84, May 2000
	J. Bar-Ilan , D. Beaver, Non-cryptographic fault-tolerant computing in constant number of rounds of interaction, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.201-209, June 1989, Edmonton, Alberta, Canada
	Cynthia Dwork , Jeffrey Lotspiech , Moni Naor, Digital signets: self-enforcing protection of digital information (preliminary version), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.489-498, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Donald Beaver, Adaptive zero knowledge and computational equivocation (extended abstract), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.629-638, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	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
	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
	Christian Cachin, Efficient private bidding and auctions with an oblivious third party, Proceedings of the 6th ACM conference on Computer and communications security, p.120-127, November 01-04, 1999, Kent Ridge Digital Labs, Singapore
	Birgit Pfitzmann, Sorting out signature schemes, Proceedings of the 1st ACM conference on Computer and communications security, p.74-85, November 03-05, 1993, Fairfax, Virginia, United States
	Silvio Micali , Kazuo Ohta , Leonid Reyzin, Accountable-subgroup multisignatures: extended abstract, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA
	Moni Naor , Benny Pinkas, Efficient oblivious transfer protocols, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.448-457, January 07-09, 2001, Washington, D.C., United States
	Anna Gál , Adi Rosén, A theorem on sensitivity and applications in private computation, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.348-357, May 01-04, 1999, Atlanta, Georgia, United States
	Dan Boneh , Matthew Franklin, Efficient generation of shared RSA keys, Journal of the ACM (JACM), v.48 n.4, p.702-722, July 2001
	Joe Kilian, A general completeness theorem for two party games, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.553-560, May 05-08, 1991, New Orleans, Louisiana, United States
	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
	Eyal Kushilevitz , Rafail Ostrovsky , Adi Rosén, Characterizing linear size circuits in terms of privacy, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.541-550, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Ming-Deh A. Huang , Shang-Hua Teng, Secure and verifiable schemes for election and general distributed computing problems, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.182-196, August 15-17, 1988, Toronto, Ontario, Canada
	Cynthia Dwork , Moni Naor , Amit Sahai, Concurrent zero-knowledge, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.409-418, May 24-26, 1998, Dallas, Texas, United States
	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
	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
	Ran Canetti , Yehuda Lindell , Rafail Ostrovsky , Amit Sahai, Universally composable two-party and multi-party secure computation, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	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
	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
	Ran Canetti , Rafail Ostrovsky, Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest?, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.255-264, May 01-04, 1999, Atlanta, Georgia, United States
	Birgit Pfitzmann , Michael Waidner, Asymmetric fingerprinting for larger collusions, Proceedings of the 4th ACM conference on Computer and communications security, p.151-160, April 01-04, 1997, Zurich, Switzerland
	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
	Jaideep Vaidya , Chris Clifton, Privacy preserving association rule mining in vertically partitioned data, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, July 23-26, 2002, Edmonton, Alberta, Canada
	Ran Canetti , Yuval Ishai , Ravi Kumar , Michael K. Reiter , Ronitt Rubinfeld , Rebecca N. Wright, Selective private function evaluation with applications to private statistics, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.293-304, August 2001, Newport, Rhode Island, United States
	Matthias Fitzi , Daniel Gottesman , Martin Hirt , Thomas Holenstein , Adam Smith, Detectable byzantine agreement secure against faulty majorities, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California
	Yehuda Lindell, Bounded-concurrent secure two-party computation without setup assumptions, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Makoto Yokoo , Koutarou Suzuki, Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions, Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1, July 15-19, 2002, Bologna, Italy
	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
	Benny Chor, On privacy and partition arguments, Information and Computation, v.167 n.1, p.2-9, 5/25/2001
	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
	Shafi Goldwasser, Multi party computations: past and present, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.1-6, August 21-24, 1997, Santa Barbara, California, United States
	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
	Sanjeev Arora, The approximability of NP-hard problems, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.337-348, May 24-26, 1998, Dallas, Texas, United States
	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
	Birgit Pfitzmann , Michael Waidner, Composition and integrity preservation of secure reactive systems, Proceedings of the 7th ACM conference on Computer and communications security, p.245-254, November 01-04, 2000, Athens, Greece
	Ronald Cramer , Ivan Damgård, Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.436-445, May 04-06, 1997, El Paso, Texas, United States
	Rosario Gennaro , Michael O. Rabin , Tal Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, p.101-111, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Michael K. Reiter, Secure agreement protocols: reliable and atomic group multicast in rampart, Proceedings of the 2nd ACM Conference on Computer and communications security, p.68-80, November 1994, Fairfax, Virginia, United States
	Rafail Ostrovsky , Victor Shoup, Private information storage (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.294-303, May 04-06, 1997, El Paso, Texas, United States
	Oded Goldreich , Rafail Ostrovsky , Erez Petrank, Computational complexity and knowledge complexity (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.534-543, May 23-25, 1994, Montreal, Quebec, Canada
	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
	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
	Moni Naor , Benny Pinkas , Reuban Sumner, Privacy preserving auctions and mechanism design, Proceedings of the 1st ACM conference on Electronic commerce, p.129-139, November 03-05, 1999, Denver, Colorado, United States
	Moni Naor , Kobbi Nissim, Communication preserving protocols for secure function evaluation, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.590-599, July 2001, Hersonissos, Greece
	Eyal Kushilevitz , Yishay Mansour, Randomness in private computations, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.181-190, May 23-26, 1996, Philadelphia, Pennsylvania, United States
	Rafail Ostrovsky , Sridhar Rajagopalan , Umesh Vazirani, Simple and efficient leader election in the full information model, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.234-242, May 23-25, 1994, Montreal, Quebec, Canada
	Donald Beaver, Commodity-based cryptography (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.446-455, May 04-06, 1997, El Paso, Texas, United States
	Michael Reiter, Distributing trust with the Rampart toolkit, Communications of the ACM, v.39 n.4, p.71-74, April 1996
	Ran Canetti , Eyal Kushilevitz , Rafail Ostrovsky , Adi Rosén, Randomness vs. fault-tolerance, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.35-44, August 21-24, 1997, Santa Barbara, California, 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
	Lidong Zhou , Fred B. Schneider , Robbert Van Renesse, COCA: A secure distributed online certification authority, ACM Transactions on Computer Systems (TOCS), v.20 n.4, p.329-368, November 2002
	R. Impagliazzo , S. Rudich, Limits on the provable consequences of one-way permutations, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.44-61, May 14-17, 1989, Seattle, Washington, United States
	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
	Danny Dolev , Cynthia Dwork , Orli Waarts , Moti Yung, Perfectly secure message transmission, Journal of the ACM (JACM), v.40 n.1, p.17-47, Jan. 1993
	Charles Rackoff , Daniel R. Simon, Cryptographic defense against traffic analysis, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.672-681, May 16-18, 1993, San Diego, California, United States
	Oded Goldreich, Cryptography and cryptographic protocols, Distributed Computing, v.16 n.2-3, p.177-199, September 2003
	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
	Yan-Cheng Chang , Chi-Jen Lu, Oblivious polynomial evaluation and oblivious neural learning, Theoretical Computer Science, v.341 n.1, p.39-54, 5 September 2005
	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
	Irit Dinur , Kobbi Nissim, Revealing information while preserving privacy, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.202-210, June 09-11, 2003, San Diego, California
	Anna Gal , Adi Rosen, Lower bounds on the amount of randomness in private computation, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Yehuda Lindell, Brief announcement: impossibility results for concurrent secure two-party computation, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.200-200, July 13-16, 2003, Boston, Massachusetts
	Jaideep Vaidya , Chris Clifton, Leveraging the "Multi" in secure multi-party computation, Proceedings of the 2003 ACM workshop on Privacy in the electronic society, October 30, 2003, Washington, DC
	Claude Crépeau , Daniel Gottesman , Adam Smith, Secure multi-party quantum computation, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Matthias Fitzi , Juan A. Garay, Efficient player-optimal protocols for strong and differential consensus, Proceedings of the twenty-second annual symposium on Principles of distributed computing, p.211-220, July 13-16, 2003, Boston, Massachusetts
	Jaideep Vaidya , Chris Clifton, Privacy-preserving k-means clustering over vertically partitioned data, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Chris Clifton , Murat Kantarcioglu , Jaideep Vaidya , Xiaodong Lin , Michael Y. Zhu, Tools for privacy preserving distributed data mining, ACM SIGKDD Explorations Newsletter, v.4 n.2, p.28-34, December 2002
	Chin-Chen Chang , Chi-Yien Chung, An efficient protocol for anonymous multicast and reception, Information Processing Letters, v.85 n.2, p.99-103, 31 January 2003
	Rosario Gennaro , Yuval Ishai , Eyal Kushilevitz , Tal Rabin, The round complexity of verifiable secret sharing and secure multicast, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.580-589, July 2001, Hersonissos, Greece
	Benny Chor , Michael O. Rabin, Achieving independence in logarithmic number of rounds, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.260-268, August 10-12, 1987, Vancouver, British Columbia, Canada
	Mihir Bellare , Ran Canetti , Hugo Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.419-428, May 24-26, 1998, Dallas, Texas, United States
	Oded Goldreich , Silvio Micali , Avi Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM (JACM), v.38 n.3, p.690-728, July 1991
	Manuel Blum , Paul Feldman , Silvio Micali, Non-interactive zero-knowledge and its applications, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.103-112, May 02-04, 1988, Chicago, Illinois, United States
	Giovanni Di Crescenzo , Yuval Ishai , Rafail Ostrovsky, Non-interactive and non-malleable commitment, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.141-150, May 24-26, 1998, Dallas, Texas, United States
	Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Widgerson, Multi-prover interactive proofs: how to remove intractability assumptions, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.113-131, May 02-04, 1988, Chicago, Illinois, United States
	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
	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
	David Woodruff , Jessica Staddon, Private inference control, Proceedings of the 11th ACM conference on Computer and communications security, October 25-29, 2004, Washington DC, USA
	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
	Rafael Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Ueli Maurer, The role of cryptography in database security, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	Matt Lepinski , Silvio Micali , Chris Peikert , Abhi Shelat, Completely fair SFE and coalition-safe cheap talk, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada
	C. Blundo , A. Giorgio Gaggia , D. R. Stinson, On the Dealer‘s Randomness Required in Secret Sharing Schemes, Designs, Codes and Cryptography, v.11 n.3, p.235-259, July 1997
	Moni Naor, Cryptography and mechanism design, Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, July 08-10, 2001, Siena, Italy
	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
	József Balogh , János A. Csirik , Yuval Ishai , Eyal Kushilevitz, Private computation using a PEZ dispenser, Theoretical Computer Science, v.306 n.1-3, p.69-84, 5 September 2003
	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
	Cynthia Dwork , Moni Naor , Amit Sahai, Concurrent zero-knowledge, Journal of the ACM (JACM), v.51 n.6, p.851-898, November 2004
	Bobi Gilburd , Assaf Schuster , Ran Wolff, k-TTP: a new privacy model for large-scale distributed environments, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	Manoj Prabhakaran , Amit Sahai, New notions of security: achieving universal composability without trusted setup, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, 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
	Matt Lepinksi , Silvio Micali , abhi shelat, Collusion-free protocols, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
	Zhiqiang Yang , Sheng Zhong , Rebecca N. Wright, Anonymity-preserving data collection, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
	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
	Benny Pinkas, Cryptographic techniques for privacy-preserving data mining, ACM SIGKDD Explorations Newsletter, v.4 n.2, p.12-19, December 2002
	Alejandro Hevia , Daniele Micciancio, Simultaneous broadcast revisited, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA
	Jiangtao Li , Ninghui Li, Policy-hiding access control in open environment, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA
	Nan Zhang , Wei Zhao, Distributed privacy preserving information sharing, Proceedings of the 31st international conference on Very large data bases, August 30-September 02, 2005, Trondheim, Norway
	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
	Yael Tauman Kalai , Yehuda Lindell , Manoj Prabhakaran, Concurrent general composition of secure protocols in the timing model, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
	Luis von Ahn , Nicholas Hopper , John Langford, Covert two-party computation, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
	Felix Brandt , Tuomas Sandholm, Decentralized voting with unconditional privacy, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, July 25-29, 2005, The Netherlands
	Rafael Pass , Alon Rosen, New and improved constructions of non-malleable cryptographic protocols, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
	Rakesh Agrawal , Ramakrishnan Srikant , Dilys Thomas, Privacy preserving OLAP, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland
	Felix Brandt , Tuomas Sandholm, Unconditional privacy in social choice, Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge, June 10-12, 2005, Singapore
	Rosario Gennaro , Mario Di Raimondo, Secure multiplication of shared secrets in the exponent, Information Processing Letters, v.96 n.2, p.71-79, 31 October 2005
	Boaz Barak , Shai Halevi, A model and architecture for pseudo-random generation with applications to /dev/random, Proceedings of the 12th ACM conference on Computer and communications security, November 07-11, 2005, Alexandria, VA, USA
	Jaideep Vaidya , Chris Clifton, Privacy-Preserving Data Mining: Why, How, and When, IEEE Security and Privacy, v.2 n.6, p.19-27, November 2004
	Fred B. Schneider , Lidong Zhou, Implementing Trustworthy Services Using Replicated State Machines, IEEE Security and Privacy, v.3 n.5, p.34-43, September 2005
	Makoto Yokoo , Koutarou Suzuki , Katsutoshi Hirayama, Secure distributed constraint satisfaction: reaching agreement without revealing private information, Artificial Intelligence, v.161 n.1-2, p.229-245, January 2005
	Joseph Halpern , Vanessa Teague, Rational secret sharing and multiparty computation: extended abstract, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Xiaodong Lin , Chris Clifton , Michael Zhu, Privacy-preserving clustering with distributed EM mixture modeling, Knowledge and Information Systems, v.8 n.1, p.68-81, July 2005
	Ninghui Li , Wenliang Du , Dan Boneh, Oblivious signature-based envelope, Distributed Computing, v.17 n.4, p.293-302, May 2005
	Justin Brickell , Vitaly Shmatikov, Efficient anonymity-preserving data collection, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, August 20-23, 2006, Philadelphia, PA, USA
	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
	Ran Canetti , Ling Cheung , Dilsun Kaynar , Moses Liskov , Nancy Lynch , Olivier Pereira , Roberto Segala, Analyzing Security Protocols Using Time-Bounded Task-PIOAs, Discrete Event Dynamic Systems, v.18 n.1, p.111-159, March 2008
	Artak Amirbekyan , Vladimir Estivill-Castro, A new efficient privacy-preserving scalar product protocol, Proceedings of the sixth Australasian conference on Data mining and analytics, December 03-04, 2007, Gold Coast, Australia
	Amos Beimel , Paz Carmi , Kobbi Nissim , Enav Weinreb, Private approximation of search problems, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Cynthia Dwork , Larry Stockmeyer, Finite state verifiers II: zero knowledge, Journal of the ACM (JACM), v.39 n.4, p.829-858, Oct. 1992
	Ran Canetti, Security and composition of cryptographic protocols: a tutorial (part I), ACM SIGACT News, v.37 n.3, September 2006
	M. Barni , C. Orlandi , A. Piva, A privacy-preserving protocol for neural-network-based computation, Proceeding of the 8th workshop on Multimedia and security, September 26-27, 2006, Geneva, Switzerland
	Philippe Golle , Frank McSherry , Ilya Mironov, Data collection with self-enforcing privacy, Proceedings of the 13th ACM conference on Computer and communications security, October 30-November 03, 2006, Alexandria, Virginia, USA
	Joan Feigenbaum , Yuval Ishai , Tal Malkin , Kobbi Nissim , Martin J. Strauss , Rebecca N. Wright, Secure multiparty computation of approximations, ACM Transactions on Algorithms (TALG), v.2 n.3, p.435-472, July 2006
	Oded Goldreich, Foundations of cryptography: a primer, Foundations and Trends® in Theoretical Computer Science, v.1 n.1, p.1-116, April 2005
	Ueli Maurer, Secure multi-party computation made simple, Discrete Applied Mathematics, v.154 n.2, p.370-381, 1 February 2006
	Louis Kruger , Somesh Jha , Eu-Jin Goh , Dan Boneh, Secure function evaluation with ordered binary decision diagrams, Proceedings of the 13th ACM conference on Computer and communications security, October 30-November 03, 2006, Alexandria, Virginia, USA
	Keith B. Frikken , Philippe Golle, Private social network analysis: how to assemble pieces of a graph privately, Proceedings of the 5th ACM workshop on Privacy in electronic society, October 30-30, 2006, Alexandria, Virginia, USA
	Steven S. Seiden , Peter P. Chen , R. F. Lax , J. Chen , Guoli Ding, New bounds for randomized busing, Theoretical Computer Science, v.332 n.1-3, p.63-81, 28 February 2005
	Ittai Abraham , Danny Dolev , Rica Gonen , Joe Halpern, Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, July 23-26, 2006, Denver, Colorado, USA
	Yuval Ishai , Eyal Kushilevitz , Yehuda Lindell , Erez Petrank, Black-box constructions for secure computation, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Eyal Kushilevitz , Yehuda Lindell , Tal Rabin, Information-theoretically secure protocols and security under composition, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Boris Rozenberg , Ehud Gudes, Association rules mining in vertically partitioned databases, Data & Knowledge Engineering, v.59 n.2, p.378-396, November 2006
	Ashwin Machanavajjhala , Daniel Kifer , Johannes Gehrke , Muthuramakrishnan Venkitasubramaniam, L-diversity: Privacy beyond k-anonymity, ACM Transactions on Knowledge Discovery from Data (TKDD), v.1 n.1, p.3-es, March 2007
	Yehuda Lindell , Anna Lysyanskaya , Tal Rabin, On the composition of authenticated Byzantine Agreement, Journal of the ACM (JACM), v.53 n.6, p.881-917, November 2006
	Sergio Rajsbaum, ACM SIGACT news distributed computing column 24, ACM SIGACT News, v.37 n.4, December 2006
	Artak Amirbekyan , Vladimir Estivill-Castro, The privacy of k-NN retrieval for horizontal partitioned data: new methods and applications, Proceedings of the eighteenth conference on Australasian database, p.33-42, January 30-February 02, 2007, Ballarat, Victoria, Australia
	Dahlia Malkhi , Noam Nisan , Benny Pinkas , Yaron Sella, Fairplay—a secure two-party computation system, Proceedings of the 13th conference on USENIX Security Symposium, p.20-20, August 09-13, 2004, San Diego, CA
	Sergio Loureiro , Laurent Bussard , Yves Roudier, Extending tamper-proof hardware security to untrusted execution environments, Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference, p.12-12, November 21-22, 2002, San Jose, CA
	Cheng-Kang Chu , Wen-Guey Tzeng, Optimal resilient threshold GQ signatures, Information Sciences: an International Journal, v.177 n.8, p.1834-1851, April, 2007
	Michael Harkavy , J. D. Tygar , Hiroaki Kikuchi, Electronic auctions with private bids, Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce, p.6-6, August 31-September 03, 1998, Boston, Massachusetts
	G. Aggarwal , M. Bawa , P. Ganesan , H. Garcia-Molina , K. Kenthapadi , N. Mishra , R. Motwani , U. Srivastava , D. Thomas , J. Widom , Y. Xu, Vision paper: enabling privacy for the paranoids, Proceedings of the Thirtieth international conference on Very large data bases, p.708-719, August 31-September 03, 2004, Toronto, Canada
	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
	Yuval Ishai , Eyal Kushilevitz , Rafail Ostrovsky , Amit Sahai, Zero-knowledge from secure multiparty computation, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	Jonathan Katz, On achieving the "best of both worlds" in secure multiparty computation, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	Xun Yi , Yanchun Zhang, Privacy-preserving distributed association rule mining via semi-trusted mixer, Data & Knowledge Engineering, v.63 n.2, p.550-567, November, 2007
	Jaideep Vaidya , Chris Clifton, Secure set intersection cardinality with application to association rule mining, Journal of Computer Security, v.13 n.4, p.593-622, July 2005
	Arjan Durresi, Anonymous communications in the Internet, Cluster Computing, v.10 n.1, p.57-66, March 2007
	Sébastien Gambs , Balázs Kégl , Esma Aïmeur, Privacy-preserving boosting, Data Mining and Knowledge Discovery, v.14 n.1, p.131-170, February 2007
	C. Orlandi , A. Piva , M. Barni, Oblivious neural network computing via homomorphic encryption, European Journal of Information Systems, v.2007 n.1, p.1-10, January 2007
	Wei Jiang , Chris Clifton, A secure distributed framework for achieving k-anonymity, The VLDB Journal — The International Journal on Very Large Data Bases, v.15 n.4, p.316-333, November 2006
	Felix Brandt , Tuomas Sandholm, (Im)Possibility of Unconditionally Privacy-Preserving Auctions, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, p.810-817, July 19-23, 2004, New York, New York
	D. Beaver , S. Micali , P. Rogaway, The round complexity of secure protocols, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.503-513, May 13-17, 1990, Baltimore, Maryland, United States
	Felix Brandt , Tuomas Sandholm, On the Existence of Unconditionally Privacy-Preserving Auction Protocols, ACM Transactions on Information and System Security (TISSEC), v.11 n.2, p.1-21, March 2008
	Richard Cissée , Sahin Albayrak, An agent-based approach for privacy-preserving recommender systems, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii
	Keith Frikken , Mikhail Atallah , Jiangtao Li, Attribute-Based Access Control with Hidden Policies and Hidden Credentials, IEEE Transactions on Computers, v.55 n.10, p.1259-1270, October 2006
	Zuhua Shao, Dynamic and efficient joint encryption scheme in the plain public key model, Computers and Electrical Engineering, v.35 n.1, p.189-196, January, 2009
	Amir Herzberg , Igal Yoffe, The layered games framework for specifications and analysis of security protocols, International Journal of Applied Cryptography, v.1 n.2, p.144-159, November 2008
	Michael Backes , Birgit Pfitzmann , Andre Scedrov, Key-dependent message security under active attacks - BRSIM/UC-soundness of Dolev-Yao-style encryption with key cycles, Journal of Computer Security, v.16 n.5, p.497-530, November 2008
	Oded Goldreich, Probabilistic Proof Systems: A Primer, Foundations and Trends® in Theoretical Computer Science, v.3 n.1, p.1-91, January 2008
	Mikhail J. Atallah , Keith B. Frikken , Marina Blanton , YounSun Cho, Private combinatorial group testing, Proceedings of the 2008 ACM symposium on Information, computer and communications security, March 18-20, 2008, Tokyo, Japan
	Juan Ramón Troncoso-Pastoriza , Stefan Katzenbeisser , Mehmet Celik, Privacy preserving error resilient dna searching through oblivious automata, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA
	Paul Bunn , Rafail Ostrovsky, Secure two-party k-means clustering, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA
	Yitao Duan , John Canny, Practical private computation of vector addition-based functions, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, August 12-15, 2007, Portland, Oregon, USA
	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 Brickell , Donald E. Porter , Vitaly Shmatikov , Emmett Witchel, Privacy-preserving remote diagnostics, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA
	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
	Stanley R. M. Oliveira , Osmar R. Zaiane, A unified framework for protecting sensitive association rules in business collaboration, International Journal of Business Intelligence and Data Mining, v.1 n.3, p.247-287, March 2006
	Michael Backes , Birgit Pfitzmann , Michael Waidner, The reactive simulatability (RSIM) framework for asynchronous systems, Information and Computation, v.205 n.12, p.1685-1720, December, 2007
	Xiaoyun He , Basit Shafiq , Jaideep Vaidya , Nabil Adam, Privacy-preserving link discovery, Proceedings of the 2008 ACM symposium on Applied computing, March 16-20, 2008, Fortaleza, Ceara, Brazil
	Florian Kerschbaum , Rafael J. Deitos, Security against the business partner, Proceedings of the 2008 ACM workshop on Secure web services, p.1-10, October 31-31, 2008, Alexandria, Virginia, USA
	Jaideep Vaidya , Chris Clifton , Murat Kantarcioglu , A. Scott Patterson, Privacy-preserving decision trees over vertically partitioned data, ACM Transactions on Knowledge Discovery from Data (TKDD), v.2 n.3, p.1-27, October 2008
	Joseph Y. Halpern, Beyond nash equilibrium: solution concepts for the 21st century, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, p.1-10, August 18-21, 2008, Toronto, Canada
	Sheng Zhong , Zhiqiang Yang, Guided perturbation: towards private and accurate mining, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.5, p.1165-1177, August 2008
	Phillip G. Bradford , Sunju Park , Michael H. Rothkopf , Heejin Park, Protocol completion incentive problems in cryptographic Vickrey auctions, Electronic Commerce Research, v.8 n.1-2, p.57-77, June 2008
	Yingpeng Sang , Hong Shen, Privacy preserving set intersection based on bilinear groups, Proceedings of the thirty-first Australasian conference on Computer science, January 01-01, 2008, Wollongong, Australia
	Jaideep Vaidya , Murat Kantarcıoğlu , Chris Clifton, Privacy-preserving Naïve Bayes classification, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.4, p.879-898, July 2008
	Chris Peikert , Brent Waters, Lossy trapdoor functions and their applications, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Fan Wu , Jiqiang Liu , Sheng Zhong, An efficient protocol for private and accurate mining of support counts, Pattern Recognition Letters, v.30 n.1, p.80-86, January, 2009
	Assaf Ben-David , Noam Nisan , Benny Pinkas, FairplayMP: a system for secure multi-party computation, Proceedings of the 15th ACM conference on Computer and communications security, October 27-31, 2008, Alexandria, Virginia, USA
	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
	Alex X. Liu , Fei Chen, Collaborative enforcement of firewall policies in virtual private networks, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, August 18-21, 2008, Toronto, Canada
	Carmit Hazay , Yehuda Lindell, Constructions of truly practical secure protocols using standardsmartcards, Proceedings of the 15th ACM conference on Computer and communications security, October 27-31, 2008, Alexandria, Virginia, USA
	Florian Kerschbaum , Andreas Schaad, Privacy-preserving social network analysis for criminal investigations, Proceedings of the 7th ACM workshop on Privacy in the electronic society, October 27-27, 2008, Alexandria, Virginia, USA
	Huijia Lin , Rafael Pass, Non-malleability amplification, Proceedings of the 41st annual ACM symposium on Theory of computing, May 31-June 02, 2009, Bethesda, MD, USA
	Philippe Golle , Frank McSherry , Ilya Mironov, Data Collection with Self-Enforcing Privacy, ACM Transactions on Information and System Security (TISSEC), v.12 n.2, p.1-24, December 2008
	Xun Yi , Yanchun Zhang, Privacy-preserving naive Bayes classification on distributed data via semi-trusted mixers, Information Systems, v.34 n.3, p.371-380, May, 2009
	Xavier Boyen, Hidden credential retrieval from a reusable password, Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, March 10-12, 2009, Sydney, Australia
	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
	Jaideep Vaidya, Privacy-preserving linear programming, Proceedings of the 2009 ACM symposium on Applied Computing, March 08-12, 2009, Honolulu, Hawaii
	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
	Yuval Ishai , Tal Malkin , Martin J. Strauss , Rebecca N. Wright, Private multiparty sampling and approximation of vector combinations, Theoretical Computer Science, v.410 n.18, p.1730-1745, April, 2009
	Kannan Srinathan , Arpita Patra , Ashish Choudhary , C. Pandu Rangan, Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary, Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, March 10-12, 2009, Sydney, Australia
	Takashi Nishide , Kazuo Ohta, Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E90-A n.5, p.960-968, May 2007
	Koji Chida , Go Yamamoto, Batch Processing for Proofs of Partial Knowledge and Its Applications, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, v.E91-A n.1, p.150-159, January 2008
	Adam J. Lee , Kazuhiro Minami , Nikita Borisov, Confidentiality-preserving distributed proofs of conjunctive queries, Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, March 10-12, 2009, Sydney, Australia
	Prahladh Harsha , Yuval Ishai , Joe Kilian , Kobbi Nissim , S. Venkatesh, Communication vs. Computation, Computational Complexity, v.16 n.1, p.1-33, May 2007
	Huijia Lin , Rafael Pass , Muthuramakrishnan Venkitasubramaniam, A unified framework for concurrent security: universal composability from stand-alone non-malleability, Proceedings of the 41st annual ACM symposium on Theory of computing, May 31-June 02, 2009, Bethesda, MD, USA
	Mike Burmester , Tri Van Le , Breno De Medeiros , Gene Tsudik, Universally Composable RFID Identification and Authentication Protocols, ACM Transactions on Information and System Security (TISSEC), v.12 n.4, p.1-33, April 2009
	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
	Alptekin Küpçü , Anna Lysyanskaya , James W. Mickens, Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters, Proceedings of the 28th ACM symposium on Principles of distributed computing, August 10-12, 2009, Calgary, AB, Canada
	Tiziano Bianchi , Alessandro Piva , Mauro Barni, On the implementation of the discrete Fourier transform in the encrypted domain, IEEE Transactions on Information Forensics and Security, v.4 n.1, p.86-97, March 2009
	Mariana Raykova , Binh Vo , Steven M. Bellovin , Tal Malkin, Secure anonymous database search, Proceedings of the 2009 ACM workshop on Cloud computing security, November 13-13, 2009, Chicago, Illinois, USA
	Li Bai , XuKai Zou, A Proactive Secret Sharing Scheme in matrix projection method, International Journal of Security and Networks, v.4 n.4, p.201-209, September 2009
	Rui Wang , XiaoFeng Wang , Zhou Li , Haixu Tang , Michael K. Reiter , Zheng Dong, Privacy-preserving genomic computation through program specialization, Proceedings of the 16th ACM conference on Computer and communications security, November 09-13, 2009, Chicago, Illinois, USA
	Mark Gondree , Payman Mohassel, Longest common subsequence as private search, Proceedings of the 8th ACM workshop on Privacy in the electronic society, November 09-09, 2009, Chicago, Illinois, USA
	Alice Bednarz , Nigel Bean , Matthew Roughan, Hiccups on the road to privacy-preserving linear programming, Proceedings of the 8th ACM workshop on Privacy in the electronic society, November 09-09, 2009, Chicago, Illinois, USA
	Thomas B. Pedersen , Erkay Savaş, Impossibility of unconditionally secure scalar products, Data & Knowledge Engineering, v.68 n.10, p.1059-1070, October, 2009
	Emmanouil Magkos , Manolis Maragoudakis , Vassilis Chrissikopoulos , Stefanos Gritzalis, Accurate and large-scale privacy-preserving data mining using the election paradigm, Data & Knowledge Engineering, v.68 n.11, p.1224-1236, November, 2009
	Florian Kerschbaum, A verifiable, centralized, coercion-free reputation system, Proceedings of the 8th ACM workshop on Privacy in the electronic society, November 09-09, 2009, Chicago, Illinois, USA
	Apu Kapadia , David Kotz , Nikos Triandopoulos, Opportunistic sensing: security challenges for the new paradigm, Proceedings of the First international conference on COMmunication Systems And NETworks, p.127-136, January 05-10, 2009, Bangalore, India
	Makoto Yokoo , Koutarou Suzuki , Katsutoshi Hirayama, Secure distributed constraint satisfaction: reaching agreement without revealing private information, Artificial Intelligence, v.161 n.1-2, p.229-245, January 2005
	Yingpeng Sang , Hong Shen, Efficient and secure protocols for privacy-preserving set operations, ACM Transactions on Information and System Security (TISSEC), v.13 n.1, p.1-35, October 2009
	Florian Kerschbaum , Andreas Schaad , Debmalya Biswas, Practical privacy-preserving protocols for criminal investigations, Proceedings of the 2009 IEEE international conference on Intelligence and security informatics, p.197-199, June 08-11, 2009, Richardson, Texas, USA
	Tingting Chen , Sheng Zhong, Privacy-preserving backpropagation neural network learning, IEEE Transactions on Neural Networks, v.20 n.10, p.1554-1564, October 2009