L1 - An intermediate language for mixed-protocol Secure Computation

Proceedings - International Computer Software and Applications Conference

Volumn , Issue , 2011, Pages 298-307

  Schröpfer, Axel ^a   Kerschbaum, Florian ^a   Müller, Günter ^b  

^a SAP RESEARCH   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Compiler; Multi party Computation

Indexed keywords

ARBITRARY FUNCTIONS; COMPILER; CRYPTOGRAPHIC PROTOCOLS; DISTRIBUTED COMPUTATIONS; EFFICIENT IMPLEMENTATION; INTERMEDIATE LANGUAGES; MULTIPARTY COMPUTATION; RUNTIMES; SECURE COMPUTATION; WEIGHTED AVERAGES;

BENCHMARKING; CRYPTOGRAPHY;

PROGRAM COMPILERS;

EID: 80054976361     PISSN: 07303157     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMPSAC.2011.46     Document Type: Conference Paper

References (34)

1. G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the k th-ranked element. In EUROCRYPT, pages 40-55, 2004.
2. M. Atallah, M. Bykova, J. Li, K. Frikken, and M. Topkara. Private collaborative forecasting and benchmarking. In Proceedings of the ACM Workshop on Privacy in an Electronic Society, pages 103-114, 2004. (Pubitemid 40821100)
3. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 503-513, 1990.
4. A. Ben-David, N. Nisan, and B. Pinkas. Fairplaymp: a system for secure multi-party computation. In CCS '08: Proceedings of the 15th ACM conference on Computer and communications security, pages 257-266, 2008.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault tolerant distributed computation. In Proc. of 20th ACM Symposium on Theory of Computing (STOC), pages 1-10, 1988.
6. P. Bogetoft, D. L. Christensen, I. Damgard, M. Geisler, T. Jakobsen, M. Kroigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft. Secure multiparty computation goes live. In 13th International Conference on Financial Cryptography and Data Security, 2009.
7. P. Bunn and R. Ostrovsky. Secure two-party k-means clustering. In Proceedings of the 14th ACM Conference on Computer and Communications Security, pages 486-497, 2007.
8. M. Carbone and L. Rizzo. Dummynet revisited. SIGCOMM Comput. Commun. Rev., 40:12-20, 2010.
9. O. Catrina and A. Saxena. Secure computation with fixed-point numbers. In Financial Cryptography and Data Security, volume 6052 of Lecture Notes in Computer Science, pages 35-50. Springer Berlin / Heidelberg, 2010.
10. R. Cramer, I. Damgard, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme. In Eurocrypt, 2000.
11. R. Cramer, I. Damgard, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science 2045, pages 280-299, 2001.
12. I. Damgard and M. Jurik. A generalisation, a simplification and some applications of pailliers probabilistic public-key system. In Proceedings of International Conference on Theory and Practice of Public-Key Cryptography, Lecture Notes in Computer Science 1992, pages 119-136, 2001. (Pubitemid 33232937)
13. I. Damgard and R. Thorbek. Efficient conversion of secret-shared values between different fields, 2008.
14. R. Deitos and F. Kerschbaum. Improving practical performance on secure and private collaborative linear programming. In DEXA Workshops, pages 122-126, 2009.
15. C. Gentry. Fully homomorphic encryption using ideal lattices. In 41st Annual ACM Symposium on Theory of Computing, 2009.
16. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikäinen. On private scalar product computation for privacy-preserving data mining. In 7th International Conference on Information Security and Cryptology, 2004.
17. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th Symposium on the Theory of Computing, pages 218-229, 1987.
18. S. Goldwasser. Multi-party computations: Past and present. In 16th ACM Symposium on Principles of Distributed Computing, 1997.
19. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Tasty: tool for automating secure two-party computations. In Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pages 451-462. ACM, 2010.
20. F. Kerschbaum. Practical privacy-preserving benchmarking. In 23rd IFIP International Information Security Conference, 2008.
21. F. Kerschbaum, D. Biswas, and S. de Hoogh. Performance comparison of secure comparison protocols. In Database and Expert Systems Application, 2009. DEXA '09. 20th International Workshop on Business Processes Security, pages 133-136, 2009.
22. F. Kerschbaum, D. Dahlmeier, A. Schröpfer, and D. Biswas. On the practical importance of communication complexity for secure multiparty computation protocols. In 24th ACM Symposium on Applied Computing, 2009.
23. E. Kiltz, G. Leander, and J. Malone-Lee. Secure computation of the mean and related statistics. In Proceedings of Theory of Cryptography Conference, Lecture Notes in Computer Science 3378, pages 283-302, 2005. (Pubitemid 41231170)
24. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Modular design of efficient secure function evaluation protocols. Cryptology ePrint Archive, Report 2010/079, 2010.
25. A. K. Lenstra and E. R. Verheul. Selecting cryptographic key sizes. J. Cryptology, 14(4):255-293, 2001. (Pubitemid 33770276)
26. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In Proceedings of the USENIX security symposium, pages 287-302, 2004.
27. J. D. Nielsen and M. I. Schwartzbach. A domain-specific programming language for secure multiparty computation. In PLAS '07: Proceedings of the 2007 workshop on Programming languages and analysis for security, pages 21-30, New York, NY, USA, 2007. ACM. (Pubitemid 350164743)
28. P. Paillier. Public-key cryptosystems based on composite degree resid-uosity classes. In Proceedings of EUROCRYPT, Lecture Notes in Computer Science 1592, pages 223-238, 1999.
29. R. Pibernik, Y. Zhang, F. Kerschbaum, and A. Schröpfer. Secure collaborative supply chain planning and inverse optimization - the jels model. European Journal of Operational Research, 208(1):75-85, 2011.
30. A. Shamir. How to share a secret. In Communications of the ACM, 22(11), pages 612-613, 1979.
31. Sharemind. http://sharemind.cs.ut.ee/wiki/, 2010.
32. T. Toft. Primitives and Applications for Multi-party Computation. PhD thesis, Department of Computer Science, University of Aarhus, 2007.
33. Virtual Ideal Functionality Framework. http://www.viff.sk, 2010.
34. A. Yao. How to generate and exchange secrets. In In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.