{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:19Z","timestamp":1725514399766},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_15","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"171-180","source":"Crossref","is-referenced-by-count":0,"title":["A Provably Secure Blind Signature Scheme"],"prefix":"10.1007","author":[{"given":"Xiaoming","family":"Hu","sequence":"first","affiliation":[]},{"given":"Shangteng","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","first-page":"199","volume-title":"Advances in Cryptology 1981 - 1997","author":"D. Chaum","year":"1999","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol.\u00a01440, pp. 199\u2013203. Springer, Heidelberg (1999)"},{"key":"15_CR2","first-page":"153","volume-title":"Proceedings of Crypto\u201983","author":"D. Chaum","year":"1983","unstructured":"Chaum, D.: Blind signature system. In: Proceedings of Crypto\u201983, p. 153. Plenum, New York (1983)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 319\u2013327. Springer, Heidelberg (1990)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Security without identification. Transaction Systems to Make Big Brother Obsolete. Communications of the ACM 28 (1985)","DOI":"10.1145\/4372.4373"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","first-page":"123","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"J.-J. Quisquater","year":"1988","unstructured":"Quisquater, J.-J., Guillou, L.C.: A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 123\u2013128. Springer, Heidelberg (1988)"},{"key":"15_CR6","unstructured":"Chaum, D.: Privacy protected payments: unconditional payer and\/or payee untraceability. In: Smartcard 2000, pp. 69\u201393 (1989)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-46885-4_31","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Boen, B., Heyst, E.: Efficient off-line electronic check. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 294\u2013301. Springer, Heidelberg (1990)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"T. Okamoto","year":"1993","unstructured":"Okamoto, T.: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 31\u201353. Springer, Heidelberg (1993)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/BFb0053458","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"J.L. Camenisch","year":"1995","unstructured":"Camenisch, J.L., Piveteau, J.M., Stadler, M.A.: Blind signatures based on the discrete logarithm problem. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 428\u2013432. Springer, Heidelberg (1995)"},{"key":"15_CR10","first-page":"92","volume-title":"ACM SSS","author":"D. Pointcheval","year":"1997","unstructured":"Pointcheval, D., Stern, J.: New blind signatures equivalent to factorization. In: ACM SSS, pp. 92\u201399. ACM Press, New York (1997)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","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, pp. 391\u2013405. Springer, Heidelberg (1998)"},{"issue":"13","key":"15_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"3","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology\u00a03(13), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Financial Cryptography","author":"M. Bellare","year":"2002","unstructured":"Bellare, M., et al.: The Power of RSA Inversion Oracles and the Security of Chaum\u2019s RSA-Based Blind Signature Scheme. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, Springer, Heidelberg (2002)"},{"key":"15_CR14","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 signature. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 136\u2013151. Springer, Heidelberg (2001)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-36178-2_33","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"F. Zhang","year":"2002","unstructured":"Zhang, F., Kim, K.: ID-based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 533\u2013547. Springer, Heidelberg (2002)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-45067-X_27","volume-title":"Information Security and Privacy","author":"F. Zhang","year":"2003","unstructured":"Zhang, F., Kim, K.: Efficient ID-Based blind signature and proxy signature from bilinear pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 312\u2013323. Springer, Heidelberg (2003)"},{"key":"15_CR17","unstructured":"Sherman, S.M., Lucas, C.K., Yiu, S.M.: Two improved partially blind signature schemes from bilinear pairings. Available at: http:\/\/eprint.iacr.org\/2004\/108.pdf"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/978-3-540-24676-3_17","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Security proofs for identity-based identification and signature schemes. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 268\u2013286. Springer, Heidelberg (2004)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11596981_24","volume-title":"Computational Intelligence and Security","author":"J. Liao","year":"2005","unstructured":"Liao, J., Qi, Y.H., Huang, P.W.: Pairing-based provable blind signature scheme without random oracles. In: Hao, Y., et al. (eds.) CIS 2005. LNCS (LNAI), vol.\u00a03801, pp. 161\u2013166. Springer, Heidelberg (2005)"},{"key":"15_CR21","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)"},{"key":"15_CR22","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":"15_CR23","series-title":"Lecture Notes in Computer Science","first-page":"178","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E. Kiltz","year":"2006","unstructured":"Kiltz, E., Herranz, J., Galindo, D.: On the Generic Construction of Identity-Based Signatures with Additional Properties. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 178\u2013193. Springer, Heidelberg (2006)"},{"issue":"21","key":"15_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"2","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM\u00a02(21), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","first-page":"235","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 235\u2013251. Springer, Heidelberg (1990)"},{"issue":"4","key":"15_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"3","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a03(4), 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"15_CR27","first-page":"62","volume-title":"Proc. of the 1st CSSS","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proc. of the 1st CSSS, pp. 62\u201373. ACM Press, New York (1993)"},{"key":"15_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)"},{"key":"15_CR29","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":"15_CR30","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:34:04Z","timestamp":1605764044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_15","relation":{},"subject":[]}}