{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:37:01Z","timestamp":1725493021793},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440505"},{"type":"electronic","value":"9783540457084"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_39","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:48:16Z","timestamp":1192783696000},"page":"613-626","source":"Crossref","is-referenced-by-count":18,"title":["Security Proof for Partial-Domain Hash Signature Schemes"],"prefix":"10.1007","author":[{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"39_CR1","unstructured":"ANSI X9.31, Digital signatures using reversible public-key cryptography for the financial services industry (rDSA), 1998."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Commmunications Security, ACM, 1993.'","DOI":"10.1145\/168588.168596"},{"key":"39_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"The exact security of digital signatures-How to sign with RSA and Rabin","author":"M. Bellare","year":"1996","unstructured":"M. Bellare and P. Rogaway, The exact security of digital signatures-How to sign with RSA and Rabin. Proceedings of Eurocrypt\u201996, LNCS vol. 1070, Springer-Verlag, 1996, pp. 399\u2013416."},{"key":"39_CR4","unstructured":"R. Canetti, O. Goldreich and S. Halevi, The random oracle methodology, revisited, STOC\u2019 98, ACM, 1998."},{"key":"39_CR5","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"On the security of RSA Padding","author":"J.S. Coron","year":"1999","unstructured":"J.S. Coron, D. Naccache and J.P. Stern, On the security of RSA Padding, Proceedings of Crypto\u201999, LNCS vol. 1666, Springer-Verlag, 1999, pp. 1\u201318."},{"key":"39_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"On the exact security of Full Domain Hash","author":"J.S. Coron","year":"2000","unstructured":"J.S. Coron, On the exact security of Full Domain Hash, Proceedings of Crypto 2000, LNCS vol. 1880, Springer-Verlag, 2000, pp. 229\u2013235."},{"key":"39_CR7","unstructured":"J.S. Coron, Security proof for partial-domain hash signature schemes. Full version of this paper. Cryptology ePrint Archive, http:\/\/www.eprint.iacr.org ."},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal of computing, 17(2):281\u2013308, april 1988.","journal-title":"SIAM Journal of computing"},{"key":"39_CR9","unstructured":"G.H. Hardy and E.M. Wright, An introduction to the theory of numbers, Oxford science publications,.fifth edition."},{"key":"39_CR10","unstructured":"K. Hickman, The SSL Protocol, December 1995. Available electronically at: http:\/\/www.netscape.com\/newsref\/std\/ssl.html"},{"key":"39_CR11","unstructured":"ISO\/IEC 9796-2, Information technology-Security techniques-Digital signature scheme giving message recovery, Part 2: Mechanisms using a hash-function, 1997."},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"A.J. Menezes, P. C. van Oorschot and S.A. Vanstone, Handbook of Applied Cryptography, CRC press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"39_CR13","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Public-key cryptosystems based on composite degree residuosity classes","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, proceedings of Eurocrypt\u201999, LNCS 1592, pp. 223\u2013238, 1999."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, CACM 21, 1978.","DOI":"10.21236\/ADA606588"},{"key":"39_CR15","unstructured":"RSA Laboratories, PKCS #1: RSA cryptography speci.cations, version 1.5, November 1993 and version 2.0, September 1998."},{"issue":"194","key":"39_CR16","doi-asserted-by":"publisher","first-page":"823","DOI":"10.2307\/2008412","volume":"56","author":"B. Vall\u00e9e","year":"1991","unstructured":"B. Vall\u00e9e, Generatiosn of elements with small modular squares and provably fast integer factoring algorithms, Mathematics of Computation, vol. 56, number 194, april 1991, pp. 823\u2013849.","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:27:33Z","timestamp":1556918853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}