{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T22:24:09Z","timestamp":1748298249797},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784395"},{"type":"electronic","value":"9783540784401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78440-1_5","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T05:53:32Z","timestamp":1204005212000},"page":"65-84","source":"Crossref","is-referenced-by-count":10,"title":["Completely Non-malleable Encryption Revisited"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Ventre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Proc. of STOC, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"key":"5_CR2","first-page":"543","volume-title":"40th Symposium on Foundations of Computer Science, (FOCS 1999)","author":"A. Sahai","year":"1999","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: 40th Symposium on Foundations of Computer Science (FOCS 1999), 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, pp. 543\u2013553. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/11523468_63","volume-title":"Automata, Languages and Programming","author":"M. Fischlin","year":"2005","unstructured":"Fischlin, M.: Completely non-malleable schemes. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 779\u2013790. Springer, Heidelberg (2005)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"5_CR6","volume-title":"47th","author":"B. Barak","year":"2006","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: 47th, IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-540-24676-3_11","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 171\u2013188. Springer, Heidelberg (2004)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: STOC, pp. 209\u2013218 (1998)","DOI":"10.1145\/276698.276741"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"5_CR10","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the fiat-shamir paradigm. In: FOCS (2003)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A Practical Public-Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","first-page":"92","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 92\u2013111. Springer, Heidelberg (1994)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: Rsa-oaep is secure under the rsa assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-48405-1_33","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 519\u2013536. Springer, Heidelberg (1999)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: Completely non-malleable schemes. Technical report, Full version of [4] (2005)","DOI":"10.1007\/11523468_63"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: Proc. of STOC, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: Proc. of FOCS, pp. 563\u2013572 (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"5_CR18","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Concurrent non-malleable witness indistinguishability and its applications. Technical Report TR06-095, ECCC (2006)"},{"key":"5_CR19","unstructured":"Katz, J.: Efficient Cryptographic Protocols Preventing Man-in-the-Middel Attacks, Ph.D. Thesis. Columbia University (2002)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-39200-9_13","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"J. Katz","year":"2003","unstructured":"Katz, J.: Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 211\u2013228. Springer, Heidelberg (2003)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proc. of STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/276698.276853","volume-title":"30th ACM Symposium on Theory of Computing (STOC 1998)","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 409\u2013418. ACM Press, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78440-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:09Z","timestamp":1619507349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78440-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784395","9783540784401"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78440-1_5","relation":{},"subject":[]}}