{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:11:35Z","timestamp":1764645095050,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835747","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"219-228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Hybrid-secure MPC"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Lucas","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"given":"Dominik","family":"Raub","sequence":"additional","affiliation":[{"name":"University of \u00c5arhus, \u00c5arhus, Denmark"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_19"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_3_1","first-page":"11","volume-title":"CRYPTO'81","author":"Blum M.","year":"1981","unstructured":"M. Blum . Coin flipping by telephone . In CRYPTO'81 , pages 11 -- 15 . Springer , 1981 . M. Blum. Coin flipping by telephone. In CRYPTO'81, pages 11--15. Springer, 1981."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22180"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704151"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_1_8_1","first-page":"591","volume-title":"CRYPTO'89","author":"Chaum D.","year":"1989","unstructured":"D. Chaum . The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptographically from majorities . In CRYPTO'89 , pages 591 -- 602 . Springer , 1989 . D. Chaum. The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptographically from majorities. In CRYPTO'89, pages 591--602. Springer, 1989."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646752.704756"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756154"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.759595"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766177"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_25"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_3_2_1_18_1","volume-title":"Basic Applications","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . Foundations of Cryptography : Basic Applications , volume 2 . Cambridge University Press , 2004 . O. Goldreich. Foundations of Cryptography: Basic Applications, volume 2. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802627"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777777.1777803"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_13"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910003"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_29"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250793"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335342"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_15"},{"key":"e_1_3_2_1_28_1","volume-title":"ETH Zurich","author":"Lucas C.","year":"2008","unstructured":"C. Lucas . Combining computational and information-theoretic security in multi-party computation. Master's thesis , ETH Zurich , 2008 . Supervised by Ueli Maurer and Dominik Raub, see http:\/\/e-collection.ethbib.ethz.ch\/view\/eth:31131. C. Lucas. Combining computational and information-theoretic security in multi-party computation. Master's thesis, ETH Zurich, 2008. Supervised by Ueli Maurer and Dominik Raub, see http:\/\/e-collection.ethbib.ethz.ch\/view\/eth:31131."},{"key":"e_1_3_2_1_29_1","volume-title":"Optimally hybrid-secure MPC","author":"Lucas C.","year":"2010","unstructured":"C. Lucas , D. Raub , and U. Maurer . Optimally hybrid-secure MPC . 2010 . Full version, see http:\/\/eprint.iacr.org\/2009\/009. C. Lucas, D. Raub, and U. Maurer. Optimally hybrid-secure MPC. 2010. Full version, see http:\/\/eprint.iacr.org\/2009\/009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_32_1","volume-title":"ETH Z\u00fcrich","author":"Raub D.","year":"2010","unstructured":"D. Raub . Exploring the Limits of Multi-Party Computation. PhD thesis , ETH Z\u00fcrich , 2010 . D. Raub. Exploring the Limits of Multi-Party Computation. PhD thesis, ETH Z\u00fcrich, 2010."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Zurich Switzerland","acronym":"PODC '10"},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835747","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:23Z","timestamp":1750248503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835747"}},"subtitle":["trading information-theoretic robustness for computational privacy"],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":33,"alternative-id":["10.1145\/1835698.1835747","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835747","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}