{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T11:56:50Z","timestamp":1792756610264,"version":"4.5.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T00:00:00Z","timestamp":1456358400000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2016,2,25]]},"abstract":"<jats:p>What does it mean to be secure?<\/jats:p>","DOI":"10.1145\/2757276","type":"journal-article","created":{"date-parts":[[2016,2,26]],"date-time":"2016-02-26T14:29:03Z","timestamp":1456496943000},"page":"88-96","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Hopes, fears, and software obfuscation"],"prefix":"10.1145","volume":"59","author":[{"given":"Boaz","family":"Barak","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,2,25]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160158.2160159"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90037-8"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366316.2366333"},{"key":"e_1_2_1_6_1","first-page":"1","article-title":"Applications of multilinear forms to cryptography","volume":"324","author":"Boneh D.","year":"2003","journal-title":"Contemp. Math."},{"key":"e_1_2_1_7_1","first-page":"434","article-title":"Obfuscating conjunctions","volume":"416","author":"Brakerski Z.","year":"2013","journal-title":"CRYPTO"},{"key":"e_1_2_1_8_1","first-page":"25","article-title":"Virtual black-box obfuscation for all circuits via generic graded encoding","volume":"1","author":"Brakerski Z.","year":"2014","journal-title":"TCC"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_12"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_12_1","volume-title":"EUROCRYPT, 2013","author":"Garg S.","year":"2012"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 2014 International Congress of Mathematicians (ICM), 2014","author":"Gentry C.","year":"2014"},{"key":"e_1_2_1_16_1","first-page":"92","article-title":"Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based","volume":"75","author":"Gentry C.","year":"2013","journal-title":"CRYPTO"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_2_1_18_1","unstructured":"Green M. Cryptographic obfuscation and 'unhackable' software 2014. Blog post. Available at: http:\/\/blog.cryptographyengineering.com\/2014\/02\/cryptographic-obfuscation-and.html.  Green M. Cryptographic obfuscation and 'unhackable' software 2014. Blog post. Available at: http:\/\/blog.cryptographyengineering.com\/2014\/02\/cryptographic-obfuscation-and.html."},{"key":"e_1_2_1_19_1","first-page":"31","article-title":"Attacking an obfuscated cipher by injecting faults","volume":"16","author":"Jacob M.","year":"2003","journal-title":"Digital Rights Management. Springer"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0312-y"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330667.2330691"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_2_1_23_1","first-page":"11","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest R.L.","year":"1978","journal-title":"Found. Secure Comput."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2757276","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2757276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:27Z","timestamp":1750227387000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2757276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,25]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,2,25]]}},"alternative-id":["10.1145\/2757276"],"URL":"https:\/\/doi.org\/10.1145\/2757276","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,25]]},"assertion":[{"value":"2016-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}