{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:22:22Z","timestamp":1761675742389},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642126772"},{"type":"electronic","value":"9783642126789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12678-9_3","type":"book-chapter","created":{"date-parts":[[2010,4,29]],"date-time":"2010-04-29T11:28:35Z","timestamp":1272540515000},"page":"34-51","source":"Crossref","is-referenced-by-count":2,"title":["Fair Partially Blind Signatures"],"prefix":"10.1007","author":[{"given":"Markus","family":"R\u00fcckert","sequence":"first","affiliation":[]},{"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","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)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-44598-6_17","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"M. Abe","year":"2000","unstructured":"Abe, M., Okamoto, T.: Provably Secure Partially Blind Signatures. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 271\u2013286. Springer, Heidelberg (2000)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-45682-1_34","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Abe","year":"2001","unstructured":"Abe, M., Ohkubo, M.: Provably Secure Fair Blind Signatures with Tight Revocation. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 583\u2013602. Springer, Heidelberg (2001)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On Defining Proofs of Knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-540-30574-3_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M. Bellare","year":"2005","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of Group Signatures: The Case of Dynamic Groups. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 136\u2013153. Springer, Heidelberg (2005)"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"3_CR7","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. Plemum, New York (1983)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Chow, S.S.M., Hui, L.C.K., Yiu, S.M., Chow, K.P.: Two Improved Partially Blind Signature Schemes from Bilinear Pairings. Cryptology ePrint Archive, Report 2004\/108 (2004), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/11506157_27"},{"issue":"6","key":"3_CR9","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 Journal on Computing\u00a036(6), 1513\u20131543 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR10","unstructured":"Feige, U.: Alternative Models for Zero-Knowledge Interactive Proofs. PhD Thesis. Weizmann Institute of Science. Dept. of Computer Science and Applied Mathematics (1990), http:\/\/www.wisdom.weizmann.ac.il\/~feige"},{"key":"3_CR11","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":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","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, pp. 526\u2013544. Springer, Heidelberg (1990)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-642-00468-1_17","volume-title":"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":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0034855","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"Y. Frankel","year":"1996","unstructured":"Frankel, Y., Tsiounis, Y., Yung, M.: Indirect Discourse Proof: Achieving Efficient Fair Off-Line E-cash. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 286\u2013300. Springer, Heidelberg (1996)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"AFRICACRYPT 2010","author":"G. Fuchsbauer","year":"2010","unstructured":"Fuchsbauer, G., Vergnaud, D.: Fair Blind Signatures without Random Oracles. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 18\u201335. Springer, Heidelberg (2010)"},{"key":"3_CR16","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":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-73489-5_14","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"E. Hufschmitt","year":"2007","unstructured":"Hufschmitt, E., Traor\u00e9, J.: Fair Blind Signatures Revisited. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 268\u2013292. Springer, Heidelberg (2007)"},{"key":"3_CR18","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":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-69053-0_31","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Jakobsson","year":"1997","unstructured":"Jakobsson, M., Yung, M.: Distributed \u201cMagic ink\u201d signatures. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 450\u2013464. Springer, Heidelberg (1997)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-49162-7_8","volume-title":"Public Key Cryptography","author":"H.-W. Lee","year":"1999","unstructured":"Lee, H.-W., Kim, T.-Y.: Message Recovery Fair Blind Signature. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 97\u2013111. Springer, Heidelberg (1999)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/BFb0055490","volume-title":"Financial Cryptography","author":"S. Miyazaki","year":"1998","unstructured":"Miyazaki, S., Sakurai, K.: A More Efficient Untraceable E-Cash System with Partially Blind Signatures Based on the Discrete Logarithm Problem. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 296\u2013307. Springer, Heidelberg (1998)"},{"key":"3_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":"3_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":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-49264-X_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"M. Stadler","year":"1995","unstructured":"Stadler, M., Piveteau, J.-M., Camenisch, J.: Fair Blind Signatures. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 209\u2013219. Springer, Heidelberg (1995)"},{"issue":"6","key":"3_CR25","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0167-4048(92)90193-U","volume":"11","author":"S.H. Solms von","year":"1992","unstructured":"von Solms, S.H., Naccache, D.: On blind signatures and perfect crimes. Computers & Security\u00a011(6), 581\u2013583 (1992)","journal-title":"Computers & Security"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12678-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T21:49:49Z","timestamp":1635284989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12678-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642126772","9783642126789"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12678-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}