{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T17:02:37Z","timestamp":1768323757883,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11745853_22","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"330-346","source":"Crossref","is-referenced-by-count":41,"title":["New Online\/Offline Signature Schemes Without Random Oracles"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Katja","family":"Schmidt-Samoa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","first-page":"366","volume-title":"Advances in Cryptology - EUROCRYPT 1997","author":"N. Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 366\u2013377. Springer, Heidelberg (1997)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proc. of the 1st ACM Conference on Computer and Communications Security (CCS)","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. of the 1st ACM Conference on Computer and Communications Security (CCS), pp. 62\u201373. ACM Press, New York (1993)"},{"key":"22_CR3","first-page":"209","volume-title":"Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC 1998)","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 209\u2013218. ACM Press, New York (1998)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24638-1_3","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: On the random-oracle methodology as applied to length-restricted signature schemes. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 40\u201357. Springer, Heidelberg (2004)"},{"key":"22_CR5","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. Camenisch","year":"2002","unstructured":"Camenisch, J., 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 (2002)"},{"key":"22_CR6","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)"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent rsa vulnerabilities. J. Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the strong RSA assumption. In: ACM Conference on Computer and Communications Security, pp. 46\u201351 (1999)","DOI":"10.1145\/319709.319716"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","first-page":"203","volume-title":"Advances in Cryptology - EUROCRYPT 1987","author":"I. Damg\u00e5rd","year":"1987","unstructured":"Damg\u00e5rd, I.: Collision free hash functions and public key signature schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1987)"},{"issue":"1","key":"22_CR10","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(1), 35\u201367 (1996)","journal-title":"Journal of Cryptology"},{"key":"22_CR11","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":"22_CR12","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 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)"},{"issue":"2","key":"22_CR13","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":"22_CR14","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: Proc. of the Symposium on Network and Distributed Systems Security (NDSS), The Internet Society (2000)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Schmidt-Samoa, K.: New online\/offline signature schemes without random oracles. Cryptology ePrint Archive (2006), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/11745853_22"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO 1994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"22_CR17","first-page":"234","volume-title":"Proc. of the 7th annual ACM symposium on Theory of computing (STOC 1975)","author":"G.L. Miller","year":"1975","unstructured":"Miller, G.L.: Riemann\u2019s hypothesis and tests for primality. In: Proc. of the 7th annual ACM symposium on Theory of computing (STOC 1975), pp. 234\u2013239. ACM Press, New York (1975)"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s001459900056","volume":"12","author":"V. Shoup","year":"1999","unstructured":"Shoup, V.: On the security of a practical identification scheme. J. Cryptology\u00a012(4), 247\u2013260 (1999)","journal-title":"J. Cryptology"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11554868_21","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"K. Schmidt-Samoa","year":"2005","unstructured":"Schmidt-Samoa, K., Takagi, T.: Paillier\u2019s cryptosystem modulo p2q and its applications to trapdoor commitment schemes. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 296\u2013313. Springer, Heidelberg (2005)"},{"key":"22_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T01:01:48Z","timestamp":1555549308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11745853_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}