{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:44:06Z","timestamp":1769298246679,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709350","type":"print"},{"value":"9783540709367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_18","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T11:43:44Z","timestamp":1179315824000},"page":"323-341","source":"Crossref","is-referenced-by-count":37,"title":["Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions"],"prefix":"10.1007","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Chiu-Yuen","family":"Koo","sequence":"additional","affiliation":[]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2001)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Namprempre, C., Neven, G.: On the (Im)possibility of Blind Message Authentication Codes. CT-RSA 2006 (2006)","DOI":"10.1007\/11605805_17"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally Composable Protocols with Relaxed Set-Up Assumptions. In: FOCS\u00a02004 (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"18_CR4","unstructured":"Barak, B., Sahai, A.: How To Play Almost Any Mental Game Over The Net \u2014 Concurrent Composition via Super-Polynomial Simulation. In: FOCS\u00a02005 (2005)"},{"issue":"3","key":"18_CR5","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. J. Cryptology\u00a016(3), 185\u2013215 (2003)","journal-title":"J. Cryptology"},{"key":"18_CR6","volume-title":"ACM CCCS\u00a0\u201993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: ACM CCCS\u00a0\u201993, ACM, New York (1993)"},{"key":"18_CR7","unstructured":"Blum, M.: How to Prove a Theorem so No One Else Can Claim It. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Boldyreva, A.: Efficient Threshold Signatures, Multisignatures, and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In: PKC\u00a02003 (2003)","DOI":"10.1007\/3-540-36288-6_3"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Koprowski, M., Warinschi, B.: Efficient Blind Signatures without Random Oracles. In: SCN\u00a02004 (2004)","DOI":"10.1007\/978-3-540-30598-9_10"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Secure Computation. In: STOC\u00a02002 (2002)","DOI":"10.1145\/509907.509980"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind Signatures for Untraceable Payments. In: Crypto\u00a0\u201982 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: Payment Systems and Credential Mechanisms with Provable Security against Abuse by Individuals. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, Springer, Heidelberg (1990)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, Springer, Heidelberg (2002)"},{"key":"18_CR14","unstructured":"Dwork, C., Naor, M.: Zaps and Their Applications. In: FOCS\u00a02002 (2000)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero-Knowledge Proofs of Knowledge in Two Rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, Springer, Heidelberg (1990)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_4","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M. Fischlin","year":"2006","unstructured":"Fischlin, M.: Round-Optimal Composable Blind Signatures in the Common Reference String Model. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, Springer, Heidelberg (2006)"},{"key":"18_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, vol. 1: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 1: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"issue":"2","key":"18_CR18","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. Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM J. Computing"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1997)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Lindell, Y., Prabhakaran, M.: Concurrent General Composition of Secure Protocols in the Timing Model. In: STOC\u00a02005 (2005)","DOI":"10.1145\/1060590.1060687"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Zhou, H.-S.: Two-Round Concurrent Blind Signatures without Random Oracles. In: SCN\u00a02006 (2006)","DOI":"10.1007\/11832072_4"},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. J. Cryptology\u00a016(3), 143\u2013184 (2003)","journal-title":"J. Cryptology"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Bounded-Concurrent Secure Two-Party Computation without Setup Assumptions. In: STOC\u00a02003 (2003)","DOI":"10.1145\/780542.780641"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2004)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-Indistinguishable Computation. In: FOCS\u00a02006 (2006)","DOI":"10.1109\/FOCS.2006.43"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (1998)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034852","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Provably Secure Blind Signature Schemes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, Springer, Heidelberg (1996)"},{"issue":"3","key":"18_CR29","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. J. Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"J. Cryptology"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero Knowledge with Logarithmic Round-Complexity. In: FOCS\u00a02002 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New Notions of Security: Achieving Universal Composability without Trusted Setup. In: STOC\u00a02004 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"18_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32939-0","volume-title":"Concurrent Zero-Knowledge","author":"A. Rosen","year":"2006","unstructured":"Rosen, A.: Concurrent Zero-Knowledge. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:52Z","timestamp":1605762772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_18","relation":{},"subject":[]}}