{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T21:38:48Z","timestamp":1772487528559,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_4","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"60-77","source":"Crossref","is-referenced-by-count":114,"title":["Round-Optimal Composable Blind Signatures in the Common Reference String Model"],"prefix":"10.1007","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-44987-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"M. Abe","year":"2001","unstructured":"Abe, M.: A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 136\u2013151. Springer, Heidelberg (2001)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0034851","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"M. Abe","year":"1996","unstructured":"Abe, M., Fujisaki, E.: How to Date Blind Signatures. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 244\u2013251. Springer, Heidelberg (1996)"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSA-Inversion Problems and the Security of Chaum\u2019s Blind Signature Scheme. Journal of Cryptology\u00a016(3), 185\u2013215 (2003)","journal-title":"Journal of Cryptology"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography - PKC 2003","author":"A. Boldyreva","year":"2002","unstructured":"Boldyreva, A.: Efficient Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 31\u201346. Springer, Heidelberg (2002)"},{"key":"4_CR5","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally Composable Security: A new Paradigm for Cryptographic Protocols. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) 2001. IEEE Computer Society Press, Los Alamitos (2001), eprint.iacr.org"},{"key":"4_CR6","volume-title":"Proceedings of Computer Security Foundations Workshop (CSFW) 2004","author":"R. Canetti","year":"2004","unstructured":"Canetti, R.: On Universally Composable Notions of Security for Signature, Certification and Authentication. In: Proceedings of Computer Security Foundations Workshop (CSFW) 2004. IEEE Computer Society Press, Los Alamitos (2004); an updated version see, eprint.iacr.org"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-1-4757-0602-4_18","volume-title":"Advances in Cryptology \u2014 Crypto\u201982","author":"D. Chaum","year":"1983","unstructured":"Chaum, D.: Blind Signatures for Untraceable Payments. In: Advances in Cryptology 1981 - 1997, pp. 199\u2013203. Plemum, New York (1983)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-30598-9_10","volume-title":"Security in Communication Networks","author":"J.L. Camenisch","year":"2005","unstructured":"Camenisch, J.L., Koprowski, M., Warinschi, B.: Efficient Blind Signatures Without Random Oracles. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 134\u2013148. Springer, Heidelberg (2005)"},{"key":"4_CR10","first-page":"494","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC) 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Secure Computation. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC) 2002, pp. 494\u2013503. ACM Press, New York (2002)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust Non-interactive Zero Knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"4_CR12","first-page":"426","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC) 2003","author":"I. Damgard","year":"2003","unstructured":"Damgard, I., Groth, J.: Non-interactive and Reusable Non-Malleable Commitment Schemes. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC) 2003, pp. 426\u2013437. ACM Press, New York (2003)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/SFCS.1992.267809","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) 1992","author":"A. Santis De","year":"1992","unstructured":"De Santis, A., Persiano, G.: Zero-Knowledge Proofs of Knowledge Without Interaction. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) 1992, pp. 427\u2013436. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: Round-Optimal Composable Blind Signatures in the Common Reference String Model (full version) (2006), Available at: www.fischlin.de","DOI":"10.1007\/11818175_4"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple NonInteractive Zero Knowledge Proofs Under General Assumption. SIAM Journal on Computing\u00a029(1), 1\u201328 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L., Luby, M.: A Pseudorandom Generator from any One-way Function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BFb0052233","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"A. Juels","year":"1997","unstructured":"Juels, A., Luby, M., Ostrovsky, R.: Security of Blind Digital Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 150\u2013164. Springer, Heidelberg (1997)"},{"key":"4_CR18","unstructured":"Kiayias, A., Hong-Sheng, Z.: Two-Round Concurrent Blind Signatures without Random Oracles. Number 2005\/435 in Cryptology eprint archive (2005), eprint.iacr.org"},{"key":"4_CR19","first-page":"683","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC) 2003","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC) 2003, pp. 683\u2013692. ACM Press, New York (2003)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24638-1_12","volume-title":"Theory of Cryptography","author":"Y. Lindell","year":"2004","unstructured":"Lindell, Y.: Lower Bounds for Concurrent Self Composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 203\u2013222. Springer, Heidelberg (2004)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30576-7_14","volume-title":"Theory of Cryptography","author":"M. Lepinski","year":"2005","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Fair-zero knowledge. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 245\u2013263. Springer, Heidelberg (2005)"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit Commitment Using Pseudo-Randomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"4_CR23","first-page":"33","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC) 1989","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal One-Way Hash Functions and Their Cryptographic Applications. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC) 1989, pp. 33\u201343. ACM Press, New York (1989)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/11681878_5","volume-title":"Theory of Cryptography","author":"T. Okamoto","year":"2006","unstructured":"Okamoto, T.: Efficient Blind and Partially Blind Signatures Without Random Oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 80\u201399. Springer, Heidelberg (2006)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BFb0054141","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Pointcheval","year":"1998","unstructured":"Pointcheval, D.: Strengthened Security for Blind Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 391\u2013405. Springer, Heidelberg (1998)"},{"issue":"3","key":"4_CR26","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":"4_CR27","first-page":"387","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC) 1999","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-Way Functions are Necessary and Sufficient for Secure Signatures. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC) 1999, pp. 387\u2013394. ACM Press, New York (1990)"},{"key":"4_CR28","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) 1999","author":"A. Sahai","year":"1999","unstructured":"Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) 1999. IEEE Computer Society Press, Los Alamitos (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:14Z","timestamp":1605644174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11818175_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}