{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:50:17Z","timestamp":1764132617530},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_37","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"615-629","source":"Crossref","is-referenced-by-count":14,"title":["Impossibility of Blind Signatures from One-Way Permutations"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[]},{"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Arkady","family":"Yerukhimovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_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":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-642-14623-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M. Abe","year":"2010","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 209\u2013236. Springer, Heidelberg (2010)"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-10366-7_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Abe","year":"2009","unstructured":"Abe, M., Ohkubo, M.: A framework for universally composable non-committing blind signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 435\u2013450. Springer, Heidelberg (2009)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1109\/FOCS.2007.71","volume-title":"48th Annual Symposium on Foundations of Computer Science (FOCS)","author":"B. Barak","year":"2007","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Lower bounds on signatures from symmetric primitives. In: 48th Annual Symposium on Foundations of Computer Science (FOCS), pp. 680\u2013688. IEEE, Los Alamitos (2007)"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-03356-8_22","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B. Barak","year":"2009","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle puzzles are optimal \u2014 an o(n\n                  2)-query attack on any key exchange from a random oracle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 374\u2013390. Springer, Heidelberg (2009)"},{"issue":"3","key":"37_CR6","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":"37_CR7","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":"2003","unstructured":"Boldyreva, A.: 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 (2003)"},{"key":"37_CR8","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":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-540-72540-4_33","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J.L. Camenisch","year":"2007","unstructured":"Camenisch, J.L., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 573\u2013590. Springer, Heidelberg (2007)"},{"key":"37_CR10","first-page":"199","volume-title":"Advances in Cryptology \u2014 Crypto 1982","author":"D. Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology \u2014 Crypto 1982, pp. 199\u2013203. Plenum Press, New York (1983)"},{"unstructured":"Fiore, D., Schr\u00f6der, D.: Uniqueness is a different story: Impossibility of verifiable random functions from trapdoor permutations. Cryptology ePrint Archive, Report 2010\/648 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/2010\/648","key":"37_CR11"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","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, pp. 60\u201377. Springer, Heidelberg (2006)"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-00468-1_17","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"M. Fischlin","year":"2009","unstructured":"Fischlin, M., Schr\u00f6der, D.: Security of blind signatures under aborts. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 297\u2013316. Springer, Heidelberg (2009)"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-13190-5_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Fischlin","year":"2010","unstructured":"Fischlin, M., Schr\u00f6der, D.: On the impossibility of three-move blind signature schemes. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 197\u2013215. Springer, Heidelberg (2010)"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-70936-7_18","volume-title":"Theory of Cryptography","author":"C. Hazay","year":"2007","unstructured":"Hazay, C., Katz, J., Koo, C.-Y., Lindell, Y.: Concurrently-secure blind signatures without random oracles or setup assumptions. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 323\u2013341. Springer, Heidelberg (2007)"},{"key":"37_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-74143-5_7","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"O. Horvitz","year":"2007","unstructured":"Horvitz, O., Katz, J.: Universally-composable two-party computation in two rounds. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 111\u2013129. Springer, Heidelberg (2007)"},{"key":"37_CR17","first-page":"44","volume-title":"21st Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 44\u201361. ACM Press, New York (1989)"},{"key":"37_CR18","first-page":"99","volume-title":"38th Annual ACM Symposium on Theory of Computing (STOC)","author":"Y. Ishai","year":"2006","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 99\u2013108. ACM Press, New York (2006)"},{"key":"37_CR19","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":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-78524-8_19","volume-title":"Theory of Cryptography","author":"A. Kiayias","year":"2008","unstructured":"Kiayias, A., Zhou, H.-S.: Equivocal blind signatures and adaptive UC-security. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 340\u2013355. Springer, Heidelberg (2008)"},{"key":"37_CR21","first-page":"33","volume-title":"21st Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 33\u201343. ACM Press, New York (1989)"},{"key":"37_CR22","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)"},{"issue":"3","key":"37_CR23","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":"37_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"37_CR25","first-page":"387","volume-title":"22nd Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 387\u2013394. ACM Press, New York (1990)"},{"unstructured":"Schr\u00f6der, D.: On the Complexity of Blind Signatures. PhD thesis, Darmstadt University of Technology (2010)","key":"37_CR26"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:29Z","timestamp":1606186109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}