{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:33Z","timestamp":1778215773134,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540244547","type":"print"},{"value":"9783540305804","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30580-4_22","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T15:51:09Z","timestamp":1278345069000},"page":"313-327","source":"Crossref","is-referenced-by-count":7,"title":["Cramer-Damg\u00e5rd Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring"],"prefix":"10.1007","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. Efficient Algorithms, vol.\u00a01. MIT Press, Cambridge (1996)"},{"issue":"1","key":"22_CR2","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 permutation. Journal of the ACM\u00a039(1), 214\u2013233 (1992)","journal-title":"Journal of the ACM"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A paradigm for designing efficient protocols. In: Proc. of First ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. In: Proc. 30th ACM Symposium on Theory of Computing (1998)","DOI":"10.1145\/276698.276741"},{"key":"22_CR5","unstructured":"Cramer, R.: Modular design of secure yet practical cryptographic protocols. Ph.D. Thesis, University of Amsterdam (1996)"},{"key":"22_CR6","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)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/3-540-68697-5_14","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Damg\u00e5rd, I.: New generation of secure and practical RSA-based signatures. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 173\u2013185. Springer, Heidelberg (1996)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Signature schemes based on the Strong RSA assumption. In: Proc. of 6th ACM Conference on Computer and Communication Security 1999 (1999)","DOI":"10.1145\/319709.319716"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I. Damg\u00e5rd","year":"1988","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 (1988)"},{"issue":"6","key":"22_CR10","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory IT"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s001459900043","volume":"11","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M.: An efficient existentially unforgeable signature scheme and its applications. J. of Cryptology\u00a011(3), 187\u2013208 (1998)","journal-title":"J. of Cryptology"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"22_CR13","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":"22_CR14","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.: A digital signature scheme secure against adaptive chosen message attacks. SIAM J. on Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. on Computing"},{"key":"22_CR15","unstructured":"Koblitz, N.: A course in number theory and cryptography, 2nd edn. Springer, Heidelberg"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"R. Merkle","year":"1988","unstructured":"Merkle, R.: A Digital Signature based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 369\u2013378. Springer, Heidelberg (1988)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/288090.288106","volume-title":"Proc. of the 5th ACM conference on on computer and communication security","author":"D. Naccache","year":"1998","unstructured":"Naccache, D., Stern, J.: A new cryptosystem based on higher residues. In: Proc. of the 5th ACM conference on on computer and communication security, pp. 59\u201366. ACM press, New York (1998)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proc. of 21st ACM STOC, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B.: Digital Signatures Schemes - General Framework and Fail-Stop Signatures. In: Pfitzmann, B. (ed.) Digital Signature Schemes. LNCS, vol.\u00a01100. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0024626"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. J. of Cryptology\u00a013(3), 361\u2013396 (Summer 2000)","DOI":"10.1007\/s001450010003"},{"key":"22_CR21","unstructured":"Rabin, M.: Digital Signatures and Public Key Encryptions as Intractable as Factorization. MIT Technical Report no. 212 (1979)"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adelman, L.: A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM\u00a021, 120\u2013126 (1978)","journal-title":"Comm. of ACM"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proc. of 22nd STOC 1990, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30580-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:26Z","timestamp":1605741866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30580-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244547","9783540305804"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30580-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}