{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:31:15Z","timestamp":1773772275897,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642227912","type":"print"},{"value":"9783642227929","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22792-9_36","type":"book-chapter","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T15:32:14Z","timestamp":1312558334000},"page":"630-648","source":"Crossref","is-referenced-by-count":51,"title":["Round Optimal Blind Signatures"],"prefix":"10.1007","author":[{"given":"Sanjam","family":"Garg","sequence":"first","affiliation":[]},{"given":"Vanishree","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11605805_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"M. Abdalla","year":"2006","unstructured":"Abdalla, M., Namprempre, C., Neven, G.: On the (im)possibility of blind message authentication codes. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 262\u2013279. Springer, Heidelberg (2006)"},{"key":"36_CR2","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":"36_CR3","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":"36_CR4","unstructured":"Abe, M., Haralambiev, K., Ohkubo, M.: Signing on elements in bilinear groups for modular protocol design. IACR ePrint 2010\/133 (2010)"},{"key":"36_CR5","series-title":"LNCS","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)"},{"issue":"3","key":"36_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":"36_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":"2002","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 (2002)"},{"key":"36_CR8","unstructured":"Brands, S., Paquin, C.: U-prove cryptographic specification v1.0 (March 2010), http:\/\/connect.microsoft.com\/site642\/Downloads\/DownloadDetails.aspx?DownloadID=26953"},{"key":"36_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5931.001.0001","volume-title":"Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy","author":"S.A. Brands","year":"2000","unstructured":"Brands, S.A.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Cambridge (2000)"},{"key":"36_CR10","first-page":"345","volume-title":"ACM CCS 2008","author":"J. Camenisch","year":"2008","unstructured":"Camenisch, J., Gro\u00df, T.: Efficient attributes for anonymous credentials. In: ACM CCS 2008, pp. 345\u2013356. ACM Press, New York (2008)"},{"key":"36_CR11","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. Camenisch","year":"2005","unstructured":"Camenisch, J., 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":"36_CR12","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. Camenisch","year":"2007","unstructured":"Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 573\u2013590. Springer, Heidelberg (2007)"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO 1982, pp. 199\u2013203. Plenum Press, New York (1983)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signature system. In: CRYPTO 1983, p. 153. Plenum Press, New York (1984)","DOI":"10.1007\/978-1-4684-4730-9_14"},{"issue":"6","key":"36_CR15","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1137\/S0097539703426817","volume":"36","author":"C. Dwork","year":"2007","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. SIAM J. Comput.\u00a036(6), 1513\u20131543 (2007)","journal-title":"SIAM J. Comput."},{"key":"36_CR16","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":"36_CR17","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":"36_CR18","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":"36_CR19","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G.: Automorphic signatures in bilinear groups and an application to round-optimal blind signatures. IACR ePrint 2009\/320 (2009)","DOI":"10.1007\/978-3-642-03298-1_10"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Garg, S., Rao, V., Sahai Round, A.: optimal blind signatures in the standard model (2011) (manuscript)","DOI":"10.1007\/978-3-642-22792-9_36"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Garg, S., Rao, V., Sahai, A., Schr\u00f6der, D., Unruh, D.: Round optimal blind signatures. IACR ePrint (2011)","DOI":"10.1007\/978-3-642-22792-9_36"},{"key":"36_CR22","unstructured":"Ghadafi, E., Smart, N.: Efficient two-move blind signatures in the common reference string model. IACR ePrint 2010\/568 (2010)"},{"key":"36_CR23","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-70936-7_18"},{"key":"36_CR24","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":"36_CR25","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 (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 150\u2013164. Springer, Heidelberg (1997)"},{"key":"36_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-642-19571-6_37","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2011","unstructured":"Katz, J., Schr\u00f6der, D., Yerukhimovich, A.: Impossibility of blind signature from one-way permutation. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 615\u2013629. Springer, Heidelberg (2011)"},{"key":"36_CR27","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Zhou, H.S.: Concurrent blind signatures without random oracles. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 49\u201362. Springer, Heidelberg (2006)","DOI":"10.1007\/11832072_4"},{"key":"36_CR28","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-78524-8_19"},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1145\/780542.780641","volume-title":"STOC 2003","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: STOC 2003, pp. 683\u2013692. ACM Press, New York (2003)"},{"key":"36_CR30","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":"36_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-17373-8_30","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"S. Meiklejohn","year":"2010","unstructured":"Meiklejohn, S., Shacham, H., Freeman, D.M.: Limitations on transformations from composite-order to prime-order groups: The case of round-optimal blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 519\u2013538. Springer, Heidelberg (2010)"},{"key":"36_CR32","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001, pp. 448\u2013457 (2001)"},{"key":"36_CR33","series-title":"LNCS","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":"36_CR34","volume-title":"STOC 2011","author":"R. Pass","year":"2011","unstructured":"Pass, R.: Limits of provable security from standard assumptions. In: STOC 2011. ACM Press, New York (to appear, 2011)"},{"issue":"3","key":"36_CR35","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":"36_CR36","first-page":"366","volume-title":"FOCS 2002","author":"M. Prabhakaran","year":"2002","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS 2002, pp. 366\u2013375. IEEE, Los Alamitos (2002)"},{"key":"36_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-17373-8_24","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M. R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M.: Lattice-based blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 413\u2013430. Springer, Heidelberg (2010)"},{"key":"36_CR38","unstructured":"Schr\u00f6der, D., Unruh, D.: Round optimal blind signatures. IACR ePrint (2011)"},{"key":"36_CR39","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, D., Unruh, D.: Security of blind signatures revisited. IACR ePrint (2011)","DOI":"10.1007\/978-3-642-30057-8_39"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22792-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:17:20Z","timestamp":1638217040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22792-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642227912","9783642227929"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22792-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}