Andreas Holzer
ABSTRACT
The problem of secure two-party computation has received great attention in the years that followed its introduction by Yao. The solutions proposed follow one of the two research directions of either using homomorphic encryption techniques or implementing Yao's "Garbled Circuit" solution. The latter requires circuits to implement a given functionality. Recently, the compiler CBMC-GC was introduced, the first compiler capable of translating programs written in a general purpose language (ANSI-C) into circuits suitable for secure two-party computation. In this paper, we discuss the current limitations of CBMC-GC and propose directions for future research.
- K. Hamacher S. Jha S. Katzenbeisser H. Schroder B. Deiseroth, M. Franz. Secure Computations on Non-Integer Values. In IEEE Workshop on Information Forensics and Security (WIFS'10), pages 1--6. IEEE Press, 2010.Google Scholar
- Assaf Ben-David, Noam Nisan, and Benny Pinkas. FairplayMP: a system for secure multi-party computation. In Peng Ning, Paul F. Syverson, and Somesh Jha, editors, ACM Conference on Computer and Communications Security, pages 257--266. ACM, 2008. Google ScholarDigital Library
- Peter Bogetoft, Ivan Damgard, Thomas P. Jakobsen, Kurt Nielsen, Jakob Pagter, and Tomas Toft. A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In Giovanni Di Crescenzo and Aviel D. Rubin, editors, Financial Cryptography, volume 4107 of Lecture Notes in Computer Science, pages 142--147. Springer, 2006. Google ScholarDigital Library
- Elette Boyle, Shafl Goldwasser, Abhishek Jain, and Yael Tauman Kalai. Multiparty Computation Secure Against Continual Memory Leakage. In Howard J. Karloff and Toniann Pitassi, editors, STOC, pages 1235--1254. ACM, 2012. Google ScholarDigital Library
- Wilko Henecka, Stefan Kogl, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. TASTY: Tool for Automating Secure Two-partY computations. In Ehab Al-Shaer, Angelos D. Keromytis, and Vitaly Shmatikov, editors, ACM Conference on Computer and Communications Security, pages 451--462. ACM, 2010. Google ScholarDigital Library
- Andreas Holzer, Martin Franz, Stefan Katzenbeisser, and Helmut Veith. Secure Two-Party Computations in ANSI C. In Ting Yu, George Danezis, and Virgil D. Gligor, editors, ACM Conference on Computer and Communications Security, pages 772--783. ACM, 2012. Google ScholarDigital Library
- Yan Huang, David Evans, Jonathan Katz, and Lior Malka. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium. USENIX Association, 2011. Google ScholarDigital Library
- Stanislaw Jarecki and Vitaly Shmatikov. Efficient Two-Party Secure Computation on Committed Inputs. In Moni Naor, editor, EUROCRYPT, volume 4515 of Lecture Notes in Computer Science, pages 97--114. Springer, 2007. Google ScholarDigital Library
- Jonathan Katz and Rafail Ostrovsky. Round-Optimal Secure Two-Party Computation. In Matthew K. Franklin, editor, CRYPTO, volume 3152 of Lecture Notes in Computer Science, pages 335--354. Springer, 2004.Google Scholar
- Chris Lattner and Vikram S. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In 2nd IEEE / ACM International Symposium on Code Generation and Optimization (CGO 2004), 20--24 March 2004, San Jose, CA, USA, pages 75--88. IEEE Computer Society, 2004. Google ScholarDigital Library
- Yehuda Lindell and Benny Pinkas. Secure Multiparty Computation for Privacy-Preserving Data Mining. IACR Cryptology ePrint Archive, 2008:197, 2008.Google Scholar
- Yehuda Lindell and Benny Pinkas. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. J. Cryptology, 25(4):680--722, 2012.Google ScholarDigital Library
- Y. Zhang M. Aliasgari, M. Blanton and A. Steele. Secure Computation on Floating Point Numbers. In Network and Distributed System Security Symposium (NDSS'13), February 2013.Google Scholar
- Lior Malka. VMCrypt: modular software architecture for scalable secure computation. In Yan Chen, George Danezis, and Vitaly Shmatikov, editors, ACM Conference on Computer and Communications Security, pages 715--724. ACM, 2011. Google ScholarDigital Library
- Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. Fairplay - Secure Two-Party Computation System. In USENIX Security Symposium, pages 287--302. USENIX, 2004. Google ScholarDigital Library
- Benny Pinkas, Thomas Schneider, Nigel P. Smart, and Stephen C. Williams. Secure Two-Party Computation Is Practical. In Mitsuru Matsui, editor, ASIACRYPT, volume 5912 of Lecture Notes in Computer Science, pages 250--267. Springer, 2009. Google ScholarDigital Library
- Andrew Chi-Chih Yao. Protocols for Secure Computations (Extended Abstract). In FOCS, pages 160--164. IEEE Computer Society, 1982.Google Scholar
Index Terms
- Challenges in compiler construction for secure two-party computation
Recommendations
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secure in the presence of semi-honest adversaries, and can be transformed into a protocol ...
On the Power of Secure Two-Party Computation
Proceedings, Part II, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9815Ishai, Kushilevitz, Ostrovsky and Sahai STOC 2007, SIAM JoC 2009 introduced the powerful "MPC-in-the-head" technique that provided a general transformation of information-theoretic MPC protocols secure against passive adversaries to a ZK proof in a "...
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Protocols for secure two-party computation enable a pair of parties to compute a function of their inputs while preserving security properties such as privacy, correctness and independence of inputs. Recently, a number of protocols have been proposed ...
Comments