Database contains 40 papers. Some papers are listed in multiple categories (and some listed in no category!).

## Circuit constructions & optimizations (2 papers)»

Circuits of interest to secure computation. Combinatorial aspects of circuits in general that affect their suitability for secure computation.

*A Practical Universal Circuit Construction and Secure Evaluation of Private Functions.*FC 2008 [pdf] [bibtex]

*Summary:*Constructs a universal circuit that is asymptotically suboptimal (by a log factor) but whose concrete size is smaller than Valiant's (asymptotically optimal) construction for input circuits up to several thousand gates. »

*Summary:*Construction of a "universal circuit" that takes an encoding of a circuit {$C$} and value {$x$} as input, and outputs {$C(x)$} »

## Cut-and-choose mechanisms (9 papers)»

The cut-and-choose mechanism and ways to deal with input consistency, output authenticity, selective failure, two-output functionalities, etc., against malicious adversaries.

*Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique.*Asiacrypt 2013 [pdf] [bibtex]

*Summary:*New cut-and-choose mechanism, achieving statistical security {$2^{-s}$} only {$\sim s$} garbled circuits. »

*MiniLEGO: Efficient Secure Two-Party Computation.*EUROCRYPT 2013 [pdf] [bibtex]

*A Protocol Issue for the Malicious Case of Garbled Circuit Construction.*Information Theory in the Benelux 2006 [pdf]

*Summary:*Identifies and fixes an issue related to selective failure attacks in cut-and-choose protocols. »

*Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.*CRYPTO 2013 [pdf] [bibtex]

*Summary:*Presents a cut-and-choose mechanism requiring only {$s$} garbled circuits for {$2^{-s}$} security »

*An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.*EUROCRYPT 2007 [pdf] [bibtex]

*Secure two-party computation via cut-and-choose oblivious transfer.*J Cryptology 2012 [pdf] [bibtex]

*Summary:*Efficiency improvements to the cut-and-choose method, using a new abstraction of cut-and-choose OT. »

*Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation.*CRYPTO 2013 [pdf] [bibtex]

*Two-Output Secure Computation with Malicious Adversaries.*EUROCRYPT 2011 [pdf] [bibtex]

*Fast two-party secure computation with minimal assumptions.*ACM CCS 2013 [pdf] [bibtex]

*Summary:*Achieves malicious-secure 2PC with linear overhead in the security parameter, from general assumptions »

## Garbling methods (10 papers)»

The garbling aspect of secure 2PC protocols.

*Efficient Garbling from a Fixed-Key Blockcipher.*SSP 2013 [pdf] [bibtex]

*Foundations of Garbled Circuits.*ACM CCS 2012 [pdf] [bibtex]

*Summary:*The concept of a "garbling scheme" is abstracted as a fundamental cryptographic primitive. »

*On the Security of the "Free-XOR" Technique.*TCC 2012 [pdf] [bibtex]

*Gate Evaluation Secret Sharing And Secure One-Round Two-Party Computation.*ASIACRYPT 2005 [pdf] [bibtex]

*FleXOR: Flexible garbling for XOR gates that beats free-XOR.*CRYPTO 2014 [pdf]

*Improved garbled circuit: free XOR gates and applications.*ICALP 2008 [pdf] [bibtex]

*Summary:*A method for garbling boolean circuits that allows XOR gates to be free (in garbling, communication, and evaluation costs) »

*A proof of security of Yao's protocol for two-party computation.*J Cryptology 2009 [pdf] [bibtex]

*Fairplay - Secure Two-Party Computation System.*USENIX 2004 [pdf] [bibtex]

*Secure Two-Party Computation Is Practical.*ASIACRYPT 2009 [pdf] [bibtex]

*Summary:*Describes several practical optimizations for MPC, including a new row-reduction technique »

## Implementations (2 papers)»

Implementation and analysis of secure computation protocols.

*Billion-Gate Secure Computation with Malicious Adversaries.*USENIX 2012 [pdf]

## Oblivious transfer extension (3 papers)»

Efficiently extending oblivious transfers.

*More efficient oblivious transfer and extensions for faster secure computation.*ACM CCS 2013 [pdf] [bibtex]

*Extending Oblivious Transfers Efficiently.*CRYPTO 2003 [pdf] [bibtex]

*Summary:*OT extension provides a large number of OTs using a small number of "base" OTs plus cheap symmetric-key operations. »

## Protocol paradigms (4 papers)»

Basic paradigms for secure computation

*Secure Computation with Sublinear Amortized Work.*CCS 2012 [pdf] [bibtex]

*Summary:*Presents a semi-honest-secure 2PC protocol for securely evaluating an oblivious RAM program »

*Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits.*SCN 2012 [pdf] [bibtex]

*Summary:*A new paradigm for semi-honest and covert-secure 2PC using information-theoretic garbling. »

## Reference works (3 papers)»

Textbooks, lecture notes, survey papers.

*Efficient Secure Two-Party Protocols.*Monograph, Springer Information Security and Cryptography Series 2010 [bibtex]

*Secure Multiparty Computation for Privacy-Preserving Data Mining.*eprint 2008 [pdf] [bibtex]

## Security models (5 papers)»

Security models beyond the "standard" ones of semi-honest and malicious adversaries.

*Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.*J Cryptology 2010 [pdf] [bibtex]

*Summary:*Defines a new model of "covert security" in which honest parties are guaranteed to detect cheating parties with some specified probability. »

*Calling Out Cheaters: Covert Security with Public Verifiability.*ASIACRYPT 2012 [pdf] [bibtex]

*Summary:*Augments the covert model of security so that honest parties receive

*publicly verifiable*proof of cheating. »

*Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution.*S&P 2012 [pdf] [bibtex]

*Efficiency Tradeoffs for Malicious Two-Party Computation.*PKC 2006 [pdf] [bibtex]

## Special-purpose protocols (1 papers)»

Practical protocols for specific functionalities or classes of functionalities.

- Home page
- All papers, by:
- .. category
- .. author names
- .. publication date
- .. recently added
- .. recently updated

- Glossary
- About
- Just getting started in MPC?
- Guidelines
- Todo List

Search Papers

Bibliography Categories