On the practical importance of communication complexity for secure multi-party computation protocols

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 2008-2015

  Kerschbaum, Florian ^a   Dahlmeier, Daniel ^a   Schröpfer, Axel ^a   Biswas, Debmalya ^b  

^a SAP RESEARCH   (Germany)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Experimentation; Performance measurement; Secure multi party computation; Synchronization

Indexed keywords

COMMUNICATION COMPLEXITY; EXPERIMENTAL STUDIES; PERFORMANCE MEASUREMENT; PERFORMANCE MEASUREMENTS; PRACTICAL IMPORTANCE; REAL-WORLD; REALISTIC CONDITIONS; SECURE MULTI-PARTY COMPUTATION; SPECIFIC PROTOCOL;

COMPUTER SCIENCE; NETWORK PERFORMANCE; NETWORK SECURITY; SYSTEMS ENGINEERING;

NETWORK PROTOCOLS;

EID: 72949089461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529730     Document Type: Conference Paper

References (27)

1. M. Atallah, M. Bykova, J. Li, K. Frikken, and M. Topkara. Private Collaborative Forecasting and Benchmarking. Proceedings of the ACM Workshop on Privacy in an Electronic Society, 2004.
2. J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM symposium on theory of computing, 1988.
4. P. Bogetoft, D. Christensen, I. Damgard, M. Geisler, T. Jakobsen, M. Kroigaard, J. Nielsen, J. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach and T. Toft. Multiparty Computation Goes Live. Available at http://eprint.iacr.org/ 2008/068, 2008.
5. P. Bogetoft, I. Damgard, T. Jakobsen, K. Nielsen, J. Pagter, and T. Toft. A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. Proceedings of Financial Cryptography, 2006.
6. J. Brickell, D. Porter, V. Shmatikov, E. Witchel. Privacy-Preserving Remote Diagnostics. Proceedings of the 14th ACM Conference on Computer and Communications Security, 2007.
7. I. Damgard, and M. Jurik. A Generalisation, a Simplification and some Applications of Pailliers Probabilistic Public-Key System. Proceedings of International Conference on Theory and Practice of Public-Key Cryptography, 2001.
8. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM 28(6), 1985.
9. J. Feigenbaum, B. Pinkas, R. Ryger, and F. Saint-Jean. Secure Computation of Surveys. Proceedings of the EU Workshop on Secure Multiparty Protocols, 2004. Available at http://www.cs.yale.edu/homes/jf/SMP2004. pdf.
10. O. Goldreich. Secure Multi-party Computation. Available at www.wisdom.weizmann.ac.il/~oded/pp.html, 2002.
11. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. Proceedings of the 19th ACM conference on theory of computing, 1987.
12. S. Goldwasser. Multi party computations: past and present. Proceedings of the 16th ACM symposium on principles of distributed computing, 1997.
13. S. Jha, L. Kruger, and V. Shmatikov. Towards Practical Privacy for Genomic Computation. Proceedings of the IEEE Symposium on Security and Privacy, 2008.
14. F. Kerschbaum. Practical Privacy-Preserving Benchmarking. Proceedings of the 23rd IFIP International Information Security Conference, 2008.
15. F. Kerschbaum, and O. Terzidis. Filtering for Private Collaborative Benchmarking. Proceedings of the International Conference on Emerging Trends in Information and Communication Security, 2006.
16. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
17. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - A Secure Two-party Computation System. Proceedings of the USENIX security symposium, 2004.
18. D. Naccache, and J. Stern. A New Public-Key Cryptosystem Based on Higher Residues. Proceedings of the ACM Conference on Computer and Communications Security, 1998.
19. M. Naor, and B. Pinkas. Efficient Oblivious Transfer Protocols. Proceedings of the symposium on data structures and algorithms, 2001.
20. M. Naor, B. Pinkas and R. Sumner. Privacy Preserving Auctions and Mechanism Design. Proceedings of the 1st ACM Conference on Electronic Commerce, 1999.
21. T. Okamoto, and S. Uchiyama. A new public-key cryptosystem as secure as factoring. Proceedings of EUROCRYPT, 1998.
22. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proceedings of EUROCRYPT, 1999.
23. M. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, 1981.
24. L. Rizzo. Dummynet: a simple approach to the evaluation of network protocols. ACM Computer Communication Review 27(1), 1997.
25. A. Shamir. How to share a secret. Communications of the ACM 22(11), 1979.
26. R. Sion, B. Carbunar. On the Computational Practicality of Private Information Retrieval. em Proceedings of the Network and Distributed System Security Symposium, 2007.
27. A. Yao. Protocols for Secure Computations. Proceedings of the IEEE Symposium on foundations of computer science 23, 1982.