{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:50Z","timestamp":1725487430309},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004202"},{"type":"electronic","value":"9783540364139"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36413-7_5","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:44:57Z","timestamp":1184600697000},"page":"55-73","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["On the Power of Claw-Free Permutations"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Silvio Micali. How to sign given any trapdoor function. In Goldwasser [Gol88], pages 200\u2013215.","key":"5_CR1","DOI":"10.1007\/0-387-34799-2_15"},{"doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communication Security, pages 62\u201373, November 1993. Revised version available from http:\/\/www.cs.ucsd.edu\/~mihir\/.","key":"5_CR2","DOI":"10.1145\/168588.168596"},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology-EUROCRYPT 96","author":"M. Bellare","year":"2000","unstructured":"Mihir Bellare and Phillip Rogaway. The exact security of digital signatures: How to sign with RSA and Rabin. In Ueli Maurer, editor, Advances in Cryptology-EUROCRYPT 96, volume 1070 of Lecture Notes in Computer Science, pages 399\u2013416. Springer-Verlag, 12-16 May 1996. Revised version appears in http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/crypto-papers.html."},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology-CRYPTO 2000","author":"J.-S. Coron","year":"2000","unstructured":"Jean-S\u00e9bastian Coron. On the exact security of full domain hash. In Mihir Bellare, editor, Advances in Cryptology-CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 229\u2013235. Springer-Verlag, 20\u201324 August 2000."},{"key":"5_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-46035-7_18","volume-title":"Advances in Cryptology-EUROCRYPT 2002","author":"J.-S. Coron","year":"2002","unstructured":"Jean-S\u00e9bastian Coron. Optimal security proofs for PSS and other signature schemes. In Lars Knudsen, editor, Advances in Cryptology-EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 272\u2013287. Springer-Verlag, 28 April-2 May 2002."},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT 87","author":"I. Damg\u00e5rd","year":"1988","unstructured":"Ivan Damg\u00e5rd. Collision-free hash functions and public-key signature schemes. In David Chaum and Wyn L. Price, editors, Advances in Cryptology-EUROCRYPT 87, volume 304 of Lecture Notes in Computer Science. Springer-Verlag, 1988, 13-15 April 1987."},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology-CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Andrew M. Odlyzko, editor, Advances in Cryptology-CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 186\u2013194. Springer-Verlag, 1987, 11-15 August 1986."},{"unstructured":"Rosario Gennaro, Yael Gertner, and Jonathan Katz. Bounds on the efficiency of encryption and digital signatures. Technical Report 2002-22, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, 2002. Available from http:\/\/dimacs.rutgers.edu\/TechnicalReports\/2002.html.","key":"5_CR8"},{"doi-asserted-by":"crossref","unstructured":"Sha. Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, April 1988.","key":"5_CR9","DOI":"10.1137\/0217017"},{"doi-asserted-by":"crossref","unstructured":"Yael Gertner, Tal Malkin, and Omer Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. In 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, October 2001. IEEE.","key":"5_CR10","DOI":"10.1109\/SFCS.2001.959887"},{"volume-title":"Advances in Cryptology-CRYPTO\u2019 88","year":"1990","unstructured":"Sha. Goldwasser, editor. Advances in Cryptology-CRYPTO\u2019 88, volume 403 of Lecture Notes in Computer Science. Springer-Verlag, 1990, 21-25 August 1988.","series-title":"Lect Notes Comput Sci","key":"5_CR11"},{"doi-asserted-by":"crossref","unstructured":"Louis Claude Guillou and Jean-Jacques Quisquater. A \u201cparadoxical\u201d indentity-based signature scheme resulting from zero-knowledge. In Goldwasser [Gol88], pages 216\u2013231.","key":"5_CR12","DOI":"10.1007\/0-387-34799-2_16"},{"unstructured":"Rosario Gennaro and Luca Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. In 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, November 2000. IEEE.","key":"5_CR13"},{"unstructured":"Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In [ACM89], pages 44\u201361.","key":"5_CR14"},{"unstructured":"Hugo Krawczyk and Tal Rabin. Chameleon signatures. In Network and Distributed System Security Symposium, pages 143\u2013154. The Internet Society, 2000.","key":"5_CR15"},{"unstructured":"Jeong Han Kim, Daniel R. Simon, and Prasad Tetali. Limits on the efficiency of one-way permutation-based hash functions. In 40th Annual Symposium on Foundations of Computer Science, New York, October 1999. IEEE.","key":"5_CR16"},{"unstructured":"Silvio Micali. A secure and efficient digital signature algorithm. Technical Report MIT\/LCS\/TM-501, Massachusetts Institute of Technology, Cambridge, MA, March 1994.","key":"5_CR17"},{"key":"5_CR18","first-page":"1","volume":"15","author":"S. Micali","year":"2002","unstructured":"Silvio Micali and Leonid Reyzin. Improving the exact security of digital signature schemes.Journal of Cryptology, 15:1\u201318, 2002. au]NY89._Moni Naor and Moti Yung. Universal one-way hash functions and their cryptographic applications. In [ACM89], pages 33\u201343.","journal-title":"Improving the exact security of digital signature schemes"},{"key":"5_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-46877-3_38","volume-title":"Advances in Cryptology-EUROCRYPT 90","author":"H. Ong","year":"1991","unstructured":"Heidroon Ong and Claus P. Schnorr. Fast signature generation with a Fiat Shamir-like scheme. In I. B. Damg\u00e5rd, editor, Advances in Cryptology-EUROCRYPT 90, volume 473 of Lecture Notes in Computer Science, pages 432\u2013440. Springer-Verlag, 1991, 21-24 May 1990."},{"key":"5_CR20","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Jacques Stern, editor, Advances in Cryptology-EUROCRYPT\u201999, volume 1592 of Lecture Notes in Computer Science. Springer-Verlag, 2-6 May 1999."},{"doi-asserted-by":"crossref","unstructured":"John Rompel. One-way functions are necessary and suficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 387\u2013394, Baltimore, Maryland, 14-16 May 1990.","key":"5_CR21","DOI":"10.1145\/100216.100269"},{"key":"5_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-EUROCRYPT 98","author":"D. R. Simon","year":"1998","unstructured":"Daniel R. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions. In Kaisa Nyberg, editor, Advances in Cryptology-EUROCRYPT 98, volume 1403 of Lecture Notes in Computer Science. Springer-Verlag, May 31-June 4 1998."}],"container-title":["Lecture Notes in Computer Science","Security in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36413-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T05:06:10Z","timestamp":1609909570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36413-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004202","9783540364139"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36413-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"14 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}