{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:01:28Z","timestamp":1725566488720},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140808"},{"type":"electronic","value":"9783642140815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14081-5_10","type":"book-chapter","created":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T12:22:49Z","timestamp":1285330969000},"page":"145-163","source":"Crossref","is-referenced-by-count":7,"title":["Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Pooya","family":"Farshim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Bellare, M., Neven, G.: Robust encryption. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 480\u2013497. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-11799-2_28"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-40061-5_29","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"S.S. Al-Riyami","year":"2003","unstructured":"Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 452\u2013473. Springer, Heidelberg (2003)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk [16], pp. 26\u201345","DOI":"10.1007\/BFb0055718"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-39200-9_31","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Kohno, T.: A theoretical treatment of related-key attacks: Rka-prps, rka-prfs, and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 491\u2013506. Springer, Heidelberg (2003)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Ristenpart, T.: Simulation without the artificial abort: Simplified proof and improved concrete security for waters\u2019 ibe scheme. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 407\u2013424. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-01001-9_24"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"10_CR8","unstructured":"Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. Cryptology ePrint Archive, Report 2006\/228 (2006), http:\/\/eprint.iacr.org\/2006\/228"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography \u2013 PKC 2008","year":"2008","unstructured":"Cramer, R. (ed.): PKC 2008. LNCS, vol.\u00a04939. Springer, Heidelberg (2008)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk [16], pp. 13\u201325","DOI":"10.1007\/BFb0055717"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Dent, A.W., Libert, B., Paterson, K.G.: Certificateless encryption schemes strongly secure in the standard model. In: Cramer [9], pp. 344\u2013359","DOI":"10.1007\/978-3-540-78440-1_20"},{"issue":"2","key":"10_CR12","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.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 779\u2013790. Springer, Heidelberg (2005)"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00145-002-0204-y","volume":"17","author":"E. Fujisaki","year":"2004","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: Rsa-oaep is secure under the rsa assumption. J. Cryptology\u00a017(2), 81\u2013104 (2004)","journal-title":"J. Cryptology"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201998","year":"1998","unstructured":"Krawczyk, H. (ed.): CRYPTO 1998. LNCS, vol.\u00a01462. Springer, Heidelberg (1998)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-85174-5_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"O. Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive one-way functions and applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 57\u201374. Springer, Heidelberg (2008)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-76900-2_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R. Pass","year":"2007","unstructured":"Pass, R., Shelat, A., Vaikuntanathan, V.: Relations among notions of non-malleability for encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 519\u2013535. Springer, Heidelberg (2007)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Ventre, C., Visconti, I.: Completely non-malleable encryption revisited. In: Cramer [9], pp. 65\u201384","DOI":"10.1007\/978-3-540-78440-1_5"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14081-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:17Z","timestamp":1606168037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14081-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140808","9783642140815"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14081-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}