Forecasting run-times of secure two-party computation

Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011

Volumn , Issue , 2011, Pages 181-190

  Schroep̈fer, Axel ^a   Kerschbaum, Florian ^a  

^a SAP RESEARCH   (Germany)

Author keywords

Multi party Computation; Performance Model; Security

Indexed keywords

COMPLEXITY MEASURES; CRYPTOGRAPHIC PROTOCOLS; EMPIRICAL STUDIES; K-MEANS CLUSTERING; MULTIPARTY COMPUTATION; OPTIMAL SELECTION; PERFORMANCE MODEL; SECURE COMPUTATION; SECURE PROTOCOLS; SECURE TWO-PARTY COMPUTATIONS; SECURITY; SUPPLY CHAIN OPTIMIZATION;

COMPUTATION THEORY; CRYPTOGRAPHY; OPTIMIZATION; SUPPLY CHAINS;

FORECASTING;

EID: 80055056771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2011.33     Document Type: Conference Paper

References (31)

1. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay - a secure two-party computation system," in Proceedings of the USENIX security symposium, 2004, pp. 287-302.
2. 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, pp. 257-266.
3. Virtual Ideal Functionality Framework, "http://www.viff.sk."
4. Sharemind, "http://sharemind.cs.ut.ee/wiki/."
5. 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, ser. CCS '10. New York, NY, USA: ACM, 2010, pp. 451-462.
6. J. Bethencourt, "http://acsc.cs.utexas.edu/libpaillier/."
7. F. Kerschbaum, D. Dahlmeier, A. Schröpfer, and D. Biswas, "On the practical importance of communication complexity for secure multiparty computation protocols," in SAC, 2009, pp. 2008-2015.
8. R. Pibernik, Y. Zhang, F. Kerschbaum, and A. Schröpfer, "Secure collaborative supply chain planning and inverse optimization - the jels model," in European Journal of Operational Research, to appear, 2010.
9. P. Bunn and R. Ostrovsky, "Secure two-party k-means clustering," in Proceedings of the 14th ACM conference on Computer and communications security, ser. CCS '07. New York, NY, USA: ACM, 2007, pp. 486-497.
10. 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, 2004, pp. 103-114.
11. A. Yao, "How to generate and exchange secrets," in In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 162-167.
12. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Proceedings of EUROCRYPT, Lecture Notes in Computer Science 1592, 1999, pp. 223-238.
13. 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.
14. 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.
15. F. Kerschbaum, "Practical privacy-preserving benchmarking," in 23rd IFIP International Information Security Conference, 2008.
16. B. Pinkas, T. Schneider, N. Smart, and S. Williams, "Secure two-party computation is practical," in Advances in Cryptology ASIACRYPT 2009, ser. Lecture Notes in Computer Science, M. Matsui, Ed. Springer Berlin / Heidelberg, 2009, vol. 5912, pp. 250-267.
17. O. Catrina and C. Dragulin, "Multiparty computation of fixed-point multiplication and reciprocal," in DEXA Workshops, 2009, pp. 107-111.
18. 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, 2005, pp. 283-302.
19. A. Schröpfer, F. Kerschbaum, and G. Müller, "L1 - an intermediate language for mixed-protocol secure computation," in Proceedings of the 34th Annual IEEE International Computer Software and Applications Conference, COMPSAC, 2011.
20. R. Sion and B. Carbunar, "On the computational practicality of private information retrieval," in In Proceedings of the 14th ISOC Network and Distributed Systems Security Symposium, 2007.
21. 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, 1990, pp. 503-513.
22. 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), 1988, pp. 1-10.
23. R. Cramer, I. Damgard, and U. Maurer, "General secure multi-party computation from any linear secret sharing scheme," in Eurocrypt, 2000.
24. T. Reistad and T. Toft, "Linear, constant-rounds bit-decomposition," in ICISC, 2009, pp. 245-257.
25. F. Kerschbaum, D. Biswas, and S. de Hoogh, "Performance comparison of secure comparison protocols," 2009, pp. 133-136.
26. M. Naor and B. Pinkas, "Efficient oblivious transfer protocols," in SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2001, pp. 448-457.
27. J. Henning, "Spec cpu2000: measuring cpu performance in the new millennium," Computer, vol. 33, no. 7, pp. 28-35, 2000.
28. S. Pieper, J. Paul, and M. Schulte, "A new era of performance evaluation,"Computer, vol. 40, no. 9, pp. 23-30, sep. 2007.
29. I. Wegener, Effiziente Algorithmen für grundlegende Funktionen. Teubner, 1996.
30. M. Carbone and L. Rizzo, "Dummynet revisited," SIGCOMM Comput. Commun. Rev., vol. 40, no. 2, pp. 12-20, 2010.
31. A. K. Lenstra and E. R. Verheul, "Selecting cryptographic key sizes," J. Cryptology, vol. 14, no. 4, pp. 255-293, 2001.