{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:11Z","timestamp":1772283671557,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00145-015-9225-1","type":"journal-article","created":{"date-parts":[[2016,1,15]],"date-time":"2016-01-15T03:38:54Z","timestamp":1452829134000},"page":"470-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Security of Blind Signatures Revisited"],"prefix":"10.1007","volume":"30","author":[{"given":"Dominique","family":"Schr\u00f6der","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"9225_CR1","doi-asserted-by":"crossref","unstructured":"M. Abe, A secure three-move blind signature scheme for polynomially many signatures, in Birgit Pfitzmann, editor, Advances in Cryptology\u2014EUROCRYPT\u00a02001, vol. 2045 of Lecture Notes in Computer Science, Innsbruck, Austria, May\u00a06\u201310 (Springer, Berlin, 2001), pp. 136\u2013151","DOI":"10.1007\/3-540-44987-6_9"},{"key":"9225_CR2","doi-asserted-by":"crossref","unstructured":"M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Structure-preserving signatures and commitments to group elements, in Tal Rabin, editor, Advances in Cryptology\u2014CRYPTO\u00a02010, vol. 6223 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, August\u00a015\u201319, (Springer, Berlin, 2010), pp. 209\u2013236","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"9225_CR3","doi-asserted-by":"crossref","unstructured":"M. Abdalla, C. Namprempre, G. Neven, On the (im)possibility of blind message authentication codes, in David Pointcheval, editor, Topics in Cryptology\u2014CT-RSA\u00a02006, vol. 3860 of Lecture Notes in Computer Science, San Jose, CA, USA, February\u00a013\u201317, (Springer, Berlin, 2006), pp. 262\u2013279","DOI":"10.1007\/11605805_17"},{"key":"9225_CR4","doi-asserted-by":"crossref","unstructured":"M. Abe, M. Ohkubo, A framework for universally composable non-committing blind signatures, in Mitsuru Matsui, editor, Advances in Cryptology\u2014ASIACRYPT\u00a02009, vol. 5912 of Lecture Notes in Computer Science, Tokyo, Japan, December\u00a06\u201310, (Springer, Berlin, 2009), pp. 435\u2013450","DOI":"10.1007\/978-3-642-10366-7_26"},{"key":"9225_CR5","doi-asserted-by":"crossref","unstructured":"N.\u00a0Asokan, V. Shoup, M. Waidner, Optimistic fair exchange of digital signatures (extended abstract), in Kaisa Nyberg, editor, Advances in Cryptology\u2014EUROCRYPT\u201998, vol. 1403 of Lecture Notes in Computer Science, Espoo, Finland, May\u00a031\u00a0\u2013\u00a0June\u00a04, (Springer, Berlin, 1998), pp. 591\u2013606","DOI":"10.1007\/BFb0054156"},{"key":"9225_CR6","unstructured":"R. Bjones, U-prove technology overview. http:\/\/www.itforum.dk\/downloads\/Ronny_Bjones_Uprove.pdf , (2010)"},{"key":"9225_CR7","doi-asserted-by":"crossref","unstructured":"M. Bellare, C. Namprempre, D. Pointcheval, M. Semanko, The one-more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. J. Cryptol., 16(3):185\u2013215 (2003)","DOI":"10.1007\/s00145-002-0120-1"},{"key":"9225_CR8","doi-asserted-by":"crossref","unstructured":"A. Boldyreva, Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme, in Yvo Desmedt, editor, PKC\u00a02003: 6th International Workshop on Theory and Practice in Public Key Cryptography, volume 2567 of Lecture Notes in Computer Science, Miami, USA, January\u00a06\u20138, (Springer, Berlin, 2003), pp. 31\u201346","DOI":"10.1007\/3-540-36288-6_3"},{"key":"9225_CR9","unstructured":"S. Brands, C. Paquin, U-prove cryptographic specification v1.0. http:\/\/connect.microsoft.com\/site642\/Downloads\/DownloadDetails.aspx?DownloadID=26953 , March 2011"},{"key":"9225_CR10","doi-asserted-by":"crossref","unstructured":"S.A. Brands, Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy, (MIT Press, Cambridge, 2000)","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"9225_CR11","doi-asserted-by":"crossref","unstructured":"J. Camenisch, T. Gro\u00df, Efficient attributes for anonymous credentials, in Peng Ning, Paul\u00a0F. Syverson, Somesh Jha, editors, ACM CCS 08: 15th Conference on Computer and Communications Security, Alexandria, Virginia, USA, October\u00a027\u201331, (ACM Press, New York, 2008), pp. 345\u2013356","DOI":"10.1145\/1455770.1455814"},{"key":"9225_CR12","doi-asserted-by":"crossref","unstructured":"D. Chaum, Blind signatures for untraceable payments, in David Chaum, Ronald\u00a0L. Rivest, Alan\u00a0T. Sherman, editors, Advances in Cryptology\u2014CRYPTO\u201982, Santa Barbara, CA, USA, (Plenum Press, New York, 1982), pp. 199\u2013203","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"9225_CR13","doi-asserted-by":"crossref","unstructured":"D. Chaum, Blind signature system, in David Chaum, editor, Advances in Cryptology\u2014CRYPTO\u201983, Santa Barbara, CA, USA, (Plenum Press, New York, 1983), p. 153","DOI":"10.1007\/978-1-4684-4730-9_14"},{"key":"9225_CR14","doi-asserted-by":"crossref","unstructured":"J. Camenisch, M. Koprowski, B. Warinschi, Efficient blind signatures without random oracles, in Carlo Blundo and Stelvio Cimato, editors, SCN 04: 4th International Conference on Security in Communication Networks, vol. 3352 of Lecture Notes in Computer Science, Amalfi, Italy, September\u00a08\u201310, (Springer, Berlin, 2004), pp. 134\u2013148","DOI":"10.1007\/978-3-540-30598-9_10"},{"key":"9225_CR15","doi-asserted-by":"crossref","unstructured":"J. Camenisch, G, Neven, A. Shelat, Simulatable adaptive oblivious transfer, in Moni Naor, editor, Advances in Cryptology\u2014EUROCRYPT\u00a02007, vol. 4515 of Lecture Notes in Computer Science, Barcelona, Spain, May\u00a020\u201324, (Springer, Berlin, 2007), pp. 573\u2013590","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"9225_CR16","doi-asserted-by":"crossref","unstructured":"M. Fischlin, Round-optimal composable blind signatures in the common reference string model, in Cynthia Dwork, editor, Advances in Cryptology\u2014CRYPTO\u00a02006, vol. 4117 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, August\u00a020\u201324, (Springer, Berlin, 2006), pp. 60\u201377","DOI":"10.1007\/11818175_4"},{"key":"9225_CR17","doi-asserted-by":"crossref","unstructured":"M. Fischlin, D. Schr\u00f6der, Security of blind signatures under aborts, in Stanislaw Jarecki and Gene Tsudik, editors, PKC\u00a02009: 12th International Conference on Theory and Practice of Public Key Cryptography, vol. 5443 of Lecture Notes in Computer Science, Irvine, CA, USA, March\u00a018\u201320, (Springer, Berlin, 2009), pp. 297\u2013316","DOI":"10.1007\/978-3-642-00468-1_17"},{"key":"9225_CR18","doi-asserted-by":"crossref","unstructured":"M. Fischlin, D. Schr\u00f6der, On the impossibility of three-move blind signature schemes, in Henri Gilbert, editor, Advances in Cryptology\u2014EUROCRYPT\u00a02010, vol. 6110 of Lecture Notes in Computer Science, French Riviera, May\u00a030\u00a0\u2013\u00a0June\u00a03, (Springer, Berlin, 2010), pp. 197\u2013215","DOI":"10.1007\/978-3-642-13190-5_10"},{"key":"9225_CR19","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, Automorphic signatures in bilinear groups and an application to round-optimal blind signatures. Cryptology ePrint Archive, Report 2009\/320, 2009. http:\/\/eprint.iacr.org\/ .","DOI":"10.1007\/978-3-642-03298-1_10"},{"key":"9225_CR20","doi-asserted-by":"crossref","unstructured":"S. Garg, D. Gupta, Efficient round optimal blind signatures, in Phong\u00a0Q. Nguyen and Elisabeth Oswald, editors, Advances in Cryptology\u2014EUROCRYPT\u00a02014, vol. 8441 of Lecture Notes in Computer Science, Copenhagen, Denmark, May\u00a011\u201315, (Springer, Berlin, 2014), pp. 477\u2013495","DOI":"10.1007\/978-3-642-55220-5_27"},{"key":"9225_CR21","doi-asserted-by":"crossref","unstructured":"J.A. Garay, P.D. MacKenzie, M. Prabhakaran, K. Yang, Resource fairness and composability of cryptographic protocols, in Shai Halevi and Tal Rabin, editors, TCC\u00a02006: 3rd Theory of Cryptography Conference, vol. 3876 of Lecture Notes in Computer Science, New York, NY, USA, March\u00a04\u20137, (Springer, Berlin, 2006) pp. 404\u2013428","DOI":"10.1007\/11681878_21"},{"key":"9225_CR22","doi-asserted-by":"crossref","unstructured":"S. Garg, V. Rao, A. Sahai, D. Schr\u00f6der, D. Unruh, Round optimal blind signatures, in Advances in Cryptology\u2014CRYPTO 2011\u201431st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2011. Proceedings, vol. 6841 of Lecture Notes in Computer Science, (Springer, Berlin, 2011), pp. 630\u2013648","DOI":"10.1007\/978-3-642-22792-9_36"},{"key":"9225_CR23","unstructured":"E.\u00a0Ghadafi, N.P. Smart, Efficient two-move blind signatures in the common reference string model. Cryptology ePrint Archive, Report 2010\/568, 2010. http:\/\/eprint.iacr.org\/"},{"key":"9225_CR24","doi-asserted-by":"crossref","unstructured":"O. Goldreich, The Foundations of Cryptography, vol. 2 (Cambridge University Press, New York, NY, 2004).","DOI":"10.1017\/CBO9780511721656"},{"key":"9225_CR25","doi-asserted-by":"crossref","unstructured":"O. Horvitz, J. Katz, Universally-composable two-party computation in two rounds, in Alfred Menezes, editor, Advances in Cryptology\u2014CRYPTO\u00a02007, vol. 4622 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, August\u00a019\u201323, (Springer, Berlin, 2007), pp. 111\u2013129","DOI":"10.1007\/978-3-540-74143-5_7"},{"key":"9225_CR26","doi-asserted-by":"crossref","unstructured":"C. Hazay, J. Katz, C.-Y. Koo, Y. Lindell, Concurrently-secure blind signatures without random oracles or setup assumptions, in Salil\u00a0P. Vadhan, editor, TCC\u00a02007: 4th Theory of Cryptography Conference, vol. 4392 of Lecture Notes in Computer Science, Amsterdam, The Netherlands, February\u00a021\u201324, (Springer, Berlin, 2007), pp. 323\u2013341","DOI":"10.1007\/978-3-540-70936-7_18"},{"key":"9225_CR27","doi-asserted-by":"crossref","unstructured":"A. Juels, M. Luby, R. Ostrovsky, Security of blind digital signatures (extended abstract), in Burton\u00a0S. Kaliski Jr., editor, Advances in Cryptology\u2014CRYPTO\u201997, vol. 1294 of Lecture Notes in Computer Science, Santa Barbara, CA, USA, August\u00a017\u201321, (Springer, Berlin, 1997), pp. 150\u2013164","DOI":"10.1007\/BFb0052233"},{"key":"9225_CR28","doi-asserted-by":"crossref","unstructured":"A. Kiayias, H.-S. Zhou, Equivocal blind signatures and adaptive UC-security, in Ran Canetti, editor, TCC\u00a02008: 5th Theory of Cryptography Conference, vol. 4948 of Lecture Notes in Computer Science, San Francisco, CA, USA, March\u00a019\u201321, (Springer, Berlin, 2008), pp. 340\u2013355","DOI":"10.1007\/978-3-540-78524-8_19"},{"key":"9225_CR29","unstructured":"MICROSOFT U-PROVE. Microsoft u-prove ctp release 2. http:\/\/connect.microsoft.com\/site642\/Downloads\/DownloadDetails.aspx?DownloadID=26953 , March 2011"},{"key":"9225_CR30","doi-asserted-by":"crossref","unstructured":"T. Okamoto, Efficient blind and partially blind signatures without random oracle, in Shai Halevi and Tal Rabin, editors, TCC\u00a02006: 3rd Theory of Cryptography Conference, vol. 3876 of Lecture Notes in Computer Science, New York, NY, USA, March\u00a04\u20137, (Springer, Berlin, 2006), pp. 80\u201399","DOI":"10.1007\/11681878_5"},{"key":"9225_CR31","doi-asserted-by":"crossref","unstructured":"D. Pointcheval, J. Stern, Security arguments for digital signatures and blind signatures. J. Cryptol., 13(3):361\u2013396 (2000)","DOI":"10.1007\/s001450010003"},{"key":"9225_CR32","doi-asserted-by":"crossref","unstructured":"M. R\u00fcckert, Lattice-based blind signatures, in Masayuki Abe, editor, Advances in Cryptology\u2014ASIACRYPT\u00a02010, vol. 6477 of Lecture Notes in Computer Science, Singapore, December\u00a05\u20139, (Springer, Berlin, 2010), pp. 413\u2013430","DOI":"10.1007\/978-3-642-17373-8_24"},{"key":"9225_CR33","unstructured":"D. Schr\u00f6der, D. Unruh, Round optimal blind signatures. Cryptology ePrint Archive, Report 2011\/264, 2011. http:\/\/eprint.iacr.org\/"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9225-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9225-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T20:28:56Z","timestamp":1718310536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9225-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9225"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9225-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,14]]},"assertion":[{"value":"7 January 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}