{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:20Z","timestamp":1759637900708},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300561"},{"type":"electronic","value":"9783642300578"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30057-8_6","type":"book-chapter","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T17:05:50Z","timestamp":1337360750000},"page":"84-101","source":"Crossref","is-referenced-by-count":3,"title":["Strong Security from Probabilistic Signature Schemes"],"prefix":"10.1007","author":[{"given":"Sven","family":"Sch\u00e4ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/BFb0052256","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Rogaway, P.: Collision-Resistant Hashing: Towards Making UOWHFs Practical. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 470\u2013484. Springer, Heidelberg (1997)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-71677-8_14","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Shoup, S.: Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 201\u2013216. Springer, Heidelberg (2007)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-78967-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J.: Proving Tight Security for Rabin-Williams Signatures. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 70\u201387. Springer, Heidelberg (2008)"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptology\u00a021(2), 149\u2013177 (2008)","journal-title":"J. Cryptology"},{"key":"6_CR6","unstructured":"Brakerski, Z., Kalai, Y.T.: A framework for efficient signatures, ring signatures and identity based encryption in the standard model. Cryptology ePrint Archive, Report 2010\/086 (February 2010), \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                   (version from February 13, 2010)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J.L. Camenisch","year":"2003","unstructured":"Camenisch, J.L., Lysyanskaya, A.: A Signature Scheme with Efficient Protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"key":"6_CR8","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":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J.L. Camenisch","year":"2004","unstructured":"Camenisch, J.L., Lysyanskaya, A.: Signature Schemes and Anonymous Credentials from Bilinear Maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 56\u201372. Springer, Heidelberg (2004)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11761679_11","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S. Contini","year":"2006","unstructured":"Contini, S., Lenstra, A.K., Steinfeld, R.: VSH, an Efficient and Provable Collision-Resistant Hash Function. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 165\u2013182. Springer, Heidelberg (2006)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","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":"Coron, J.-S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 229\u2013235. Springer, Heidelberg (2000)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","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":"Coron, J.-S.: Optimal Security Proofs for PSS and Other Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-62494-5_9","volume-title":"Security Protocols","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Damg\u00e5rd, I., Pedersen, T.P.: Efficient and Provable Security Amplifications. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol.\u00a01189, pp. 101\u2013109. Springer, Heidelberg (1997)"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the Strong RSA assumption. ACM Trans. Inf. Syst. Secur.\u00a03(3), 161\u2013185 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02254791","volume":"9","author":"S. Even","year":"1996","unstructured":"Even, S., Goldreich, O., Micali, S.: On-line\/off-line digital signatures. J. Cryptology\u00a09(1), 35\u201367 (1996)","journal-title":"J. Cryptology"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-36288-6_9","volume-title":"Public Key Cryptography - PKC 2003","author":"M. Fischlin","year":"2003","unstructured":"Fischlin, M.: The Cramer-Shoup Strong-RSA Signature Scheme Revisited. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 116\u2013129. Springer, Heidelberg (2003)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Halevi, S., Rabin, T.: Secure Hash-and-Sign Signatures without the Random Oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 123\u2013139. Springer, Heidelberg (1999)"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-642-25385-0_35","volume-title":"ASIACRYPT 2011","author":"D. Hofheinz","year":"2011","unstructured":"Hofheinz, D., Jager, T., Kiltz, E.: Short Signatures From Weaker Assumptions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 647\u2013666. Springer, Heidelberg (2011)"},{"key":"6_CR19","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":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D. Hofheinz","year":"2008","unstructured":"Hofheinz, D., Kiltz, E.: Programmable Hash Functions and Their Applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 21\u201338. Springer, Heidelberg (2008)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-01001-9_19","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"S. Hohenberger","year":"2009","unstructured":"Hohenberger, S., Waters, B.: Realizing Hash-and-Sign Signatures under Standard Assumptions. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 333\u2013350. Springer, Heidelberg (2009)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-03356-8_38","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"S. Hohenberger","year":"2009","unstructured":"Hohenberger, S., Waters, B.: Short and Stateless Signatures from the RSA Assumption. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 654\u2013670. Springer, Heidelberg (2009)"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s11390-008-9126-y","volume":"23","author":"Q. Huang","year":"2008","unstructured":"Huang, Q., Wong, D.S., Li, J., Zhao, Y.: Generic transformation from weakly to strongly unforgeable signatures. J. Comput. Sci. Technol.\u00a023(2), 240\u2013252 (2008)","journal-title":"J. Comput. Sci. Technol."},{"key":"6_CR23","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS. The Internet Society (2000)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11745853_10","volume-title":"Public Key Cryptography - PKC 2006","author":"I. Mironov","year":"2006","unstructured":"Mironov, I.: Collision-Resistant No More: Hash-and-Sign Paradigm Revisited. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 140\u2013156. Springer, Heidelberg (2006)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Naccache, D., Pointcheval, D., Stern, J.: Twin signatures: an alternative to the hash-and-sign paradigm. In: ACM Conference on Computer and Communications Security, pp. 20\u201327 (2001)","DOI":"10.1145\/501983.501987"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC, pp. 33\u201343. ACM (1989)","DOI":"10.1145\/73007.73011"},{"issue":"2","key":"6_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394. ACM (1990)","DOI":"10.1145\/100216.100269"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-04642-1_10","volume-title":"Provable Security","author":"S. Sch\u00e4ge","year":"2009","unstructured":"Sch\u00e4ge, S.: Twin Signature Schemes, Revisited. In: Pieprzyk, J., Zhang, F. (eds.) ProvSec 2009. LNCS, vol.\u00a05848, pp. 104\u2013117. Springer, Heidelberg (2009)"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-20465-4_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"S. Sch\u00e4ge","year":"2011","unstructured":"Sch\u00e4ge, S.: Tight Proofs for Signature Schemes without Random Oracles. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 189\u2013206. Springer, Heidelberg (2011)"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-44647-8_21","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Shamir","year":"2001","unstructured":"Shamir, A., Tauman, Y.: Improved Online\/Offline Signature Schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 355\u2013367. Springer, Heidelberg (2001)"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient Identity-Based Encryption Without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"issue":"4","key":"6_CR34","first-page":"484","volume":"10","author":"H. Zhu","year":"2001","unstructured":"Zhu, H.: New digital signature scheme attaining immunity to adaptive-chosen message attack. Chinese Journal of Electronics\u00a010(4), 484\u2013486 (2001)","journal-title":"Chinese Journal of Electronics"},{"key":"6_CR35","unstructured":"Zhu, H.: A formal proof of Zhu\u2019s signature scheme. Cryptology ePrint Archive, Report 2003\/155 (2003), \n                    \n                      http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30057-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:26:14Z","timestamp":1620127574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30057-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300561","9783642300578"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}