{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:21Z","timestamp":1750307661464,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,8]],"date-time":"2009-03-08T00:00:00Z","timestamp":1236470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,8]]},"DOI":"10.1145\/1529282.1529730","type":"proceedings-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:11Z","timestamp":1239802631000},"page":"2008-2015","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["On the practical importance of communication complexity for secure multi-party computation protocols"],"prefix":"10.1145","author":[{"given":"Florian","family":"Kerschbaum","sequence":"first","affiliation":[{"name":"SAP Research, Karlsruhe, Germany"}]},{"given":"Daniel","family":"Dahlmeier","sequence":"additional","affiliation":[{"name":"SAP Research, Karlsruhe, Germany"}]},{"given":"Axel","family":"Schr\u00f6pfer","sequence":"additional","affiliation":[{"name":"SAP Research, Karlsruhe, Germany"}]},{"given":"Debmalya","family":"Biswas","sequence":"additional","affiliation":[{"name":"IRISA\/INRIA, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2009,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029204"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_4_1","volume-title":"Multiparty Computation Goes Live.","author":"Bogetoft P.","year":"2008","unstructured":"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 . 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."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of International Conference on Theory and Practice of Public-Key Cryptography","author":"Damgard I.","year":"2001","unstructured":"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 . 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."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the EU Workshop on Secure Multiparty Protocols, 2004","author":"Feigenbaum J.","year":"2004","unstructured":"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\/SMP 2004 .pdf. 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."},{"key":"e_1_3_2_1_10_1","volume-title":"Secure Multi-party Computation.","author":"Goldreich O.","year":"2002","unstructured":"O. Goldreich . Secure Multi-party Computation. Available at www.wisdom.weizmann.ac.il\/~oded\/pp.html, 2002 . O. Goldreich. Secure Multi-party Computation. Available at www.wisdom.weizmann.ac.il\/~oded\/pp.html, 2002."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259405"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.34"},{"key":"e_1_3_2_1_14_1","volume-title":"Practical Privacy-Preserving Benchmarking. Proceedings of the 23rd IFIP International Information Security Conference","author":"Kerschbaum F.","year":"2008","unstructured":"F. Kerschbaum . Practical Privacy-Preserving Benchmarking. Proceedings of the 23rd IFIP International Information Security Conference , 2008 . F. Kerschbaum. Practical Privacy-Preserving Benchmarking. Proceedings of the 23rd IFIP International Information Security Conference, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11766155_29"},{"key":"e_1_3_2_1_16_1","volume-title":"Distributed Algorithms","author":"Lynch N.","year":"1996","unstructured":"N. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers , 1996 . N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the USENIX security symposium","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay - A Secure Two-party Computation System . Proceedings of the USENIX security symposium , 2004 . D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - A Secure Two-party Computation System. Proceedings of the USENIX security symposium, 2004."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288106"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the symposium on data structures and algorithms","author":"Naor M.","year":"2001","unstructured":"M. Naor , and B. Pinkas . Efficient Oblivious Transfer Protocols . Proceedings of the symposium on data structures and algorithms , 2001 . M. Naor, and B. Pinkas. Efficient Oblivious Transfer Protocols. Proceedings of the symposium on data structures and algorithms, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054135"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_3_2_1_23_1","volume-title":"Aiken Computation Laboratory","author":"Rabin M.","year":"1981","unstructured":"M. Rabin . How to exchange secrets by oblivious transfer. Technical Memo TR--81 , Aiken Computation Laboratory , 1981 . M. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR--81, Aiken Computation Laboratory, 1981."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/251007.251012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_26_1","volume-title":"On the Computational Practicality of Private Information Retrieval. em Proceedings of the Network and Distributed System Security Symposium","author":"Sion R.","year":"2007","unstructured":"R. Sion , B. Carbunar . On the Computational Practicality of Private Information Retrieval. em Proceedings of the Network and Distributed System Security Symposium , 2007 . R. Sion, B. Carbunar. On the Computational Practicality of Private Information Retrieval. em Proceedings of the Network and Distributed System Security Symposium, 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"SAC09: The 2009 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Honolulu Hawaii","acronym":"SAC09"},"container-title":["Proceedings of the 2009 ACM symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1529282.1529730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1529282.1529730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:30Z","timestamp":1750253370000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1529282.1529730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,8]]},"references-count":26,"alternative-id":["10.1145\/1529282.1529730","10.1145\/1529282"],"URL":"https:\/\/doi.org\/10.1145\/1529282.1529730","relation":{},"subject":[],"published":{"date-parts":[[2009,3,8]]},"assertion":[{"value":"2009-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}