Abstract
Recent compilers allow a general-purpose program (written in a conventional programming language) that handles private data to be translated into a secure distributed implementation of the corresponding functionality. The resulting program is then guaranteed to provably protect private data using secure multi-party computation techniques. The goals of such compilers are generality, usability, and efficiency, but the complete set of features of a modern programming language has not been supported to date by the existing compilers. In particular, recent compilers PICCO and the two-party ANSI C compiler strive to translate any C program into its secure multi-party implementation, but they currently lack support for pointers and dynamic memory allocation, which are important components of many C programs. In this work, we mitigate the limitation and add support for pointers to private data and consequently dynamic memory allocation to the PICCO compiler, enabling it to handle a more diverse set of programs over private data. Because doing so opens up a new design space, we investigate the use of pointers to private data (with known as well as private locations stored in them) in programs and report our findings. Aside from dynamic memory allocation, we examine other important topics associated with common pointer use such as reference by pointer/address, casting, and building various data structures in the context of secure multi-party computation. This results in enabling the compiler to automatically translate a user program that uses pointers to private data into its distributed implementation that provably protects private data throughout the computation. We empirically evaluate the constructions and report on the performance of representative programs.
- GMP—The GNU Multiple Precision Arithmetic Library. Retrieved from http://gmplib.org.Google Scholar
- Mehrdad Aliasgari, Marina Blanton, Yihua Zhang, and Aaron Steele. 2013. Secure computation on floating point numbers. In Proceedings of the Network 8 Distributed System Security Symposium (NDSS’13).Google Scholar
- Assaf Ben-David, Noam Nisan, and Benny Pinkas. 2008. FairplayMP: A system for secure multi-party computation. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’08). 257--266. Google Scholar
Digital Library
- Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A framework for fast privacy-preserving computations. In Proceedings of the European Symposium on Research in Computer Security (ESORICS’08). 192--206. Google Scholar
Digital Library
- D. Bogdanov, M. Niitsoo, T. Toft, and J. Willemson. 2012. High-performance secure multi-party computation for data mining applications. Int. J. Info. Secur. 11, 6 (2012), 403--418. Google Scholar
Digital Library
- Ivan Damgård, Martin Geisler, Mikkel Krøigaard, and Jesper Buus Nielsen. 2009. Asynchronous multiparty computation: Theory and implementation. In Public Key Cryptography (PKC’09). 160--179. Google Scholar
Digital Library
- D. Demmler, G. Dessouky, F. Koushanfar, A.-R. Sadeghi, T. Schneider, and S. Zeitouni. 2015. Automated synthesis of optimized circuits for secure computation. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’15). 1504--1517. Google Scholar
Digital Library
- D. Demmler, T. Schneider, and M. Zohner. 2015. ABY -- A framework for efficient mixed-protocol secure two-party computation. In Proceedings of the Network and Distributed System Security Symposium (NDSS’15).Google Scholar
- Wilko Henecka, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. 2010. TASTY: Tool for automating secure two-party computations. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’10). 451--462. Google Scholar
Digital Library
- Andreas Holzer, Martin Franz, Stefan Katzenbeisser, and Helmut Veith. 2012. Secure two-party computations in ANSI C. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’12). 772--783. Google Scholar
Digital Library
- Marcel Keller and Peter Scholl. 2014. Efficient, oblivious data structures for MPC. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptology (ASIACRYPT’14). 506--525.Google Scholar
Cross Ref
- A. Kiss and T. Schneider. 2016. Valiant’s universal circuit is practical. In Proceedings of the Conference on Advances in Cryptology (EUROCRYPT’16). 699--728.Google Scholar
- Benjamin Kreuter, Abhi Shelat, Benjamin Mood, and Kevin Butler. 2013. PCF: A portable circuit format for scalable two-party secure computation. In Proceedings of the USENIX Security Symposium. 321--336. Google Scholar
Digital Library
- Chang Liu, Yan Huang, Elaine Shi, Jonathan Katz, and Michael Hicks. 2014. Automating efficient RAM-model secure computation. In Proceedings of the IEEE Symposium on Security and Privacy. 623--638. Google Scholar
Digital Library
- Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, and Elaine Shi. 2015. ObliVM: A Programming framework for secure computation. In Proceedings of the IEEE Symposium on Security and Privacy. Google Scholar
Digital Library
- Dahlia Malkhi, Noam Nisan, Benny Pinkas, and Yaron Sella. 2004. Fairplay—Secure two-party computation system. In Proceedings of the USENIX Security Symposium. Google Scholar
Digital Library
- John Mitchell and Joe Zimmerman. 2014. Data-oblivious data structures. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS’14). 554--565.Google Scholar
- B. Mood, D. Gupta, H. Carter, K. Butler, and P. Traynor. 2016. Frigate: A Validated, extensible, and efficient compiler and interpreter for secure computation. In Proceedings of the IEEE European Symposium on Security and Privacy (EuroS8P’16).Google Scholar
- Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612--613. Google Scholar
Digital Library
- E. Songhori, S. Zeitouni, G. Dessouky, T. Schneider, A.-R. Sadeghi, and F. Koushanfar. 2016. GarbledCPU: A MIPS processor for secure computation in hardware. In Proceedings of the ACM Design Automation Conference (DAC’16). Google Scholar
Digital Library
- Ebrahim M. Songhori, Siam U. Hussain, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. 2015. TinyGarble: Highly compressed and scalable sequential garbled circuits. In Proceedings of the IEEE Symposium on Security and Privacy. Google Scholar
Digital Library
- Tomas Toft. 2011. Secure data structures based on multi-party computation. In Proceedings of the ACM Symposium on Priniciples of Distributed Computing (PODC’11). 291--292. Google Scholar
Digital Library
- Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Chan, Elaine Shi, Emil Stefanov, and Yan Huang. 2014. Oblivious data structures. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’14). 215--226. Google Scholar
Digital Library
- S. Zahur and D. Evans. 2013. Circuit structures for improving efficiency of security and privacy tools. In Proceedings of the IEEE Symposium on Security and Privacy. 493--507. Google Scholar
Digital Library
- Y. Zhang, M. Blanton, and G. Almashaqbeh. 2015. Implementing Support for Pointers to Private Data in a General-Purpose Secure Multi-Party Compiler. arXiv Report 1509.01763.Google Scholar
- Yihua Zhang, Aaron Steele, and Marina Blanton. 2013. PICCO: A general-purpose compiler for private distributed computation. In Proceedings of the ACM Conference on Computer and Communications Security (CCS’13). 813--826. Google Scholar
Digital Library
Index Terms
Implementing Support for Pointers to Private Data in a General-Purpose Secure Multi-Party Compiler
Recommendations
Round-Optimal Secure Multi-Party Computation
Advances in Cryptology – CRYPTO 2018AbstractSecure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should hold in the presence of a malicious adversary ...
Secure Multi-Party Computation without Agreement
It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of ...
Round-Optimal Secure Multi-party Computation
AbstractSecure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should hold in the presence of an active (i.e. malicious)...






Comments