{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:15:36Z","timestamp":1769314536901,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488678","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"555-564","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":265,"title":["Reusable garbled circuits and succinct functional encryption"],"prefix":"10.1145","author":[{"given":"Shafi","family":"Goldwasser","sequence":"first","affiliation":[{"name":"MIT, Cambridge, USA"}]},{"given":"Yael","family":"Kalai","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, USA"}]},{"given":"Raluca Ada","family":"Popa","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, USA"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}]},{"given":"Nickolai","family":"Zeldovich","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"CRYPTO","author":"Barak B.","unstructured":"B. Barak , O. Goldreich , R. Impagliazzo , S. Rudich , A. Sahai , S. P. Vadhan , and K. Yang . On the (im)possibility of obfuscating programs . In CRYPTO , pages 1 -?18, 2001. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. P. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In CRYPTO, pages 1-?18, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_22"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_39"},{"key":"e_1_3_2_1_9_1","first-page":"253","volume-title":"TCC","author":"Boneh D.","unstructured":"D. Boneh , A. Sahai , and B. Waters . Functional encryption: Definitions and challenges . In TCC , pages 253 -?273, 2011. D. Boneh, A. Sahai, and B. Waters. Functional encryption: Definitions and challenges. In TCC, pages 253-?273, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760749.1760788"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033075"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_4"},{"key":"e_1_3_2_1_16_1","volume-title":"Information Week","author":"Davis M. A.","year":"2012","unstructured":"M. A. Davis . Cloud security : Verify, don't trust . Information Week , August 2012 . http:\/\/reports.informationweek.com\/abstract\/5\/8978\/. M. A. Davis. Cloud security: Verify, don't trust. Information Week, August 2012. http:\/\/reports.informationweek.com\/abstract\/5\/8978\/."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_26"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.60"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760749.1760765"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_11"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488677"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_47"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180418"},{"key":"e_1_3_2_1_34_1","first-page":"146","volume-title":"EUROCRYPT","author":"Katz J.","unstructured":"J. Katz , A. Sahai , and B. Waters . Predicate encryption supporting disjunctions, polynomial equations, and inner products . In EUROCRYPT , pages 146 -?162, 2008. J. Katz, A. Sahai, and B. Waters. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In EUROCRYPT, pages 146-?162, 2008."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_12"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214086"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806739"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_13"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881427"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_3_2_1_45_1","volume-title":"Chronology of data breaches","author":"Clearinghouse Privacy Rights","year":"2012","unstructured":"Privacy Rights Clearinghouse . Chronology of data breaches , 2012 . http:\/\/www.privacyrights.org\/data-breach. Privacy Rights Clearinghouse. Chronology of data breaches, 2012. http:\/\/www.privacyrights.org\/data-breach."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866359"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_27"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_22"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.98"},{"key":"e_1_3_2_1_53_1","unstructured":"Verizon RISK Team. 2012 data breach investigations report. http:\/\/www.verizonbusiness.com\/resources\/reports\/rp_data-breach-investigations-report-2012_en_xg.pdf.  Verizon RISK Team. 2012 data breach investigations report. http:\/\/www.verizonbusiness.com\/resources\/reports\/rp_data-breach-investigations-report-2012_en_xg.pdf."},{"key":"e_1_3_2_1_54_1","first-page":"53","volume-title":"PKC","author":"Waters B.","unstructured":"B. Waters . Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization . In PKC , pages 53 -?70, 2011. B. Waters. Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. In PKC, pages 53-?70, 2011."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_14"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060669"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":51,"alternative-id":["10.1145\/2488608.2488678","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488678","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}