{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:01:59Z","timestamp":1764133319506},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T00:00:00Z","timestamp":1596499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T00:00:00Z","timestamp":1596499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00145-020-09361-0","type":"journal-article","created":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T23:04:02Z","timestamp":1596495842000},"page":"1984-2033","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-malleable Encryption: Simpler, Shorter, Stronger"],"prefix":"10.1007","volume":"33","author":[{"given":"Sandro","family":"Coretti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yevgeniy","family":"Dodis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Tackmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,4]]},"reference":[{"key":"9361_CR1","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, Y. Dodis, T. Kazana, M. Obremski, Non-malleable reductions and applications, in STOC (2015), pp. 459\u2013468","DOI":"10.1145\/2746539.2746544"},{"key":"9361_CR2","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, Y. Dodis, S. Lovett, Non-malleable codes from additive combinatorics, in STOC (2014), pp. 774\u2013783","DOI":"10.1145\/2591796.2591804"},{"key":"9361_CR3","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, N. D\u00f6ttling, J.B. Nielsen, M. Obremski, E. Purwanto, Continuous non-malleable codes in the 8-split-state model, in EUROCRYPT (2019), pp. 531\u2013561","DOI":"10.1007\/978-3-030-17653-2_18"},{"key":"9361_CR4","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, S. Dziembowski, T. Kazana, M. Obremski, Leakage-resilient non-malleable codes, in TCC (2015), pp. 398\u2013426","DOI":"10.1007\/978-3-662-46494-6_17"},{"key":"9361_CR5","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, T. Kazana, M. Obremski, Inception makes non-malleable codes stronger, in TCC (2017), pp. 319\u2013343","DOI":"10.1007\/978-3-319-70503-3_10"},{"key":"9361_CR6","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Gupta, H.K. Maji, O. Pandey, M. Prabhakaran, Explicit non-malleable codes against bit-wise tampering and permutations, in CRYPTO (2015), pp. 538\u2013557","DOI":"10.1007\/978-3-662-47989-6_26"},{"key":"9361_CR7","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Gupta, H.K. Maji, O. Pandey, M. Prabhakaran, A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations, in TCC (2015), pp. 375\u2013397","DOI":"10.1007\/978-3-662-46494-6_16"},{"key":"9361_CR8","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, S. Guo, T. Malkin, L.-Y. Tan, Non-malleable codes for small-depth circuits, in IEEE FOCS (2018), pp. 826\u2013837","DOI":"10.1109\/FOCS.2018.00083"},{"key":"9361_CR9","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, H. Lin, T. Malkin, Non-malleable codes against bounded polynomial time tampering, in EUROCRYPT (2019), pp. 501\u2013530","DOI":"10.1007\/978-3-030-17653-2_17"},{"key":"9361_CR10","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin, Non-malleable codes for bounded depth, bounded fan-in circuits, in EUROCRYPT (2016), pp. 881\u2013908","DOI":"10.1007\/978-3-662-49896-5_31"},{"key":"9361_CR11","doi-asserted-by":"crossref","unstructured":"M. Ball, D. Dachman-Soled, M. Kulkarni, T. Malkin, Non-malleable codes from average-case hardness: $$\\sf AC\\it ^0$$, decision trees, and streaming space-bounded tampering, in EUROCRYPT (2018), pp. 618\u2013650","DOI":"10.1007\/978-3-319-78372-7_20"},{"key":"9361_CR12","doi-asserted-by":"crossref","unstructured":"M. Ball, S. Guo, D. Wichs, Non-malleable codes for decision trees, in CRYPTO (2019), pp. 413\u2013434","DOI":"10.1007\/978-3-030-26948-7_15"},{"key":"9361_CR13","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, S. Micali, Public-key encryption in a multi-user setting: Security proofs and improvements, in EUROCRYPT (2000), pp. 259\u2013274","DOI":"10.1007\/3-540-45539-6_18"},{"key":"9361_CR14","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Sahai, Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization, in CRYPTO (1999), pp. 519\u2013536","DOI":"10.1007\/3-540-48405-1_33"},{"key":"9361_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, S. Halevi, J. Katz, Chosen-ciphertext security from identity-based encryption, in EUROCRYPT (2004), pp. 207\u2013222","DOI":"10.1007\/978-3-540-24676-3_13"},{"key":"9361_CR16","doi-asserted-by":"crossref","unstructured":"R. Canetti, H. Krawczyk, J.B. Nielsen, Relaxing chosen-ciphertext security, in CRYPTO (2003), pp. 565\u2013582","DOI":"10.1007\/978-3-540-45146-4_33"},{"key":"9361_CR17","unstructured":"N. Chandran, V. Goyal, P. Mukherjee, O. Pandey, J. Upadhyay, Block-wise non-malleable codes, in ICALP (2016), pp. 31:1\u201331:14"},{"key":"9361_CR18","doi-asserted-by":"crossref","unstructured":"N. Chandran, B. Kanukurthi, S. Raghuraman, Information-theoretic local non-malleable codes and their applications, in TCC (2016), pp. 367\u2013392","DOI":"10.1007\/978-3-662-49099-0_14"},{"key":"9361_CR19","doi-asserted-by":"crossref","unstructured":"E. Chattopadhyay, V. Goyal, X. Li, Non-malleable extractors and codes, with their many tampered extensions, in ACM STOC (2016), pp. 285\u2013298","DOI":"10.1145\/2897518.2897547"},{"key":"9361_CR20","doi-asserted-by":"crossref","unstructured":"E. Chattopadhyay, X. Li, Non-malleable codes and extractors for small-depth circuits, and affine functions, in ACM STOC (2017), pp. 1171\u20131184","DOI":"10.1145\/3055399.3055483"},{"key":"9361_CR21","doi-asserted-by":"crossref","unstructured":"E. Chattopadhyay, D. Zuckerman, Non-malleable codes against constant split-state tampering, in FOCS (2014), pp. 306\u2013315","DOI":"10.1109\/FOCS.2014.40"},{"key":"9361_CR22","doi-asserted-by":"crossref","unstructured":"B. Chen, Y. Chen, K. Host\u00e1kov\u00e1, P. Mukherjee, Continuous space-bounded non-malleable codes from stronger proofs-of-space, in CRYPTO (2019), pp. 467\u2013495","DOI":"10.1007\/978-3-030-26948-7_17"},{"key":"9361_CR23","doi-asserted-by":"crossref","unstructured":"M. Cheraghchi, V. Guruswami, Capacity of non-malleable codes, in Innovations in Theoretical Computer Science (2014), pp. 155\u2013168","DOI":"10.1145\/2554797.2554814"},{"key":"9361_CR24","doi-asserted-by":"crossref","unstructured":"M. Cheraghchi, V. Guruswami, Non-malleable coding against bit-wise and split-state tampering, in TCC (2014), pp. 440\u2013464","DOI":"10.1007\/978-3-642-54242-8_19"},{"key":"9361_CR25","doi-asserted-by":"crossref","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, Black-box construction of a non-malleable encryption scheme from any semantically secure one, in TCC (2008), pp. 427\u2013444","DOI":"10.1007\/978-3-540-78524-8_24"},{"issue":"3","key":"9361_CR26","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-017-0348-2","volume":"86","author":"SG Choi","year":"2018","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, Improved, black-box, non-malleable encryption from semantic security. Des. Codes Cryptogr., 86(3), 641\u2013663 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"9361_CR27","doi-asserted-by":"crossref","unstructured":"S. Coretti, Y. Dodis, B. Tackmann, D. Venturi, Non-malleable encryption: simpler, shorter, stronger, in TCC (2016), pp. 306\u2013335","DOI":"10.1007\/978-3-662-49096-9_13"},{"key":"9361_CR28","doi-asserted-by":"crossref","unstructured":"S. Coretti, A. Faonio, D. Venturi, Rate-optimizing compilers for continuously non-malleable codes, in ACNS (2019), pp. 3\u201323","DOI":"10.1007\/978-3-030-21568-2_1"},{"key":"9361_CR29","doi-asserted-by":"crossref","unstructured":"S. Coretti, U. Maurer, B. Tackmann, D. Venturi, From single-bit to multi-bit public-key encryption via non-malleable codes, in TCC (2015), pp. 532\u2013560","DOI":"10.1007\/978-3-662-46494-6_22"},{"key":"9361_CR30","doi-asserted-by":"crossref","unstructured":"R. Cramer, I.B. Damg\u00e5rd, N. D\u00f6ttling, S. Fehr, G. Spini, Linear secret sharing schemes from error correcting codes and universal hash functions, in EUROCRYPT (2015), pp. 313\u2013336","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"9361_CR31","doi-asserted-by":"crossref","unstructured":"R. Cramer, G. Hanaoka, D. Hofheinz, H. Imai, E. Kiltz, R. Pass, A. Shelat, V. Vaikuntanathan, Bounded CCA2-secure encryption, in ASIACRYPT (2007), pp. 502\u2013518","DOI":"10.1007\/978-3-540-76900-2_31"},{"key":"9361_CR32","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, in CRYPTO, volume 1462 of LNCS (1998), pp. 13\u201325","DOI":"10.1007\/BFb0055717"},{"key":"9361_CR33","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in EUROCRYPT (2002), pp. 45\u201364","DOI":"10.1007\/3-540-46035-7_4"},{"key":"9361_CR34","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, A black-box construction of a CCA2 encryption scheme from a plaintext aware encryption scheme, in Hugo Krawczyk, editor, PKC, LNCS. Springer (2014)","DOI":"10.1007\/978-3-642-54631-0_3"},{"key":"9361_CR35","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, M. Kulkarni, Upper and lower bounds for continuous non-malleable codes, in PKC (2019), pp. 519\u2013548","DOI":"10.1007\/978-3-030-17253-4_18"},{"key":"9361_CR36","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, T. Kazana, M. Obremski, V. Raj, L. Siniscalchi, Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments, in TCC (2018), pp. 225\u2013254","DOI":"10.1007\/978-3-030-03810-6_9"},{"issue":"6","key":"9361_CR37","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory, 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9361_CR38","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography. SIAM J. Comput., 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"9361_CR39","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, T. Kazana, M. Obremski, Non-malleable codes from two-source extractors, in CRYPTO (2013), pp. 239\u2013257","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"9361_CR40","unstructured":"S. Dziembowski, K. Pietrzak, D. Wichs, Non-malleable codes, in Innovations in Theoretical Computer Science (2010), pp. 434\u2013452"},{"key":"9361_CR41","doi-asserted-by":"crossref","unstructured":"T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in CRYPTO (1984), pp. 10\u201318","DOI":"10.1007\/3-540-39568-7_2"},{"key":"9361_CR42","doi-asserted-by":"crossref","unstructured":"A. Faonio, J.B. Nielsen, M. Simkin, D. Venturi, Continuously non-malleable codes with split-state refresh, in ACNS (2018), pp. 121\u2013139","DOI":"10.1007\/978-3-319-93387-0_7"},{"key":"9361_CR43","doi-asserted-by":"crossref","unstructured":"S. Faust, K. Host\u00e1kov\u00e1, P. Mukherjee, D. Venturi, Non-malleable codes for space-bounded tampering, in CRYPTO (2017), pp. 95\u2013126","DOI":"10.1007\/978-3-319-63715-0_4"},{"key":"9361_CR44","doi-asserted-by":"crossref","unstructured":"S. Faust, P. Mukherjee, J.B. Nielsen, D. Venturi, Continuous non-malleable codes, in TCC (2014), pp. 465\u2013488","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"9361_CR45","doi-asserted-by":"crossref","unstructured":"S. Faust, P. Mukherjee, D. Venturi, D. Wichs, Efficient non-malleable codes and key-derivation for poly-size tampering circuits, in EUROCRYPT (2014), pp. 111\u2013128","DOI":"10.1007\/978-3-642-55220-5_7"},{"key":"9361_CR46","first-page":"260","volume-title":"CRYPTO, volume 2139 of LNCS","author":"E Fujisaki","year":"2001","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern, RSA-OAEP is secure under the RSA assumption, in J. Kilian, editor, CRYPTO, volume 2139 of LNCS, (Springer, Heidelberg, 2001), pp. 260\u2013274"},{"key":"9361_CR47","doi-asserted-by":"crossref","unstructured":"R. Gennaro, A. Lysyanskaya, T. Malkin, S. Micali, T. Rabin, Algorithmic tamper-proof (ATP) security: theoretical foundations for security against hardware tampering, in TCC (2004), pp. 258\u2013277","DOI":"10.1007\/978-3-540-24638-1_15"},{"key":"9361_CR48","doi-asserted-by":"crossref","unstructured":"Y. Gertner, T. Malkin, S. Myers. Towards a separation of semantic and CCA security for public key encryption, in TCC (2007), pp. 434\u2013455","DOI":"10.1007\/978-3-540-70936-7_24"},{"issue":"2","key":"9361_CR49","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci., 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"9361_CR50","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1016\/j.ic.2010.07.002","volume":"208","author":"J Herranz","year":"2010","unstructured":"J. Herranz, D. Hofheinz, E. Kiltz, Some (in)sufficient conditions for secure hybrid encryption. Inf. Comput., 208(11), 1243\u20131257 (2010)","journal-title":"Inf. Comput."},{"key":"9361_CR51","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, E. Kiltz, Practical chosen ciphertext secure encryption from factoring, in Antoine Joux, editor, EUROCRYPT, volume 5479 of LNCS, pp. 313\u2013332, (Heidelberg, Springer, 2009).","DOI":"10.1007\/978-3-642-01001-9_18"},{"key":"9361_CR52","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, E. Kiltz, Practical chosen ciphertext secure encryption from factoring, in EUROCRYPT (2009), pp. 313\u2013332","DOI":"10.1007\/978-3-642-01001-9_18"},{"key":"9361_CR53","doi-asserted-by":"crossref","unstructured":"S. Hohenberger, A.B. Lewko, B. Waters, Detecting dangerous queries: a new approach for chosen ciphertext security, in EUROCRYPT (2012), pp. 663\u2013681","DOI":"10.1007\/978-3-642-29011-4_39"},{"key":"9361_CR54","doi-asserted-by":"crossref","unstructured":"Z. Jafargholi, D. Wichs, Tamper detection and continuous non-malleable codes, in TCC (2015), pp. 451\u2013480","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"9361_CR55","doi-asserted-by":"crossref","unstructured":"B. Kanukurthi, S.L.B. Obbattu, S. Sekar, Four-state non-malleable codes with explicit constant rate, in TCC (2017), pp. 344\u2013375","DOI":"10.1007\/978-3-319-70503-3_11"},{"key":"9361_CR56","doi-asserted-by":"crossref","unstructured":"A. Kiayias, F.-H. Liu, Y. Tselekounis, Practical non-malleable codes from l-more extractable hash functions, in ACM CCS (2016), pp. 1317\u20131328","DOI":"10.1145\/2976749.2978352"},{"key":"9361_CR57","first-page":"590","volume-title":"EUROCRYPT, volume 5479 of LNCS","author":"E Kiltz","year":"2009","unstructured":"E. Kiltz, K. Pietrzak, M. Stam, M. Yung, A new randomness extraction paradigm for hybrid encryption, in A. Joux, editor, EUROCRYPT, volume 5479 of LNCS, (Springer, Heidelberg, 2009), pp. 590\u2013609"},{"key":"9361_CR58","doi-asserted-by":"crossref","unstructured":"K. Kurosawa, Y. Desmedt, A new paradigm of hybrid encryption scheme, in CRYPTO (2004), pp. 426\u2013442","DOI":"10.1007\/978-3-540-28628-8_26"},{"key":"9361_CR59","doi-asserted-by":"crossref","unstructured":"X. Li, Improved non-malleable extractors, non-malleable codes and independent source extractors, in ACM STOC (2017), pp. 1144\u20131156","DOI":"10.1145\/3055399.3055486"},{"key":"9361_CR60","doi-asserted-by":"crossref","unstructured":"H. Lin, S. Tessaro, Amplification of chosen-ciphertext security, in EUROCRYPT (2013), pp. 503\u2013519","DOI":"10.1007\/978-3-642-38348-9_30"},{"key":"9361_CR61","doi-asserted-by":"crossref","unstructured":"Y. Lindell. A simpler construction of CCA2-secure public-key encryption under general assumptions, in EUROCRYPT (2003), pp. 241\u2013254","DOI":"10.1007\/3-540-39200-9_15"},{"key":"9361_CR62","doi-asserted-by":"crossref","unstructured":"F.-H. Liu, A. Lysyanskaya, Tamper and leakage resilience in the split-state model, in CRYPTO (2012), pp. 517\u2013532","DOI":"10.1007\/978-3-642-32009-5_30"},{"key":"9361_CR63","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1978","unstructured":"F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, 2nd edition (North-holland Publishing Company, Amsterdam, 1978)","edition":"2"},{"key":"9361_CR64","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-32928-9_9","volume-title":"Security and Cryptography for Networks, volume 7485 of LNCS","author":"S Myers","year":"2012","unstructured":"S. Myers, M. Sergi, A. Shelat, Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness, in I. Visconti and R. De Prisco, editors, Security and Cryptography for Networks, volume 7485 of LNCS. (Springer, Berlin, 2012), pp. 149\u2013165"},{"key":"9361_CR65","doi-asserted-by":"crossref","unstructured":"S. Myers, A. Shelat, Bit encryption is complete, in FOCS (2009), pp. 607\u2013616","DOI":"10.1109\/FOCS.2009.65"},{"key":"9361_CR66","doi-asserted-by":"crossref","unstructured":"M. Naor, M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, in STOC (1990), pp. 427\u2013437","DOI":"10.1145\/100216.100273"},{"key":"9361_CR67","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, G. Persiano, D. Venturi, I. Visconti, Continuously non-malleable codes in the split-state model from minimal assumptions, in CRYPTO (2018), pp. 608\u2013639","DOI":"10.1007\/978-3-319-96878-0_21"},{"key":"9361_CR68","doi-asserted-by":"crossref","unstructured":"R. Pass, A. Shelat, V. Vaikuntanathan, Construction of a non-malleable encryption scheme from any semantically secure one, in CRYPTO (2006), pp. 271\u2013289","DOI":"10.1007\/11818175_16"},{"key":"9361_CR69","doi-asserted-by":"crossref","unstructured":"R. Pass, A. Shelat, V. Vaikuntanathan, Relations among notions of non-malleability for encryption, in ASIACRYPT (2007), pp. 519\u2013535","DOI":"10.1007\/978-3-540-76900-2_32"},{"issue":"6","key":"9361_CR70","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"C. Peikert, B. Waters, Lossy trapdoor functions and their applications. SIAM J. Comput., 40(6), 1803\u20131844 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9361_CR71","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","unstructured":"R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM, 26(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"issue":"7","key":"9361_CR72","doi-asserted-by":"publisher","first-page":"3058","DOI":"10.1137\/100782929","volume":"39","author":"A Rosen","year":"2010","unstructured":"A. Rosen, G. Segev, Chosen-ciphertext security via correlated products. SIAM J. Comput., 39(7), 3058\u20133088 (2010)","journal-title":"SIAM J. Comput."},{"key":"9361_CR73","unstructured":"A. Sahai, Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security, in FOCS (1999), pp. 543\u2013553"},{"issue":"1","key":"9361_CR74","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/18.179365","volume":"39","author":"B-Z Shen","year":"1993","unstructured":"B.-Z. Shen, A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate. IEEE Trans. Inf. Theory, 39(1), 239\u2013242 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9361_CR75","unstructured":"S.P. Vadhan, A Study of Statistical Zero-Knowledge Proofs. PhD thesis, Massachusetts Institute of Technology (1999)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09361-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-020-09361-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-020-09361-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T23:10:26Z","timestamp":1628032226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-020-09361-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,4]]},"references-count":75,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9361"],"URL":"https:\/\/doi.org\/10.1007\/s00145-020-09361-0","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,4]]},"assertion":[{"value":"7 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}