{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T13:28:40Z","timestamp":1778160520471,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540675174","type":"print"},{"value":"9783540455394","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45539-6_19","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:26:08Z","timestamp":1184603168000},"page":"275-288","source":"Crossref","is-referenced-by-count":84,"title":["Using Hash Functions as a Hedge against Chosen Ciphertext Attack"],"prefix":"10.1007","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,12]]},"reference":[{"key":"19_CR1","unstructured":"M. Abdalla, M. Bellare, and P. Rogaway. DHAES: an encryption scheme based on the Diffie-Hellma problem. Submission to IEEE P1363, 1998."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti, and H. Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In 30th Annual ACM Symposium on Theory of Computing, 1998.","DOI":"10.1145\/276698.276854"},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Ants-III","author":"D. Boneh","year":"1998","unstructured":"D. Boneh. The Decision Diffie-Hellman Problem. In Ants-III, pages 48\u201363, 1998. Springer LNCS 1423."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology-Crypto\u2019 94, pages 92\u2013111, 1994.","DOI":"10.1007\/BFb0053428"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. In Advances in Cryptology\u2014Crypto\u2019 97, 1997.","DOI":"10.1007\/BFb0052256"},{"key":"19_CR7","unstructured":"S. Brands. An efficient off-line electronic cash system based on the representation problem, 1993. CWI Technical Report, CS-R9323."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology-Crypto\u2019 98, pages 13\u201325, 1998.","DOI":"10.1007\/BFb0055717"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In 6th ACM Conf. on Computer and Communications Security, 1999.","DOI":"10.1145\/319709.319716"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In 23rd Annual ACM Symposium on Theory of Computing, pages 542\u2013552, 1991.","DOI":"10.1145\/103418.103474"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Info. Theory, 22:644\u2013654, 1976.","journal-title":"IEEE Trans. Info. Theory"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00124891","volume":"2","author":"W. Diffie","year":"1992","unstructured":"W. Diffie, P. van Oorschot, and M. Wiener. Authentication and authenticated key exchange. Designs, Code, and Cryptography, 2:107\u2013125, 1992.","journal-title":"Designs, Code, and Cryptography"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. In Advances in Cryptology-Crypto\u2019 99, pages 537\u2013554, 1999.","DOI":"10.1007\/3-540-48405-1_34"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckermann. How to recycle random bits. In 30th Annual Symposium on Foundations of Computer Science, pages 248\u2013253, 1989.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology\u2014Crypto\u2019 94, pages 129\u2013139, 1994.","DOI":"10.1007\/3-540-48658-5_15"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"C. H. Lim and P. J. Lee. More flexible exponentiation with precomputation. In Advances in Cryptology-Crypto\u2019 94, pages 95\u2013107, 1994.","DOI":"10.1007\/3-540-48658-5_11"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.","DOI":"10.1515\/9780691206844"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"U. Maurer. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In Advances in Cryptology-Crypto\u2019 94, pages 271\u2013281, 1994.","DOI":"10.1007\/3-540-48658-5_26"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"U. Maurer and S. Wolf. Diffie-Hellman oracles. In Advances in Cryptology-Crypto\u2019 96, pages 268\u2013282, 1996.","DOI":"10.1007\/3-540-68697-5_21"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, 1997.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st Annual ACM Symposium on Theory of Computing, 1989.","DOI":"10.1145\/73007.73011"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology-Crypto\u2019 91, pages 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Advances in Cryptology\u2014Eurocrypt\u2019 98, 1998.","DOI":"10.1007\/BFb0054113"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology\u2014Eurocrypt\u2019 97, 1997.","DOI":"10.1007\/3-540-69053-0_18"},{"key":"19_CR25","unstructured":"V. Shoup. On formal models for secure key exchange. IBM Research Report RZ 3120, April 1999."},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"V. Shoup. A composition theorem for universal one-way hash functions. In Advances in Cryptology\u2014Eurocrypt 2000, pages 445\u2013452, 2000.","DOI":"10.1007\/3-540-45539-6_32"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"M. Stadler. Publicly verifible secret sharing. In Advances in Cryptology\u2014Eurocrypt\u2019 96, pages 190\u2013199, 1996.","DOI":"10.1007\/3-540-68339-9_17"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Y. Tsiounis and M. Yung. On the security of ElGamal based encryption. In PKC\u2019 98, 1998.","DOI":"10.1007\/BFb0054019"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Y. Zheng and J. Seberry. Practical approaches to attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-Crypto\u2019 92, pages 292\u2013304, 1992.","DOI":"10.1007\/3-540-48071-4_20"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45539-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T01:50:19Z","timestamp":1587779419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45539-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675174","9783540455394"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-45539-6_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}