{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:39:40Z","timestamp":1779935980951,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,16]],"date-time":"2012-07-16T00:00:00Z","timestamp":1342396800000},"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":[[2012,7,16]]},"DOI":"10.1145\/2332432.2332473","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T14:38:27Z","timestamp":1342708707000},"page":"227-228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Varsha","family":"Dani","sequence":"first","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[{"name":"University of Victoria, Victoria, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahnush","family":"Movahedi","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"152","volume-title":"Languages and Programming","author":"Applebaum B.","year":"2010","unstructured":"B. Applebaum , Y. Ishai , and E. Kushilevitz . From secrecy to soundness: efficient verification via secure computation. Automata , Languages and Programming , pages 152 -- 163 , 2010 . B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: efficient verification via secure computation. Automata, Languages and Programming, pages 152--163, 2010."},{"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","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777777.1777823"},{"key":"e_1_3_2_1_6_1","first-page":"14","volume-title":"Algorithms and theory of computation handbook","author":"Frikken K.","year":"2010","unstructured":"K. Frikken . Secure multiparty computation . In Algorithms and theory of computation handbook , pages 14 -- 14 . Chapman & Hall\/CRC , 2010 . K. Frikken. Secure multiparty computation. In Algorithms and theory of computation handbook, pages 14--14. Chapman & Hall\/CRC, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_16"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007447"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946143.1946161"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374437"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_11"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"PODC '12: ACM Symposium on Principles of Distributed Computing","location":"Madeira Portugal","acronym":"PODC '12","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","INESC-ID INESC-ID Lisboa"]},"container-title":["Proceedings of the 2012 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2332432.2332473","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2332432.2332473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:44:38Z","timestamp":1750268678000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2332432.2332473"}},"subtitle":["breaking the O(nm) bit barrier, secure multiparty computation with a static adversary"],"short-title":[],"issued":{"date-parts":[[2012,7,16]]},"references-count":13,"alternative-id":["10.1145\/2332432.2332473","10.1145\/2332432"],"URL":"https:\/\/doi.org\/10.1145\/2332432.2332473","relation":{},"subject":[],"published":{"date-parts":[[2012,7,16]]},"assertion":[{"value":"2012-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}