PICCO: A general-purpose compiler for private distributed computation

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 813-825

  Zhang, Yihua ^a   Steele, Aaron ^a   Blanton, Marina ^a  

^a University of Notre Dame   (United States)

Author keywords

compiler; general purpose computation; linear secret sharing; parallel execution; secure computation outsourcing; secure multi party computation; source to source translator

Indexed keywords

COMPILER; GENERAL-PURPOSE COMPUTATIONS; PARALLEL EXECUTIONS; SECRET SHARING; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; SOURCE-TO-SOURCE TRANSLATORS;

C (PROGRAMMING LANGUAGE); COMPUTATION THEORY; CRYPTOGRAPHY; PROGRAM COMPILERS;

SECURITY OF DATA;

EID: 84889039708     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508859.2516752     Document Type: Conference Paper

References (38)

1. Bison - GNU parser generator. http://www.gnu.org/software/bison.
2. Boost C++ libraries. http://www.boost.org.
3. flex: The Fast Lexical Analyzer. http://flex.sourceforge.net.
4. GENI: Global environment for network innovations. http://www.geni.net.
5. GMP - The GNU Multiple Precision Arithmetic Library. http://gmplib.org.
6. OpenSSL: The open source toolkit for SSL/TLS. http://www.openssl.org.
7. M. Aliasgari, M. Blanton, Y. Zhang, and A. Steele. Secure computation on floating point numbers. In NDSS, 2013.
8. A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP: A system for secure multi-party computation. In CCS, 2008.
9. M. Blanton. Empirical evaluation of secure two-party computation models. Technical Report TR 2005-58, CERIAS, Purdue University, 2005.
10. D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In ESORICS, pages 192-206, 2008.
11. D. Bogdanov, M. Niitsoo, T. Toft, and J. Willemson. High-performance secure multi-party computation for data mining applications. IJIS, 11(6):403-418, 2012.
12. J. Boyar and R. Peralta. A new combinational logic minimization technique with applications to cryptology. In Symposium on Experimental Algorithms, 2010.
13. J. Boyar and R. Peralta. A small depth-16 circuit for the AES S-box. In Information Security and Privacy Research, pages 287-298, 2012.
14. M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos. SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics. In USENIX Security Symposium, pages 223-240, 2010.
15. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
16. O. Catrina and S. de Hoogh. Improved primitives for secure multiparty integer computation. In Security and Cryptography for Networks (SCN), pages 182-199, 2010.
17. O. Catrina and A. Saxena. Secure computation with fixed-point numbers. In FC, pages 35-50, 2010.
18. R. Cramer, I. Damgård, and Y. Ishai. Share conversion, pseudorandom secret-sharing and applications to secure computation. In TCC, pages 342-362, 2005.
19. I. Damgård, M. Geisler, and M. Krøigård. Asynchronous multiparty computation: Theory and implementation. In PKC, pages 160-179, 2009.
20. I. Damgård and M. Keller. Secure multiparty AES. In FC, pages 367-374, 2010.
21. I. Damgård, M. Keller, E. Larraia, C. Miles, and N. Smart. Implementing AES via an actively/covertly secure dishonest-majority MPC protocol. IACR Cryptology ePrint Archive Report 2012/262, 2012.
22. I. Damgård and J. Nielsen. Scalable and unconditionally secure multiparty computation. In CRYPTO, 2007.
23. V. Dimakopoulos, E. Leontiadis, and G. Tzoumas. A portable C compiler for OpenMP V.2.0. In European Workshop on OpenMP (EWOMP), pages 5-11, 2003.
24. M. Frigo, C. Leiserson, and K. Randall. The implementation of the Cilk-5 multithreaded language. In PLDI, pages 212-223, 1998.
25. M. Geisler. Cryptographic protocols: Theory and implementation. PhD thesis, Aarhus University, 2010.
26. R. Gennaro, M. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In PODC, pages 101-111, 1998.
27. O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In STOC, 1987.
28. W. Henecka, S. Kogl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. TASTY: Tool for Automating Secure Two-partY computations. In CCS, pages 451-462, 2010.
29. A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith. Secure two-party computations in ANSI C. In CCS, 2012.
30. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium, 2011.
31. R. Jagomägis. SecreC: A privacy-aware programming language with applications in data mining. Master's thesis, University of Tartu, 2010.
32. F. Kerschbaum. Automatically optimizing secure computation. In CCS, pages 703-714, 2011.
33. J. Launchbury, I. Diatchki, T. DuBuisson, and A. Adams-Moran. Efficient lookup-table protocol in secure multiparty computation. In ICFP, pages 189-200, 2012.
34. S. Laur, R. Talviste, and J. Willemson. From oblivious AES to efficient and secure database join in the multiparty setting. In ACNS, pages 84-101, 2013.
35. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In USENIX Security Symposium, pages 287-302, 2004.
36. B. Pinkas, T. Schneider, N. Smart, and S. Williams. Secure two-party computation is practical. In ASIACRYPT, 2009.
37. A. Schroepfer, F. Kerschbaum, and G. Mueller. L1 - An intermediate language for mixed-protocol secure computation. In COMPSAC, pages 298-307, 2011.
38. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.