{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:25:24Z","timestamp":1742959524949,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540689133"},{"type":"electronic","value":"9783540689140"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68914-0_14","type":"book-chapter","created":{"date-parts":[[2008,5,26]],"date-time":"2008-05-26T04:58:06Z","timestamp":1211777886000},"page":"224-241","source":"Crossref","is-referenced-by-count":1,"title":["Generic Security-Amplifying Methods of Ordinary Digital Signatures"],"prefix":"10.1007","author":[{"given":"Jin","family":"Li","sequence":"first","affiliation":[]},{"given":"Kwangjo","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Duncan S.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/147508.147537","volume":"39","author":"M. Bellare","year":"1992","unstructured":"Bellare, M., Micali, S.: How to Sign Given Any Trapdoor Function. J. of the ACM\u00a039, 214\u2013233 (1992)","journal-title":"J. of the ACM"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"ACM CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: ACM CCS 1993, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"14_CR3","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":"14_CR4","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":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from The Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11745853_15","volume-title":"Public Key Cryptography - PKC 2006","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Shen, E., Waters, B.: Strongly Unforgeable Signatures Based on Computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 229\u2013240. Springer, Heidelberg (2006)"},{"key":"14_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. Camenisch","year":"2004","unstructured":"Camenisch, J., 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":"14_CR9","first-page":"207","volume-title":"STOC 1998","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. In: STOC 1998, pp. 207\u2013221. ACM, New York (1998)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11967668_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"B. Chevallier-Mames","year":"2006","unstructured":"Chevallier-Mames, B., Joye, M.: A Practical and Tightly Secure Signature Scheme without Hash Function. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 339\u2013356. Springer, Heidelberg (2006)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-45539-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S., Naccache, D.: Security Analysis of The Gennaro-Halevi-Rabin Signature Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 91\u2013101. Springer, Heidelberg (2000)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-44750-4_24","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"R. Cramer","year":"1995","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secure Signature Schemes Based on Interactive Protocols. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 297\u2013310. Springer, Heidelberg (1995)"},{"issue":"3","key":"14_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 TISSEC\u00a03(3), 161\u2013185 (2000); Extended abstract. In: Sixth ACM Conference on Computer and Communication Security (1999)","journal-title":"ACM TISSEC"},{"key":"14_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. Journal of Cryptology\u00a09, 35\u201367 (1996)","journal-title":"Journal of Cryptology"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology - EUROCRYPT 1999","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)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-39200-9_25","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"E.-J. Goh","year":"2003","unstructured":"Goh, E.-J., Jarecki, S.: A Signature Scheme as Secure as The Diffie-Hellman Problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 401\u2013415. Springer, Heidelberg (2003)"},{"issue":"2","key":"14_CR18","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. Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Computing"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/3-540-48071-4_16","volume-title":"Advances in Cryptology - CRYPTO 1992","author":"S. Goldwasser","year":"1993","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 228\u2013239. Springer, Heidelberg (1993)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72738-5_1","volume-title":"Applied Cryptography and Network Security","author":"Q. Huang","year":"2007","unstructured":"Huang, Q., Wong, D.S., Zhao, Y.: Generic Transformation to Strongly Unforgeable Signatures. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 1\u201317. Springer, Heidelberg (2007)"},{"key":"14_CR21","unstructured":"Lamport, L.: Constructing Digital Signatures from a One Way Function. Technical Report CSL-98, SRI International (1979)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/11751595_34","volume-title":"Computational Science and Its Applications - ICCSA 2006","author":"J. Li","year":"2006","unstructured":"Li, J., Chan, Y.Y., Wang, Y.: A Generic Construction of Secure Signatures Without Random Oracles. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Lagan\u00e1, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol.\u00a03982, pp. 309\u2013317. Springer, Heidelberg (2006)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-39200-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: A Simpler Construction of CCA2-Secure Pulic Key Encryption under General Assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 241\u2013254. Springer, Heidelberg (2003)"},{"key":"14_CR24","unstructured":"Krawczyk, H., Rabin, T.: Chameleon Hashing and Signatures. In: Proc. of NDSS 2000, Internet Society (1998), \n                  \n                    http:\/\/eprint.iacr.org\/1998\/010"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/501983.501987","volume-title":"ACM Conference on Computer and Communications Security 2001","author":"D. Naccache","year":"2001","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 2001, pp. 20\u201327. ACM, New York (2001)"},{"key":"14_CR26","first-page":"33","volume-title":"ACM symposium on Theory of Computing","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal One-Way Hash Functions and Their Cryptographic Applications. In: ACM symposium on Theory of Computing, pp. 33\u201343. ACM Press, New York (1989)"},{"key":"14_CR27","first-page":"28","volume-title":"Eighth ACM Conference on Computer and Communication Security","author":"A. Perrig","year":"2001","unstructured":"Perrig, A.: The BiBa One-Time Signature and Broadcast Authentication Protocol. In: Eighth ACM Conference on Computer and Communication Security, pp. 28\u201337. ACM, New York (2001)"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signature and Pulbic Key Cryptosystems. Comm. of ACM, 120\u2013126 (1978)","DOI":"10.1145\/359340.359342"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"14_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":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/11967668_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"R. Steinfeld","year":"2006","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 357\u2013371. Springer, Heidelberg (2006)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F. Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 277\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68914-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:33:42Z","timestamp":1558265622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68914-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540689133","9783540689140"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68914-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}