{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:03Z","timestamp":1775096943816,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","award":["2006-CS-001-000001-02"],"award-info":[{"award-number":["2006-CS-001-000001-02"]}],"id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0716199CNS-0915361CNS-0952692"],"award-info":[{"award-number":["CNS-0716199CNS-0915361CNS-0952692"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090264","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"350-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Targeted malleability"],"prefix":"10.1145","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Gil","family":"Segev","sequence":"additional","affiliation":[{"name":"Microsoft Research SVL"}]},{"given":"Brent","family":"Waters","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"83","volume-title":"Advances in Cryptology -- EUROCRYPT '02","author":"An J. H.","year":"2002","unstructured":"J. H. An , Y. Dodis , and T. Rabin . On the security of joint signature and encryption . In Advances in Cryptology -- EUROCRYPT '02 , pages 83 -- 107 , 2002 . J. H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Advances in Cryptology -- EUROCRYPT '02, pages 83--107, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880936"},{"key":"e_1_3_2_1_3_1","first-page":"273","volume-title":"Advances in Cryptology -- CRYPTO '04","author":"Bellare M.","year":"2004","unstructured":"M. Bellare and A. Palacio . The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols . In Advances in Cryptology -- CRYPTO '04 , pages 273 -- 289 , 2004 . M. Bellare and A. Palacio. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Advances in Cryptology -- CRYPTO '04, pages 273--289, 2004."},{"key":"e_1_3_2_1_4_1","first-page":"48","volume-title":"Advances in Cryptology -- ASIACRYPT '04","author":"Bellare M.","year":"2004","unstructured":"M. Bellare and A. Palacio . Towards plaintext-aware public-key encryption without random oracles . In Advances in Cryptology -- ASIACRYPT '04 , pages 48 -- 62 , 2004 . M. Bellare and A. Palacio. Towards plaintext-aware public-key encryption without random oracles. In Advances in Cryptology -- ASIACRYPT '04, pages 48--62, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-48405-1_33","volume-title":"Advances in Cryptology -- CRYPTO '99","author":"Bellare M.","year":"1999","unstructured":"M. Bellare and A. Sahai . Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization . In Advances in Cryptology -- CRYPTO '99 , pages 519 -- 536 , 1999 . The full version is available as Cryptology ePrint Archive, Report 2006\/228. M. Bellare and A. Sahai. Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In Advances in Cryptology -- CRYPTO '99, pages 519--536, 1999. The full version is available as Cryptology ePrint Archive, Report 2006\/228."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62222"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220068"},{"key":"e_1_3_2_1_9_1","first-page":"565","volume-title":"Advances in Cryptology -- CRYPTO '03","author":"Canetti R.","year":"2003","unstructured":"R. Canetti , H. Krawczyk , and J. B. Nielsen . Relaxing chosen-ciphertext security . In Advances in Cryptology -- CRYPTO '03 , pages 565 -- 582 , 2003 . R. Canetti, H. Krawczyk, and J. B. Nielsen. Relaxing chosen-ciphertext security. In Advances in Cryptology -- CRYPTO '03, pages 565--582, 2003."},{"key":"e_1_3_2_1_10_1","first-page":"310","volume-title":"Proceedings of the 1st Symposium on Innovations in Computer Science","author":"Chiesa A.","year":"2010","unstructured":"A. Chiesa and E. Tromer . Proof-carrying data and hearsay arguments from signature cards . In Proceedings of the 1st Symposium on Innovations in Computer Science , pages 310 -- 331 , 2010 . A. Chiesa and E. Tromer. Proof-carrying data and hearsay arguments from signature cards. In Proceedings of the 1st Symposium on Innovations in Computer Science, pages 310--331, 2010."},{"key":"e_1_3_2_1_11_1","first-page":"483","volume-title":"Advances in Cryptology -- CRYPTO '10","author":"Chung K.-M.","year":"2010","unstructured":"K.-M. Chung , Y. Kalai , and S. Vadhan . Improved delegation of computation using fully homomorphic encryption . In Advances in Cryptology -- CRYPTO '10 , pages 483 -- 501 , 2010 . K.-M. Chung, Y. Kalai, and S. Vadhan. Improved delegation of computation using fully homomorphic encryption. In Advances in Cryptology -- CRYPTO '10, pages 483--501, 2010."},{"key":"e_1_3_2_1_12_1","first-page":"103","volume-title":"Advances in Cryptology -- EUROCRYPT '97","author":"Cramer R.","year":"1997","unstructured":"R. Cramer , R. Gennaro , and B. Schoenmakers . A secure and optimally efficient multi-authority election scheme . In Advances in Cryptology -- EUROCRYPT '97 , pages 103 -- 118 , 1997 . R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology -- EUROCRYPT '97, pages 103--118, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706340"},{"key":"e_1_3_2_1_14_1","first-page":"445","volume-title":"Advances in Cryptology -- CRYPTO '91","author":"Damg\u00e5rd I.","year":"1991","unstructured":"I. Damg\u00e5rd . Towards practical public key systems secure against chosen ciphertext attacks . In Advances in Cryptology -- CRYPTO '91 , pages 445 -- 456 , 1991 . I. Damg\u00e5rd. Towards practical public key systems secure against chosen ciphertext attacks. In Advances in Cryptology -- CRYPTO '91, pages 445--456, 1991."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"e_1_3_2_1_16_1","first-page":"342","volume-title":"Advances in Cryptology -- EUROCRYPT '04","author":"Dwork C.","year":"2004","unstructured":"C. Dwork , M. Naor , and O. Reingold . Immunizing encryption schemes from decryption errors . In Advances in Cryptology -- EUROCRYPT '04 , pages 342 -- 360 , 2004 . C. Dwork, M. Naor, and O. Reingold. Immunizing encryption schemes from decryption errors. In Advances in Cryptology -- EUROCRYPT '04, pages 342--360, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89549"},{"key":"e_1_3_2_1_18_1","first-page":"465","volume-title":"Advances in Cryptology -- CRYPTO '10","author":"Gennaro R.","year":"2010","unstructured":"R. Gennaro , C. Gentry , and B. Parno . Non-interactive verifiable computing: Outsourcing computation to untrusted workers . In Advances in Cryptology -- CRYPTO '10 , pages 465 -- 482 , 2010 . R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Advances in Cryptology -- CRYPTO '10, pages 465--482, 2010."},{"key":"e_1_3_2_1_20_1","first-page":"155","volume-title":"Advances in Cryptology -- CRYPTO '10","author":"Gentry C.","year":"2010","unstructured":"C. Gentry , S. Halevi , and V. Vaikuntanathan . i-hop homomorphic encryption and rerandomizable Yao circuits . In Advances in Cryptology -- CRYPTO '10 , pages 155 -- 172 , 2010 . C. Gentry, S. Halevi, and V. Vaikuntanathan. i-hop homomorphic encryption and rerandomizable Yao circuits. In Advances in Cryptology -- CRYPTO '10, pages 155--172, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_9"},{"key":"e_1_3_2_1_24_1","first-page":"321","volume-title":"Advances in Cryptology -- ASIACRYPT '10","author":"Groth J.","year":"2010","unstructured":"J. Groth . Short pairing-based non-interactive zero-knowledge arguments . In Advances in Cryptology -- ASIACRYPT '10 , pages 321 -- 340 , 2010 . J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In Advances in Cryptology -- ASIACRYPT '10, pages 321--340, 2010."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0345-x"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_28_1","first-page":"96","volume-title":"Advances in Cryptology -- CRYPTO '03","author":"Naor M.","year":"2003","unstructured":"M. Naor . On cryptographic assumptions and challenges . In Advances in Cryptology -- CRYPTO '03 , pages 96 -- 109 , 2003 . M. Naor. On cryptographic assumptions and challenges. In Advances in Cryptology -- CRYPTO '03, pages 96--109, 2003."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100273"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781454.1781498"},{"key":"e_1_3_2_1_31_1","first-page":"517","volume-title":"Advances in Cryptology -- CRYPTO '07","author":"Prabhakaran M.","year":"2007","unstructured":"M. Prabhakaran and M. Rosulek . Rerandomizable RCCA encryption . In Advances in Cryptology -- CRYPTO '07 , pages 517 -- 534 , 2007 . M. Prabhakaran and M. Rosulek. Rerandomizable RCCA encryption. In Advances in Cryptology -- CRYPTO '07, pages 517--534, 2007."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_54"},{"key":"e_1_3_2_1_33_1","volume-title":"Foundations of Secure Computation","author":"Rivest R.","year":"1978","unstructured":"R. Rivest , L. Adleman , and M. Dertouzos . On data banks and privacy homomorphisms . Foundations of Secure Computation , 1978 . R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, 1978."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796535"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802616"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_2"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts","acronym":"ITCS '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090264"}},"subtitle":["homomorphic encryption for restricted computations"],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":35,"alternative-id":["10.1145\/2090236.2090264","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090264","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}