{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:13:31Z","timestamp":1764332011475,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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,5,19]]},"DOI":"10.1145\/2213977.2214087","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1235-1254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Multiparty computation secure against continual memory leakage"],"prefix":"10.1145","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[{"name":"MIT and Weizmann, Cambridge, MA, USA"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]},{"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[{"name":"Microsoft Research New England, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_6"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"e_1_3_2_2_4_1","first-page":"1","volume-title":"WOEC'96: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce","author":"Anderson Ross","year":"1996","unstructured":"Ross Anderson and Markus Kuhn . Tamper resistance: a cautionary note . In WOEC'96: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce , pages 1 -- 11 , 1996 . Ross Anderson and Markus Kuhn. Tamper resistance: a cautionary note. In WOEC'96: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce, pages 1--11, 1996."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_39"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62222"},{"key":"e_1_3_2_2_8_1","first-page":"1","volume-title":"CRYPTO","author":"Brakerski Zvika","year":"2010","unstructured":"Zvika Brakerski and Shafi Goldwasser . Circular and leakage resilient public-key encryption under subgroup indistinguishability - (or: Quadratic residuosity strikes back) . In CRYPTO , pages 1 -- 20 , 2010 . Zvika Brakerski and Shafi Goldwasser. Circular and leakage resilient public-key encryption under subgroup indistinguishability - (or: Quadratic residuosity strikes back). In CRYPTO, pages 1--20, 2010."},{"key":"e_1_3_2_2_9_1","volume-title":"Manuscript","author":"Boyle Elette","year":"2011","unstructured":"Elette Boyle , Sanjam Garg , Shafi Goldwasser , Abhishek Jain , Yael Tauman Kalai , and Amit Sahai . Leakage-resilient multiparty computation . Manuscript , 2011 . Elette Boyle, Sanjam Garg, Shafi Goldwasser, Abhishek Jain, Yael Tauman Kalai, and Amit Sahai. Leakage-resilient multiparty computation. Manuscript, 2011."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075050"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.55"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220068"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008684.2008694"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276722"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_22"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.56"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_35"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536498"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.35"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.56"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881415"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796481"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_21"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89549"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_7"},{"key":"e_1_3_2_2_31_1","first-page":"526","volume-title":"CRYPTO","author":"Feige Uriel","year":"1989","unstructured":"Uriel Feige and Adi Shamir . Zero knowledge proofs of knowledge in two rounds . In CRYPTO , pages 526 -- 544 , 1989 . Uriel Feige and Adi Shamir. Zero knowledge proofs of knowledge in two rounds. In CRYPTO, pages 526--544, 1989."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033059"},{"key":"e_1_3_2_2_34_1","first-page":"251","volume-title":"CHES","author":"Gandolfi Karine","year":"2001","unstructured":"Karine Gandolfi , Christophe Mourtel , and Francis Olivier . Electromagnetic analysis : Concrete results . In CHES , pages 251 -- 261 , 2001 . Karine Gandolfi, Christophe Mourtel, and Francis Olivier. Electromagnetic analysis: Concrete results. In CHES, pages 251--261, 2001."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_21"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881417"},{"key":"e_1_3_2_2_38_1","volume-title":"How to compute in the presence of leakage. Electronic Colloquium on Computational Complexity (ECCC), 19","author":"Goldwasser Shafi","year":"2012","unstructured":"Shafi Goldwasser and Guy N. Rothblum . How to compute in the presence of leakage. Electronic Colloquium on Computational Complexity (ECCC), 19 , 2012 . Shafi Goldwasser and Guy N. Rothblum. How to compute in the presence of leakage. Electronic Colloquium on Computational Complexity (ECCC), 19, 2012."},{"key":"e_1_3_2_2_39_1","first-page":"45","volume-title":"USENIX Security Symposium","author":"Halderman J. Alex","year":"2008","unstructured":"J. Alex Halderman , Seth D. Schoen , Nadia Heninger , William Clarkson , William Paul , Joseph A. Calandrino , Ariel J. Feldman , Jacob Appelbaum , and Edward W. Felten . Lest we remember: Cold boot attacks on encryption keys . In USENIX Security Symposium , pages 45 -- 60 , 2008 . J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten. Lest we remember: Cold boot attacks on encryption keys. In USENIX Security Symposium, pages 45--60, 2008."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881416"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/646761.706156"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_34"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_41"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993732"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987269"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987270"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/11605805_1"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/3088723.3088768"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/646803.705980"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":50,"alternative-id":["10.1145\/2213977.2214087","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214087","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}