Expression rewriting for optimizing secure computation

CODASPY 2013 - Proceedings of the 3rd ACM Conference on Data and Application Security and Privacy

Volumn , Issue , 2013, Pages 49-58

  Kerschbaum, Florian ^a  

^a SAP RESEARCH   (Germany)

Author keywords

Optimization; Programming; Secure two party computation

Indexed keywords

AUTOMATIC COMPILER OPTIMIZATION; COLLABORATIVE APPLICATION; OPTIMAL PERFORMANCE; PERFORMANCE GAIN; POOR EFFICIENCIES; SECURE COMPUTATION; SECURE TWO-PARTY COMPUTATIONS;

COMPUTATION THEORY; CRYPTOGRAPHY; MATHEMATICAL PROGRAMMING; PROGRAM COMPILERS;

OPTIMIZATION;

EID: 84874925035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2435349.2435356     Document Type: Conference Paper

References (39)

1. J. B. Almeida, E. Bangerter, M. Barbosa, S. Krenn, A.-R. Sadeghi, and T. Schneider. A certifying compiler for zero-knowledge proofs of knowledge based on σ-protocols. In ESORICS'10: Proceedings of the 15th European Conference on Research in Computer Security, 2010.
2. M. Backes, M. Maffei, and K. Pecina. Automated synthesis of privacy-preserving distributed applications. In NDSS'12: Proceedings of the 19th Annual Network and Distributed System Security Symposium, 2012.
3. A. Banerjee. A joint economic lot-size model for purchaser and vendor. Decision Sciences, 17(3), 1986.
4. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In STOC'90: Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990.
5. 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, 2008.
6. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC'88: Proceedings of the 20th ACM Symposium on Theory of Computing, 1988.
7. D. Bogdanov, S. Laur, and J. Willemson. Sharemind: a framework for fast privacy-preserving computations. In ESORICS'08: Proceedings of the 13th European Symposium on Research in Computer Security, 2008.
8. D. Bogdanov, R. Talviste, and J. Willemson. Deploying secure multi-party computation for financial data analysis. In FC'12: Proceedings of the 16th International Conference on Financial Cryptography and Data Security, 2012.
9. P. Bogetoft, D. L. Christensen, I. Damgård, M. Geisler, T. P. Jakobsen, M. Kroigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. I. Schwartzbach, and T. Toft. Secure multiparty computation goes live. In FC'09: Proceedings of the 13th International Conference on Financial Cryptography and Data Security, 2009.
10. O. Catrina and A. Saxena. Secure computation with fixed-point numbers. In FC'10: Proceedings of the 14th International Conference on Financial Cryptography and Data Security, 2010.
11. J. Cocke. Global common subexpression elimination. SIGPLAN Notices, 5, 1970.
12. R. Cramer, I. Damgård, and U. Maurer. Efficient general secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT'00: Proceedings of the 19th European Cryptology Conference, 2000.
13. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94: Proceedings of the 14th International Cryptology Conference, 1994.
14. I. Damgård, M. Geisler, M. Kroigaard, and J. B. Nielsen. Asynchronous multiparty computation: theory and implementation. In PKC'09: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography, 2009.
15. L. Devroye. Branching processes in the analysis of the heights of trees. Acta Informatica, 24, 1987.
16. O. Goldreich. Foundations of Cryptography, volume 2. Cambridge University Press, 2004.
17. S. Goldwasser. Multi-party computations: past and present. In PODC'97: Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, 1997.
18. J. Groth and A. Sahai. Efficient non-interactive proof systems for bilinear groups. In EUROCRYPT'08: Proceedings of the 27th European Cryptology Conference, 2008.
19. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Tasty: tool for automating secure two-party computations. In CCS'10: Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010.
20. Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols? In Proceedings of the 19th Network and Distributed Security Symposium, 2012.
21. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. In Proceedings of the 20th USENIX Security Symposium, 2011.
22. R. Jagomägis. Secrec: a privacy-aware programming language with applications in data mining. Master's thesis, University of Tartu, 2010.
23. M. Jensen and F. Kerschbaum. Towards privacy-preserving xml transformation. In ICWS'11: Proceedings of the 9th IEEE International Conference on Web Services, 2011.
24. F. Kerschbaum. Automatically optimizing secure computation. In CCS'11: Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011.
25. F. Kerschbaum. A type-system for mixed protocol secure computation. Unpublished manuscript, 2012.
26. F. Kerschbaum, D. Dahlmeier, A. Schröpfer, and D. Biswas. On the practical importance of communication complexity for secure multi-party computation protocols. In SAC'09: Proceedings of the 24th ACM Symposium on Applied Computing, 2009.
27. F. Kerschbaum, A. Schröpfer, A. Zilli, R. Pibernik, O. Catrina, S. de Hoogh, B. Schoenmakers, S. Cimato, and E. Damiani. Secure collaborative supply chain management. IEEE Computer, 44(9), 2011.
28. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Modular design of efficient secure function evaluation protocols. Technical Report Report 2010/079, Cryptology ePrint Archive, 2010.
29. V. Kolesnikov and T. Schneider. Improved garbled circuit: free xor gates and applications. In ICALP'08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part II, 2008.
30. Y. Lindell and B. Pinkas. A proof of security of yao's protocol for two-party computation. Journal of Cryptology, 22(2), 2009.
31. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay-a secure two-party computation system. In Proceedings of the 13th USENIX Security Symposium, 2004.
32. S. Meiklejohn, C. C. Erway, A. Küpçü, T. Hinkle, and A. Lysyanskaya. Zkpdl: A language-based system for efficient zero-knowledge proofs and electronic cash. In Proceedings of the 19th USENIX Security Symposium, 2010.
33. J. D. Nielsen and M. I. Schwartzbach. A domain-specific programming language for secure multiparty computation. In PLAS'07: Proceedings of the ACM Workshop on Programming Languages and Analysis for Security, 2007.
34. J. A. Painter. Effectiveness of an optimizing compiler for arithmetic expressions. SIGPLAN Notices, 5, 1970.
35. 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), 2011.
36. A. Schröpfer and F. Kerschbaum. Demo: secure computation in javascript. In CCS'11: Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011.
37. A. Schröpfer and F. Kerschbaum. Forecasting run-times of secure two-party computation. In QEST'11: Proceedings of the 8th International Conference on Quantitative Evaluation of Systems, 2011.
38. A. Schröpfer, F. Kerschbaum, and G. Müller. L1 - an intermediate language for mixed-protocol secure computation. In COMPSAC'11: Proceedings of the 35th IEEE Computer Software and Applications Conference, 2011.
39. A. C. Yao. Protocols for secure computations. In FOCS'82: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.