{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:24:46Z","timestamp":1598477086502},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648925","type":"print"},{"value":"9783540684626","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055717","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T21:12:36Z","timestamp":1154034756000},"page":"13-25","source":"Crossref","is-referenced-by-count":632,"title":["A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"2_CR1","unstructured":"N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In Advances in Cryptology-Eurocrypt '98, 1998.","DOI":"10.1007\/BFb0054156","doi-asserted-by":"crossref"},{"key":"2_CR2","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","doi-asserted-by":"crossref"},{"key":"2_CR3","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","doi-asserted-by":"crossref"},{"key":"2_CR4","unstructured":"M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology \u2014 Crypto '94, pages 92\u2013111, 1994.","DOI":"10.1007\/BFb0053428","doi-asserted-by":"crossref"},{"key":"2_CR5","unstructured":"M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. In Advances in Cryptology-Crypto '97, 1997.","DOI":"10.1007\/BFb0052256","doi-asserted-by":"crossref"},{"key":"2_CR6","unstructured":"D. Boneh and R. Venkatesan. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In Advances in Cryptology-Crypto '96, pages 129\u2013142, 1996.","DOI":"10.1007\/3-540-68697-5_11","doi-asserted-by":"crossref"},{"key":"2_CR7","unstructured":"R. Canetti, O. Goldreich, and S. Halevi. The random oracle model, revisted. In 30th Annual ACM Symposium on Theory of Computing, 1998. To appear."},{"key":"2_CR8","unstructured":"I. Damgard. Towards practical public key cryptosystems secure against chosen ciphertext attacks. In Advances in Cryptology-Crypto '91, pages 445\u2013456, 1991.","DOI":"10.1007\/3-540-46766-1_36","doi-asserted-by":"crossref"},{"key":"2_CR9","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","doi-asserted-by":"crossref"},{"key":"2_CR10","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography, 1998. Manuscript (updated, full length version of STOC paper)."},{"key":"2_CR11","unstructured":"C. Dwork and M. Naor. Method for message authentication from non-malleable cryptosystems, 1996. U. S. Patent No. 05539826."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"T. El Gamal. A public key cryptosystem and signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31:469\u2013472, 1985.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR13","unstructured":"Y. Frankel and M. Yung. Cryptanalysis of immunized LL public key systems. In Advances in Cryptology-Crypto '95, pages 287\u2013296, 1995.","DOI":"10.1007\/3-540-44750-4_23","doi-asserted-by":"crossref"},{"key":"2_CR14","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 and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR15","unstructured":"R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random number generation from any one-way function. In 21st Annual ACM Symposium on Theory of Computing, pages 12\u201324, 1989.","DOI":"10.1145\/73007.73009","doi-asserted-by":"crossref"},{"key":"2_CR16","unstructured":"C. H. Lim and P. J. Lee. Another method for attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-Crypto '93, pages 420\u2013434, 1993.","DOI":"10.1007\/3-540-48329-2_36","doi-asserted-by":"crossref"},{"key":"2_CR17","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","doi-asserted-by":"crossref"},{"key":"2_CR18","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","doi-asserted-by":"crossref"},{"key":"2_CR19","unstructured":"M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd Annual ACM Symposium on Theory of Computing, pages 427\u2013437, 1990.","DOI":"10.1145\/100216.100273","doi-asserted-by":"crossref"},{"key":"2_CR20","unstructured":"C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology-Crypto '91, pages 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35","doi-asserted-by":"crossref"},{"key":"2_CR21","unstructured":"V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-Eurocrypt '97, 1997.","DOI":"10.1007\/3-540-69053-0_18","doi-asserted-by":"crossref"},{"key":"2_CR22","unstructured":"V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. In Advances in Cryptology-Eurocrypt '98, 1998.","DOI":"10.1007\/BFb0054113","doi-asserted-by":"crossref"},{"key":"2_CR23","unstructured":"M. Stadler. Publicly verifiable secrete sharing. In Advances in Cryptology-Eurocrypt '96, pages 190\u2013199, 1996.","DOI":"10.1007\/3-540-68339-9_17","doi-asserted-by":"crossref"},{"key":"2_CR24","unstructured":"Y. Zheng and J. Seberry. Practical approaches to attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology-Crypto '92, pages 292\u2013304, 1992.","DOI":"10.1007\/3-540-48071-4_20","doi-asserted-by":"crossref"}],"container-title":["Advances in Cryptology \u2014 CRYPTO '98","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T09:08:52Z","timestamp":1555751332000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":24,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0055717","relation":{"cites":[]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}]}}