{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:50:25Z","timestamp":1778215825587,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,21]],"date-time":"2013-12-21T00:00:00Z","timestamp":1387584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00145-013-9173-6","type":"journal-article","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T20:48:23Z","timestamp":1387572503000},"page":"641-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tight Security for Signature Schemes Without Random Oracles"],"prefix":"10.1007","volume":"28","author":[{"given":"Sven","family":"Sch\u00e4ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,21]]},"reference":[{"key":"9173_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/11832072_8","volume-title":"SCN","author":"M.H. Au","year":"2006","unstructured":"M.H. Au, W. Susilo, Y. Mu, Constant-size dynamic k-TAA, in SCN, ed. by R. De Prisco, M. Yung. Lecture Notes in Computer Science, vol.\u00a04116 (Springer, Berlin, 2006), pp. 111\u2013125"},{"key":"9173_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-78967-3_5","volume-title":"EUROCRYPT","author":"D.J. Bernstein","year":"2008","unstructured":"D.J. Bernstein, Proving tight security for Rabin\u2013Williams signatures, in EUROCRYPT, ed. by N.P. Smart. Lecture Notes in Computer Science, vol.\u00a04965 (Springer, Berlin, 2008), pp. 70\u201387"},{"issue":"2","key":"9173_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"D. Boneh, X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol.\n                  21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"9173_CR4","series-title":"Lecture Notes in Computer Science","first-page":"268","volume-title":"SCN","author":"J. Camenisch","year":"2002","unstructured":"J. Camenisch, A. Lysyanskaya, A signature scheme with efficient protocols, in SCN, ed. by S. Cimato, C. Galdi, G. Persiano. Lecture Notes in Computer Science, vol.\u00a02576 (Springer, Berlin, 2002), pp. 268\u2013289"},{"key":"9173_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"CRYPTO","author":"J. Camenisch","year":"2004","unstructured":"J. Camenisch, A. Lysyanskaya, Signature schemes and anonymous credentials from bilinear maps, in CRYPTO, ed. by M.K. Franklin. Lecture Notes in Computer Science, vol.\u00a03152 (Springer, Berlin, 2004), pp. 56\u201372"},{"key":"9173_CR6","doi-asserted-by":"crossref","unstructured":"D. Catalano, D. Fiore, B. Warinschi, Adaptive pseudo-free groups and applications, in Paterson [19], pp.\u00a0207\u2013223","DOI":"10.1007\/978-3-642-20465-4_13"},{"key":"9173_CR7","series-title":"Lecture Notes in Computer Science","first-page":"339","volume-title":"CT-RSA","author":"B. Chevallier-Mames","year":"2007","unstructured":"B. Chevallier-Mames, M. Joye, A practical and tightly secure signature scheme without hash function, in CT-RSA, ed. by M. Abe. Lecture Notes in Computer Science, vol.\u00a04377 (Springer, Berlin, 2007), pp. 339\u2013356"},{"key":"9173_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-45539-6_7","volume-title":"EUROCRYPT","author":"J.-S. Coron","year":"2000","unstructured":"J.-S. Coron, D. Naccache, Security analysis of the Gennaro\u2013Halevi\u2013Rabin signature scheme, in EUROCRYPT, ed. by B. Preneel. Lecture Notes in Computer Science, vol.\u00a01807 (Springer, Berlin, 2000), pp. 91\u2013101"},{"issue":"3","key":"9173_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, V. Shoup, Signature schemes based on the Strong RSA assumption. ACM Trans. Inf. Syst. Secur.\n                  3(3), 161\u2013185 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"9173_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-36288-6_9","volume-title":"Public Key Cryptography","author":"M. Fischlin","year":"2003","unstructured":"M. Fischlin, The Cramer\u2013Shoup Strong-RSA signature scheme revisited, in Public Key Cryptography, ed. by Y. Desmedt. Lecture Notes in Computer Science, vol.\u00a02567 (Springer, Berlin, 2003), pp. 116\u2013129"},{"key":"9173_CR11","first-page":"123","volume-title":"EUROCRYPT","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Halevi, T. Rabin, Secure hash-and-sign signatures without the random oracle, in EUROCRYPT (1999), pp. 123\u2013139"},{"issue":"2","key":"9173_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R.L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\n                  17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"9173_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-85174-5_2","volume-title":"CRYPTO","author":"D. Hofheinz","year":"2008","unstructured":"D. Hofheinz, E. Kiltz, Programmable hash functions and their applications, in CRYPTO, ed. by D. Wagner. Lecture Notes in Computer Science, vol.\u00a05157 (Springer, Berlin, 2008), pp. 21\u201338"},{"issue":"1\u20133","key":"9173_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10623-010-9453-1","volume":"59","author":"M. Joye","year":"2011","unstructured":"M. Joye, How (Not) to design Strong-RSA signatures. Des. Codes Cryptogr.\n                  59(1\u20133), 169\u2013182 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"9173_CR15","volume-title":"NDSS","author":"H. Krawczyk","year":"2000","unstructured":"H. Krawczyk, T. Rabin, Chameleon signatures, in NDSS (The Internet Society, 2000)"},{"key":"9173_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"Selected Areas in Cryptography","author":"A. Lysyanskaya","year":"1999","unstructured":"A. Lysyanskaya, R.L. Rivest, A. Sahai, S. Wolf, Pseudonym systems, in Selected Areas in Cryptography, ed. by H.M. Heys, C.M. Adams. Lecture Notes in Computer Science, vol.\u00a01758 (Springer, Berlin, 1999), pp. 184\u2013199"},{"key":"9173_CR17","first-page":"20","volume-title":"ACM Conference on Computer and Communications Security","author":"D. Naccache","year":"2001","unstructured":"D. Naccache, D. Pointcheval, J. Stern, Twin signatures: an alternative to the hash-and-sign paradigm, in ACM Conference on Computer and Communications Security (2001), pp. 20\u201327"},{"key":"9173_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/11681878_5","volume-title":"TCC","author":"T. Okamoto","year":"2006","unstructured":"T. Okamoto, Efficient blind and partially blind signatures without random oracles, in TCC, ed. by S. Halevi, T. Rabin. Lecture Notes in Computer Science, vol.\u00a03876 (Springer, Berlin, 2006), pp. 80\u201399"},{"key":"9173_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings Advances in Cryptology\u2014EUROCRYPT 2011\u201430th Annual International Conference on the Theory and Applications of Cryptographic Techniques","year":"2011","unstructured":"K.G. Paterson (ed.), Proceedings Advances in Cryptology\u2014EUROCRYPT 2011\u201430th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15\u201319, 2011. Lecture Notes in Computer Science, vol.\u00a06632 (Springer, Berlin, 2011)"},{"issue":"1","key":"9173_CR20","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/2371291","volume":"63","author":"B. Rosser","year":"1941","unstructured":"B. Rosser, Explicit bounds for some functions of prime numbers. Am. J. Math.\n                  63(1), 211\u2013232 (1941)","journal-title":"Am. J. Math."},{"key":"9173_CR21","doi-asserted-by":"crossref","unstructured":"S. Sch\u00e4ge, Tight proofs for signature schemes without random oracles, in Paterson [19], pp. 189\u2013206","DOI":"10.1007\/978-3-642-20465-4_12"},{"key":"9173_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-44647-8_21","volume-title":"CRYPTO","author":"A. Shamir","year":"2001","unstructured":"A. Shamir, Y. Tauman, Improved online\/offline signature schemes, in CRYPTO, ed. by J. Kilian. Lecture Notes in Computer Science, vol.\u00a02139 (Springer, Berlin, 2001), pp. 355\u2013367"},{"issue":"4","key":"9173_CR23","first-page":"484","volume":"10","author":"H. Zhu","year":"2001","unstructured":"H. Zhu, New digital signature scheme attaining immunity to adaptive-chosen message attack. Chin. J. Electron.\n                  10(4), 484\u2013486 (2001)","journal-title":"Chin. J. Electron."},{"key":"9173_CR24","unstructured":"H. Zhu, A formal proof of Zhu\u2019s signature scheme. Cryptology ePrint Archive, Report 2003\/155 (2003). \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9173-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9173-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9173-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9173-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:15:50Z","timestamp":1586333750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9173-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,21]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9173"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9173-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,21]]},"assertion":[{"value":"31 July 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}