{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:55Z","timestamp":1764997015956},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319083438"},{"type":"electronic","value":"9783319083445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08344-5_19","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T10:38:15Z","timestamp":1404470295000},"page":"290-305","source":"Crossref","is-referenced-by-count":5,"title":["On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Fukumitsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"Hasegawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuji","family":"Isobe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Shizuya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-642-25385-0_34","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M. Abe","year":"2011","unstructured":"Abe, M., Groth, J., Ohkubo, M.: Separating Short Structure-Preserving Signatures from Non-Interactive Assumptions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 628\u2013646. Springer, Heidelberg (2011)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-29011-4_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M. Abe","year":"2012","unstructured":"Abe, M., Haralambiev, K., Ohkubo, M.: Group to Group Commitments Do Not Shrink. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 301\u2013317. Springer, Heidelberg (2012)"},{"key":"19_CR3","unstructured":"Aggarwal, D., Maurer, U., Shparlinski, I.: The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation. In: Augot, D., Canteaut, A. (eds.) WCC 2011, pp. 17\u201326 (2011)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES Is in P. Annals of Mathematics\u00a0160(2), 781\u2013793 (2004)","journal-title":"Annals of Mathematics"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","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. 480\u2013494. Springer, Heidelberg (1997)"},{"key":"19_CR6","first-page":"62","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, Fairfax, Virginia, USA, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Venkatesan, R.: Breaking RSA May Not Be Equivalent to Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 59\u201371. Springer, Heidelberg (1998)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-79263-5_5","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"E. Bresson","year":"2008","unstructured":"Bresson, E., Monnerat, J., Vergnaud, D.: Separation Results on the \u201cOne-More\u201d Computational Problems. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 71\u201387. Springer, Heidelberg (2008)"},{"key":"19_CR9","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":"2003","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 (2003)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-20465-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Catalano","year":"2011","unstructured":"Catalano, D., Fiore, D., Warinschi, B.: Adaptive Pseudo-Free Groups and Applications. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 207\u2013223. Springer, Heidelberg (2011)"},{"key":"19_CR11","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":"19_CR12","first-page":"46","volume-title":"ACM CCS 1999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Shoup, V.: Signature Schemes Based on the Strong RSA Assumption. In: ACM CCS 1999, Kent Ridge Digital Labs, Singapore, pp. 46\u201351. ACM Press, New York (1999)"},{"key":"19_CR13","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":"2002","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 (2002)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Fukumitsu, M., Hasegawa, S., Isobe, S., Koizumi, E., Shizuya, H.: Toward Separating the Strong Adaptive Pseudo-Freeness from the Strong RSA Assumption. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol.\u00a07959, pp. 72\u201387. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39059-3_6"},{"issue":"1","key":"19_CR15","first-page":"200","volume":"E97-A","author":"M. Fukumitsu","year":"2014","unstructured":"Fukumitsu, M., Hasegawa, S., Isobe, S., Shizuya, H.: The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption. IEICE Trans. Fundamentals, Special Section on Cryptography and Information Security\u00a0E97-A(1), 200\u2013214 (2014)","journal-title":"IEICE Trans. Fundamentals, Special Section on Cryptography and Information Security"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-85174-5_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S. Garg","year":"2008","unstructured":"Garg, S., Bhaskar, R., Lokam, S.V.: Improved Bounds on Security Reductions for Discrete Log Based Signatures. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 93\u2013107. Springer, Heidelberg (2008)"},{"key":"19_CR18","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 \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":"19_CR19","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 Journal of Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-642-32009-5_47","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"G. Hanaoka","year":"2012","unstructured":"Hanaoka, G., Matsuda, T., Schuldt, J.C.N.: On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 812\u2013831. Springer, Heidelberg (2012)"},{"issue":"5","key":"19_CR21","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10207-009-0087-0","volume":"8","author":"S. Hasegawa","year":"2009","unstructured":"Hasegawa, S., Isobe, S., Shizuya, H., Tashiro, K.: On the Pseudo-Freeness and the CDH Assumption. International Journal of Information Security\u00a08(5), 347\u2013355 (2009)","journal-title":"International Journal of Information Security"},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00145-011-9102-5","volume":"25","author":"D. Hofheinz","year":"2012","unstructured":"Hofheinz, D., Kiltz, E.: Programmable Hash Functions and Their Applications. J. Cryptology\u00a025(3), 484\u2013527 (2012)","journal-title":"J. Cryptology"},{"key":"19_CR23","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)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-10628-6_16","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"M.P. Jhanwar","year":"2009","unstructured":"Jhanwar, M.P., Barua, R.: Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol.\u00a05922, pp. 233\u2013247. Springer, Heidelberg (2009)"},{"issue":"1-3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10623-010-9453-1","volume":"59","author":"M. Joye","year":"2011","unstructured":"Joye, M.: How (Not) to Design Strong-RSA Signatures. Designs, Codes and Cryptography\u00a059(1-3), 169\u2013182 (2011)","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00145-009-9042-5","volume":"23","author":"D. Micciancio","year":"2010","unstructured":"Micciancio, D.: The RSA Group is Pseudo-Free. J. Cryptology\u00a023(2), 169\u2013186 (2010)","journal-title":"J. Cryptology"},{"key":"19_CR27","first-page":"20","volume-title":"ACM CCS 2001","author":"D. Naccache","year":"1993","unstructured":"Naccache, D., Pointcheval, D., Stern, J.: Twin Signatures: An Alternative to the Hash-and-Sign Paradigm. In: ACM CCS 2001, Philadelphia, PA, USA, pp. 20\u201327. ACM Press, New York (1993)"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11593447_1","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"P. Paillier","year":"2005","unstructured":"Paillier, P., Vergnaud, D.: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 1\u201320. Springer, Heidelberg (2005)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11935230_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"P. Paillier","year":"2006","unstructured":"Paillier, P., Villar, J.L.: Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 252\u2013266. Springer, Heidelberg (2006)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11967668_3","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"P. Paillier","year":"2006","unstructured":"Paillier, P.: Impossibility Proofs for RSA Signatures in the Standard Model. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 31\u201348. Springer, Heidelberg (2006)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-540-24638-1_28","volume-title":"Theory of Cryptography","author":"R.L. Rivest","year":"2004","unstructured":"Rivest, R.L.: On the Notion of Pseudo-Free Groups. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 505\u2013521. Springer, Heidelberg (2004)"},{"key":"19_CR32","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":"19_CR33","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":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-29011-4_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y. Seurin","year":"2012","unstructured":"Seurin, Y.: On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 554\u2013571. Springer, Heidelberg (2012)"},{"issue":"1","key":"19_CR35","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"Shamir, A.: On the Generation of Cryptographically Strong Pseudorandom Sequences. ACM Trans. on Computer Systems\u00a01(1), 38\u201344 (1983)","journal-title":"ACM Trans. on Computer Systems"},{"key":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-34961-4_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J.L. Villar","year":"2012","unstructured":"Villar, J.L.: Optimal Reductions of Some Decisional Problems to the Rank Problem. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 80\u201397. Springer, Heidelberg (2012)"},{"issue":"4","key":"19_CR37","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":"19_CR38","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","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08344-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:26:34Z","timestamp":1558938394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08344-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319083438","9783319083445"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08344-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}