Garbling methods

The garbling aspect of secure 2PC protocols.

Category contains 10 papers:

[BHKR13] Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, Phillip Rogaway. Efficient Garbling from a Fixed-Key Blockcipher. SSP 2013 [pdf] [bibtex]

Summary: Achieves very fast circuit garbling by leveraging hardware AES instruction set »

[BHR12] Mihir Bellare, Viet Tung Hoang, Phillip Rogaway. Foundations of Garbled Circuits. ACM CCS 2012 [pdf] [bibtex]

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

[CKKZ12] Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou. On the Security of the "Free-XOR" Technique. TCC 2012 [pdf] [bibtex]

Summary: Precisely identifies the security assumption needed for the free-XOR optimization »

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

Summary: no summary yet »

[KMR14] Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek. FleXOR: Flexible garbling for XOR gates that beats free-XOR. CRYPTO 2014 [pdf]

Summary: Introduces a garbling scheme FleXOR which offers some improvements over free-XOR »

[KS08] Vladimir Kolesnikov, Thomas Schneider. 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) »

[LP09] Yehuda Lindell, Benny Pinkas. A proof of security of Yao's protocol for two-party computation. J Cryptology 2009 [pdf] [bibtex]

Summary: A formal description and security proof of Yao's 2PC protocol »

[MNPS04] Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella. Fairplay - Secure Two-Party Computation System. USENIX 2004 [pdf] [bibtex]

Summary: First implementation of 2PC. Introduces Point and Permute »

[PSSW09] Benny Pinkas, Thomas Schneider, Nigel P. Smart, Stephen C. Williams. Secure Two-Party Computation Is Practical. ASIACRYPT 2009 [pdf] [bibtex]

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

[Y86] Andrew Yao. How to generate and exchange secrets. FOCS 1986 [pdf] [bibtex]

Summary: The paper credited with garbled circuits »