{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:04:49Z","timestamp":1750316689562,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432241"},{"type":"electronic","value":"9783540457602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45760-7_8","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:11:12Z","timestamp":1184962272000},"page":"96-113","source":"Crossref","is-referenced-by-count":18,"title":["The Representation Problem Based on Factoring"],"prefix":"10.1007","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"Roger","family":"Fischlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,8]]},"reference":[{"key":"8_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-44987-6_30","volume-title":"Eurocrypt 2001","author":"M. Bellare","year":"2001","unstructured":"M. Bellare, M. Fischlin, S. Goldwasser and S. Micali: Identification Protocols Secure Against Reset Attacks, Eurocrypt 2001, Lecture Notes in Computer Science, vol. 2045, pp. 495\u2013511, Springer Verlag, 2001."},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Crypto\u2019 92","author":"M. Bellare","year":"1993","unstructured":"M. Bellare and O. Goldreich: On Defining Proofs of Knowledge, Crypto\u2019 92, Lecture Notes in Computer Science, vol. 740, pp. 390\u2013420, Springer Verlag, 1993."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols, First ACM Conference on Computer and Communication Security, ACM Press, pp. 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-69053-0_22","volume-title":"Eurocrypt\u2019 97","author":"S. Brands","year":"1997","unstructured":"S. Brands: Rapid Demonstration of Linear Relations Connected by Boolean Operators, Eurocrypt\u2019 97, Lecture Notes in Computer Science, vol. 1233, pp. 318\u2013333, Springer-Verlag, 1997."},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum and C. Cr\u00c9peau: Minimum Disclosure Proofs of Knowledge, Journal Computing System Science, vol. 37(2), pp. 156\u2013189, 1988.","journal-title":"Journal Computing System Science"},{"key":"8_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Eurocrypt\u2019 98","author":"D. Boneh","year":"1998","unstructured":"D. Boneh and R. Venkatesan: Breaking RSA may Not be Equivalent to Factoring, Eurocrypt\u2019 98, Lecture Notes in Computer Science, vol. 1403, pp. 59\u201371, Springer Verlag, 1998."},{"key":"8_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Eurocrypt 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"G. Di Crescenzo, J. Katz, R. Ostrovsky and A. Smith: Efficient And Non-Interactive Non-Malleable Commitment, Eurocrypt 2001, Lecture Notes in Computer Science, vol. 2045, pp. 40\u201359, Springer Verlag, 2001."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"I. Damg\u00c5rd","year":"1995","unstructured":"I. Damg\u00c5rd: Practical and Provable Secure Release of a Secret and Exchange of Signature, Journal of Cryptology, vol. 8, pp. 201\u2013222, 1995.","journal-title":"Journal of Cryptology"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork and M. Naor: Nonmalleable Cryptography, SIAM Journal on Computing, vol. 30(2), pp. 391\u2013437, 2000.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat and A. Shamir: Zero-Knowledge Proofs of Identity, Journal of Cryptology, vol. 1(2), pp. 77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"8_CR11","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Crypto\u2019 86","author":"A. Fiat","year":"1986","unstructured":"A. Fiat and A. Shamir: How to Prove Yourself: Practical Solutions to Identification and Signature Schemes, Crypto\u2019 86, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, pp. 186\u2013194, 1986."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir: Witness Indistinguishable and Witness Hiding Protocols, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (STOC), pp. 416\u2013426, ACM Press, 1990.","DOI":"10.1145\/100216.100272"},{"key":"8_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/3-540-44598-6_26","volume-title":"Crypto 2000","author":"M. Fischlin","year":"2000","unstructured":"M. Fischlin and R. Fischlin: Efficient Non-Malleable Commitment Schemes, Crypto 2000, Lecture Notes in Computer Science, vol. 1880, pp. 414\u2013432, Springer Verlag, 2000."},{"key":"8_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Eurocrypt\u2019 88","author":"L.C. Guillou","year":"1988","unstructured":"L.C. Guillou and J.-J. Quisquater: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory, Eurocrypt\u2019 88, Lecture Notes in Computer Science, vol. 330, pp. 123\u2013129, Springer Verlag, 1988."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R.L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM Journal of Computing, vol. 17(2), pp. 281\u2013308, 1988.","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/PL00003821","volume":"12","author":"S. Halevi","year":"1999","unstructured":"S. Halevi: Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver, Journal of Cryptology, vol. 12(2), pp. 77\u201390, 1999.","journal-title":"Journal of Cryptology"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung: Universal Oneway Hash Functions and Their Cryptographic Applications, Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC), pp. 33\u201343, ACM Press, 1989.","DOI":"10.1145\/73007.73011"},{"key":"8_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-46877-3_38","volume-title":"Eurocrypt\u2019 90","author":"H. Ong","year":"1991","unstructured":"H. Ong and C.P. Schnorr: Fast Signature Generation with as Fiat-Shamir-Like Scheme, Eurocrypt\u2019 90, Lecture Notes in Computer Science, vol. 473, pp. 432\u2013440, Springer Verlag, 1991."},{"key":"8_CR19","series-title":"Lect Notes Comput Sci","first-page":"232","volume-title":"Crypto\u2019 88","author":"K. Ohta","year":"1989","unstructured":"K. Ohta and T. Okamoto: A Modification of the Fiat-Shamir Scheme, Crypto\u2019 88, Lecture Notes in Computer Science, vol. 403, pp. 232\u2013243, Springer Verlag, 1989."},{"key":"8_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Crypto\u2019 92","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto: Provable Secure and Practical Identification Schemes and Corresponding Signature Schemes, Crypto\u2019 92, Lecture Notes in Computer Science, vol. 740, pp. 31\u201353, Springer Verlag, 1993."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"D. Pointcheval and J. Stern: New Blind Signatures Equivalent to Factorization, Proceedings of the 4th ACM Conference on Computer and Communications Security (CCS)\u2019 97, pp. 92\u201399, ACM Press, 1997.","DOI":"10.1145\/266420.266440"},{"issue":"3","key":"8_CR22","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval and J. Stern: Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, vol. 13(3), pp. 361\u2013396, 2000.","journal-title":"Journal of Cryptology"},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir and L. Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, vol. 21, pp. 120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"8_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68697-5_12","volume-title":"Crypto\u2019 96","author":"C.P. Schnorr","year":"1996","unstructured":"C.P. Schnorr: Security of 2 t -Root Identification and Signatures, Crypto\u2019 96, Lecture Notes in Computer Science, vol. 1109, pp. 143\u2013156, Springer Verlag, 1996."},{"key":"8_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/BFb0052261","volume-title":"Crypto\u2019 97","author":"C.P. Schnorr","year":"1997","unstructured":"C.P. Schnorr: Erratum: Security of 2 t -Root Identification and Signatures, in Crypto\u2019 97, Lecture Notes in Computer Science, vol 1294, page 540, Springer Verlag, 1997."},{"key":"8_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s001459900056","volume":"12","author":"V. Shoup","year":"1999","unstructured":"V. Shoup: On the Security of a Practical Identification Scheme, Journal of Cryptology, vol. 12, pp. 247\u2013260, 1999.","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2014 CT-RSA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45760-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:54:43Z","timestamp":1737320083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45760-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432241","9783540457602"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45760-7_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}