- Multiparty unconditionally secure protocols (D. Chaum, C. Cr�peau, and I. Damgaard, STOC 1988)
- Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Tal Rabin, Michael Ben-Or, STOC 1989)
- How to solve any protocol problem (Goldreich, Micali, Wigderson, 1986)
- Completeness theorems for non-cryptographic fault-tolerant distributed computation (Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, STOC 1988)
-
1992
- Communication Complexity of Secure Computation (Matthew Franklin, Moti Yung, 1992)
-
1995
- Adaptively Secure Multi-party Computation (Ran Canetti, Uri Feige, Oded Goldreich, Moni Naor, 1995)
- Committed Oblivious Transfer and Private Multi-Party Computations (C. Cr�peau, J. van de Graaf, and A. Tapp, Crypto 95)
-
1996
- Incoercible Multiparty Computations (Canetti, Gennaro, 1996)
- Joint Encryption and Message-Efficient Secure Computation (Matthew Franklin and Stuart Haber, JoC 1996)
-
1997
- Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Martin Hirt, Ueli Maurer, 1997)
-
1998
- Multiparty computation unconditionally secure against Q2 adversary structures (Adam Smith, Anton Stiglic, 1998)
- Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography (Rosario Gennaro, Michael O. Rabin, Tal Rabin, PODC 1998)
- Trading Correctness for Privacy in Unconditional Multi-Party Computation (Matthias Fitzi, Martin Hirt, Ueli Maurer, 1998)
-
1999
- Secure Computation with Honest-Looking Parties: What if nobody is truly honest? (Ran Canetti, Rafail Ostrovsky, 1999)
- Efficient Multiparty Computations Secure Against an Adaptive Adversary (Ronald Cramer, Ivan Damg�rd, Stefan Dziembowski, Martin Hirt, Tal Rabin, 1999)
- Player Elimination: How to make Cheating Harmless in Multi-Party Computation (Martin Hirt, Ueli Maurer, Bartosz Przydatek, 1999)
-
2000
- Player Simulation and General Adversary Structures in Perfect Multiparty Computation (Martin Hirt, Ueli Maurer, Journal of Cryptology, 2000)
- Efficient General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme (R. Cramer, I. Damg�rd and U. Maurer, Eurocrypt 2000)
- Mix and Match: Secure Function Evaluation via Ciphertexts (Markus Jakobsson, Ari Juels, 2000)
- Multiparty Computation from Threshold Homomorphic Encryption ( Ronald Cramer, Ivan Damgard, Jesper Buus Nielsen, 2000)
- Efficient Secure Multi-Party Computation (Martin Hirt, Ueli Maurer, Bartosz Przydatek, 2000)
- Parallel Reducibility for Information-Theoretically Secure Computation (Yevgeniy Dodis, Silvio Micali, CRYPTO 2000)
- General Secure Multi-Party Computation from any Linear Secret Sharing Scheme (Ronald Cramer and Ivan Damg�rd and Ueli Maurer, eprint 2000/037)
- On the Complexity of Verifiable Secret Sharing and Multi-Party Computation (Ronald Cramer and Ivan Damg�rd and Stefan Dziembowski, eprint 2000/038)
- Optimistic Fair Secure Computation (Christian Cachin, Jan Camenisch, CRYPTO 2000)
-
2001
- On adaptive vs. non-adaptive security of multiparty protocols (Ran Canetti and Ivan Damgard and Stefan Dziembowski and Yuval Ishai and Tal Malkin, eprint 2001/017)
- Robustness for Free in Unconditional Multi-Party Computation (Martin Hirt and Ueli Maurer, eprint 2001/023)
- Secure Multiparty Computation of Approximations ( Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright, ICALP 2001)
- Minimal Complete Primitives for Secure Multi-party Computation (Matthias Fitzi, Juan A. Garay, Ueli Maurer, and Rafail Ostrovsky, CRYPTO 2001)
- Secure Distributed Linear Algebra in a Constant Number of Rounds (Ronald Cramer and Ivan Damg�rd, CRYPTO 2001)
- Secure Multi-party Quantum Computation (Claude Cr�peau, Daniel Gottesman, Adam Smith, STOC 2002)
- Secure Multi-Party Computational Geometry (Mikhail J. Atallah, Wenliang Du, 2001)
- Communication Preserving Protocols for Secure Function Evaluation (Naor, Nissim, STOC 2001)
-
2002
- Universally Composable Two-Party and Multi-Party Secure Computation (Ran Canetti and Yehuda Lindell and Rafail Ostrovsky and Amit Sahai, eprint 2002/140 (Also STOC 2002))
-
2003
- General Composition and Universal Composability in Secure Multi-Party Computation (Yehuda Lindell, FOCS 2003)
- Protocols for Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions (Yehuda Lindell, eprint 2003/100)
-
2004
- Lower Bounds for Concurrent Self Composition (Yehuda Lindell, TCC 2004)
-
2005
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator (Ivan Damg�rd, Yuval Ishai, eprint 2005/262 & Crypto 2005)
- How To Play Almost Any Mental Game Over The Net --- Concurrent Composition via Super-Polynomial Simulation (Boaz Barak, Amit Sahai, ECCC TR05-096)
-
2010
- [scholar]Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Ivan Damg�rd and Yuval Ishai and Mikkel Kr�igaard, Eurocrypt 2010)
-
2012
- [scholar]Multiparty Computation Secure Against Continual Memory Leakage (Elette Boyle, Shafi Goldwasser, Abhishek Jain, Yael Tauman Kalai, STOC 2012)
- [scholar]On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption (Adriana Lopez-Alt, Eran Tromer, Vinod Vaikuntanathan, STOC 2012)
- [scholar]Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE (Gilad Asharov, Abhishek Jain, Adriana Lopez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs, Eurocrypt 2012)
![[scholar]](https://web.archive.org/web/20140512222113im_/http://www.cs.ut.ee/~lipmaa/crypto/pics/rismall.gif){kind=small}
]
- [scholar]Protocols for secure computations (Andrew C-C Yao, FOCS 1982)
- The All-or-Nothing Nature of Two-Party Secure Computation ( Amos Beimel, Tal Malkin, Silvio Micali, 1999)
- Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation (Yehuda Lindell, CRYPTO 2001)
- Communication Complexity and Secure Function Evaluation (Moni Naor, Kobbi Nissim, ECCC TR01-062)
- On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions (Ran Canetti, Eyal Kushilevitz and Yehuda Lindell, Eurocrypt 2003)
- Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions (Yehuda Lindell, STOC 2003)
- Brief Announcement: Impossibility Results for Concurrent Secure Two-Party Computation (Yehuda Lindell, PODC 2003)
- Round-optimal secure two-party computation (Jonathan Katz, Rafail Ostrovsky, Crypto 2004)
![[Cool]](https://web.archive.org/web/20140512222113im_/http://www.cs.ut.ee/~lipmaa/gifs/cool.gif)
- Secure Computation of Constant Depth Circuits with Applications to Database Search Problems (Omer Barkol, Yuval Ishai, Crypto 2005)
- Revisiting the Efficiency of Malicious Two-Party Computation (David P. Woodruff, eprint 2006/397)
- Non-Interactive Proofs for Integer Multiplication (Ivan Damgard and Rune Thorbek, eprint 2007/086)
- [scholar]On the Security of the "Free-XOR" Technique (Seung Geol Choi and Jonathan Katz and Ranjit Kumaresan and Hong-Sheng Zhou, TCC 2012)
- [scholar]Secure Two-Party Computation with Low Communication (Ivan Damg�rd and Sebastian Faust and Carmit Hazay, TCC 2012)
- [scholar]How to Garble Arithmetic Circuits (Benny Applebaum and Yuval Ishai and Eyal Kushilevitz, FOCS 2011)
- Studies in Secure Multiparty Computation and Applications (Ran Canetti, 1996)
- A Study of Secure Database Access and General Two-Party Computation (Tal Malkin, MIT 2000)
- Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting (Martin Hirt, ETHZ, 2001)
- On the Composition of Secure Multi-Party Protocols (Yehuda Lindell, Weizmann, 2002)
- Secure Multi-Party Computation (Oded Goldreich, 2000 (working draft))
- Lecture Notes on Multiparty Computation (Cramer, Damg�rd (2002))
- Multi party computations: past and present (Shafi Goldwasser, STOC 1997)
- Composition of Secure Multi-Party Protocols ( A Comprehensive Study)
]
- Non-Interactive CryptoComputing For $NC^1$ (Tomas Sander, Adam Young, Moti Yung, FOCS 99)
- Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation (Yuval Ishai, Eyal Kushilevitz, 2000)
- One-Round Secure Computation and Secure Autonomous Mobile Agents (Christian Cachin, Jan Camenisch, Joe Kilian, Joy M�ller, 2000)
- CryptoComputing with rationals (Pierre-Alain Fouque, Jacques Stern, Geert-Jan Wackers, FC 2002)
gmail.com