{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:57:38Z","timestamp":1764133058204,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1618269"],"award-info":[{"award-number":["1618269"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["1453045"],"award-info":[{"award-number":["1453045"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N0001416WX01489","N0001416WX01645"],"award-info":[{"award-number":["N0001416WX01489","N0001416WX01645"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["W911NF-15-C-0236"],"award-info":[{"award-number":["W911NF-15-C-0236"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1445424","1423306"],"award-info":[{"award-number":["1445424","1423306"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-14-CE28-0003"],"award-info":[{"award-number":["ANR-14-CE28-0003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10623-017-0348-2","type":"journal-article","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T06:16:26Z","timestamp":1489644986000},"page":"641-663","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved, black-box, non-malleable encryption from semantic security"],"prefix":"10.1007","volume":"86","author":[{"given":"Seung Geol","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Dachman-Soled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"key":"348_CR1","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-662-49896-5_31","volume-title":"EUROCRYPT 2016. LNCS","author":"M Ball","year":"2016","unstructured":"Ball M., Dachman-Soled D., Kulkarni M., Malkin T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: Fischlin M., Coron J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016)."},{"issue":"4","key":"348_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00145-008-9026-x","volume":"21","author":"M Bellare","year":"2008","unstructured":"Bellare M., Namprempre C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. J. Cryptol. 21(4), 469\u2013491 (2008).","journal-title":"J. Cryptol."},{"key":"348_CR3","first-page":"519","volume-title":"CRYPTO\u201999. LNCS","author":"M Bellare","year":"1999","unstructured":"Bellare M., Sahai A.: Non-malleable encryption: equivalence between two notions, and an indistinguishability-based characterization. In: Weiner M.J. (ed.) CRYPTO\u201999. LNCS, vol. 1666, pp. 519\u2013536. Springer, Heidelberg (1999)."},{"key":"348_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988).","DOI":"10.1145\/62212.62213"},{"key":"348_CR5","unstructured":"Berlekamp E.R., Welch L.R.: Error correction for algebraic block codes. US Patent 4,633,470 (1986)."},{"key":"348_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"EUROCRYPT 2004. LNCS","author":"R Canetti","year":"2004","unstructured":"Canetti R., Halevi S., Katz J.: Chosen-ciphertext security from identity-based encryption. In: Cachin C., Camenisch J. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207\u2013222. Springer, Heidelberg (2004)."},{"key":"348_CR7","first-page":"440","volume-title":"TCC 2014. LNCS","author":"M Cheraghchi","year":"2014","unstructured":"Cheraghchi M., Guruswami V.: Non-malleable coding against bit-wise and split-state tampering. In: Yehuda L. (ed.) TCC 2014. LNCS, vol. 8349, pp. 440\u2013464. Springer, Heidelberg (2014)."},{"key":"348_CR8","unstructured":"Choi S.G., Dachman-Soled D., Malkin T., Wee H.: A black-box construction of non-malleable encryption from semantically secure encryption. (2016). Full version of [8] eprint\/2016\/720."},{"key":"348_CR9","first-page":"427","volume-title":"TCC\u00a02008. LNCS","author":"SG Choi","year":"2008","unstructured":"Choi S.G., Dachman-Soled D., Malkin T., Wee H.: Black-box construction of a non-malleable encryption scheme from any semantically secure one. In: Canetti R. (ed.) TCC\u00a02008. LNCS, vol. 4948, pp. 427\u2013444. Springer, Heidelberg (2008)."},{"key":"348_CR10","first-page":"306","volume-title":"TCC 2016-A. LNCS","author":"S Coretti","year":"2016","unstructured":"Coretti S., Dodis Y., Tackmann B., Venturi D.: Non-malleable encryption: simpler, shorter, stronger. In: Eyal K., Tal M. (eds.) TCC 2016-A. LNCS, vol. 9562, pp. 306\u2013335. Springer, Heidelberg (2016)."},{"issue":"1","key":"348_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2003","unstructured":"Cramer R., Shoup V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33(1), 167\u2013226 (2003).","journal-title":"SIAM J. Comput."},{"key":"348_CR12","volume-title":"Advances in Cryptology (ASIACRYPT 2007). Lecture Notes in Computer Science","author":"R Cramer","year":"2007","unstructured":"Cramer R., Hanaoka G., Hofheinz D., Imai H., Kiltz E., Pass R., Shelat A., Vaikuntanathan V.: Bounded CCA2-secure encryption. Advances in Cryptology (ASIACRYPT 2007). Lecture Notes in Computer Science, vol. 4833. Springer, Berlin (2007)."},{"key":"348_CR13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-662-46803-6_11","volume-title":"EUROCRYPT 2015. LNCS","author":"R Cramer","year":"2015","unstructured":"Cramer R., Damg\u00e5rd I.B., D\u00f6ttling N., Fehr S., Spini G.: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Elisabeth O., Fischlin M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 313\u2013336. Springer, Heidelberg (2015)."},{"key":"348_CR14","unstructured":"Dachman-Soled D., Malkin T., Raykova M., Yung M.: Efficient robust private set intersection. In Applied Cryptography and Network Security, 7th International Conference, ACNS 2009. Lecture Notes in Computer Science, vol. 5536 (2009)."},{"issue":"3","key":"348_CR15","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1137\/S0097539797325648","volume":"29","author":"SE Decatur","year":"1999","unstructured":"Decatur S.E., Goldreich O., Ron D.: Computational sample complexity. SIAM J. Comput. 29(3), 854\u2013879 (1999).","journal-title":"SIAM J. Comput."},{"issue":"2","key":"348_CR16","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev D., Dwork C., Naor M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000).","journal-title":"SIAM J. Comput."},{"key":"348_CR17","doi-asserted-by":"crossref","unstructured":"Franklin M.K., Yung, M.: Communication Complexity of Secure Computation (extended abstract). In: 24th ACM STOC. pp. 699\u2013710. ACM Press, New York (1992).","DOI":"10.1145\/129712.129780"},{"key":"348_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49890-3_1","volume-title":"EUROCRYPT 2016. LNCS","author":"R Gay","year":"2016","unstructured":"Gay R., Hofheinz D., Kiltz E., Wee H.: Tightly CCA-secure encryption without pairings. In: Fischlin M., Coron J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 1\u201327. Springer, Heidelberg (2016)."},{"key":"348_CR19","unstructured":"Gertner Y., Malkin T., Myers S.: Towards a separation of semantic and CCA security for public key encryption. In: Proceedings of the 4th Theory of Cryptography Conference, TCC 2007. Lecture Notes in Computer Science, vol. 4392, pp. 434\u2013455 (2007)."},{"key":"348_CR20","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","volume":"31","author":"EN Gilbert","year":"1952","unstructured":"Gilbert E.N.: A comparison of signalling alphabets. Bell Syst. Tech. J. 31, 504\u2013522 (1952).","journal-title":"Bell Syst. Tech. J."},{"key":"348_CR21","unstructured":"Goyal V., Lee C.-K., Ostrovsky R., Visconti I.: Constructing non-malleable commitments: a black-box approach. In: 53rd FOCS. pp. 51\u201360. IEEE Computer Society Press, Washington, DC (2012)."},{"key":"348_CR22","first-page":"515","volume-title":"46th ACM STOC","author":"V Goyal","year":"2014","unstructured":"Goyal V., Ostrovsky R., Scafuro A., Visconti I.: Black-box non-black-box zero knowledge. In: Shmoys D.B. (ed.) 46th ACM STOC, pp. 515\u2013524. ACM Press, New York (2014)."},{"issue":"11","key":"348_CR23","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1016\/j.ic.2010.07.002","volume":"208","author":"J Herranz","year":"2010","unstructured":"Herranz J., Hofheinz D., Kiltz E.: Some (in)sufficient conditions for secure hybrid encryption. Inf. Comput. 208(11), 1243\u20131257 (2010).","journal-title":"Inf. Comput."},{"key":"348_CR24","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-32009-5_35","volume-title":"CRYPTO 2012. LNCS","author":"D Hofheinz","year":"2012","unstructured":"Hofheinz D., Jager T.: Tightly secure signatures and public-key encryption. In: Safavi-Naini R., Canetti R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 590\u2013607. Springer, Heidelberg (2012)."},{"key":"348_CR25","first-page":"101","volume-title":"EUROCRYPT 2015, Part II. LNCS","author":"E Kiltz","year":"2015","unstructured":"Kiltz E., Wee H.: Quasi-adaptive NIZK for linear subspaces revisited. In: Oswald E., Fischlin M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 101\u2013128. Springer, Heidelberg (2015)."},{"key":"348_CR26","volume-title":"CRYPTO 2014. LNCS","author":"S Kiyoshima","year":"2014","unstructured":"Kiyoshima S.: Round-efficient black-box construction of composable multi-party computation. In: Garay J.A., Gennaro R. (eds.) CRYPTO 2014. LNCS. Springer, Heidelberg (2014)."},{"key":"348_CR27","first-page":"343","volume-title":"TCC 2014. LNCS","author":"S Kiyoshima","year":"2014","unstructured":"Kiyoshima S., Manabe Y., Okamoto T.: Constant-round black-box construction of composable multi-party computation protocol. In: Lindell Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 343\u2013367. Springer, Heidelberg (2014)."},{"key":"348_CR28","unstructured":"Lamport L.: Constructing digital signatures from a one-way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (1979)."},{"key":"348_CR29","unstructured":"Libert B., Peters T., Joye M., Yung M.: Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures. In: Nguyen P.Q., Oswald E. (eds.) EUROCRYPT 2014. LNCS. vol. 8441, pp. 514\u2013532. Springer, Heidelberg (2014)."},{"key":"348_CR30","first-page":"681","volume-title":"ASIACRYPT\u00a02015, Part I. LNCS","author":"B Libert","year":"2015","unstructured":"Libert B., Peters T., Joye M., Yung M.: Compactly hiding linear spans\u2014tightly secure constant-size simulation-sound QA-NIZK proofs and applications. In: Iwata T., Cheon J.H. (eds.) ASIACRYPT\u00a02015, Part I. LNCS, vol. 9452, pp. 681\u2013707. Springer, Heidelberg (2015)."},{"key":"348_CR31","volume-title":"CRYPTO 2012. LNCS","author":"H Lin","year":"2012","unstructured":"Lin H., Pass R.: Black-box constructions of composable protocols without set-up. In: Safavi-Naini R., Canetti R. (eds.) CRYPTO 2012. LNCS, vol. 7417. Springer, Heidelberg (2012)."},{"key":"348_CR32","doi-asserted-by":"crossref","unstructured":"Myers S., Shelat A.: Bit encryption is complete. In: 50th FOCS. pp. 607\u2013616. IEEE Computer Society Press, New York (2009)","DOI":"10.1109\/FOCS.2009.65"},{"key":"348_CR33","unstructured":"Pass R., Wee H.: Black-box constructions of two-party protocols from one-way functions. In: Proceedings of the 6th Theory of Cryptography Conference, TCC 2009, Lecture Notes in Computer Science, vol. 5444, pp. 403\u2013418 (2009)."},{"key":"348_CR34","unstructured":"Pass R., Shelat A., Vaikuntanathan V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Advances in Cryptology (CRYPTO 2006). Lecture Notes in Computer Science, vol. 4117, pp. 271\u2013289 (2006)."},{"key":"348_CR35","first-page":"187","volume-title":"40th ACM STOC","author":"C Peikert","year":"2008","unstructured":"Peikert C., Waters B.: Lossy trapdoor functions and their applications. In: Ladner R.E., Dwork C. (eds.) 40th ACM STOC, pp. 187\u2013196. ACM Press, New York (2008)."},{"key":"348_CR36","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing. pp. 387\u2013394 (1990).","DOI":"10.1145\/100216.100269"},{"issue":"7","key":"348_CR37","doi-asserted-by":"publisher","first-page":"3058","DOI":"10.1137\/100782929","volume":"39","author":"A Rosen","year":"2010","unstructured":"Rosen A., Segev G.: Chosen-ciphertext security via correlated products. SIAM J. Comput. 39(7), 3058\u20133088 (2010).","journal-title":"SIAM J. Comput."},{"key":"348_CR38","first-page":"739","volume":"117","author":"RR Varshamov","year":"1957","unstructured":"Varshamov R.R.: Estimate of the number of signals in error correcting codes. Doklady Akad. Nauk SSSR 117, 739\u2013741 (1957).","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"348_CR39","first-page":"531","volume-title":"51st FOCS","author":"H Wee","year":"2010","unstructured":"Wee H.: Black-box, round-efficient secure computation via non-malleability amplification. 51st FOCS, pp. 531\u2013540. IEEE Computer Society Press, New York (2010)."},{"key":"348_CR40","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-29011-4_16","volume-title":"EUROCRYPT 2012. LNCS","author":"H Wee","year":"2012","unstructured":"Wee H.: Dual projective hashing and its applications\u2014lossy trapdoor functions and more. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT 2012. LNCS, pp. 246\u2013262. Springer, Heidelberg (2012)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10623-017-0348-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0348-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0348-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:36:55Z","timestamp":1589722615000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s10623-017-0348-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,16]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["348"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10623-017-0348-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,3,16]]},"assertion":[{"value":"20 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}