{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:15Z","timestamp":1761620835167},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0096-3003(03)00277-7","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T22:40:50Z","timestamp":1052779250000},"page":"853-867","source":"Crossref","is-referenced-by-count":7,"title":["Improved low-computation partially blind signatures"],"prefix":"10.1016","volume":"145","author":[{"given":"Chun-I","family":"Fan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-3003(03)00277-7_BIB1","doi-asserted-by":"crossref","unstructured":"D. Chaum, Blind signatures for untraceable payments, in: R.L. Rivest, A.T. Sherman (Eds.), Advances in Cryptology-CRYPTO\u201982, Lecture Notes in Computer Science, Springer, 1983, pp. 199\u2013203","DOI":"10.1007\/978-1-4757-0602-4_18"},{"issue":"2","key":"10.1016\/S0096-3003(03)00277-7_BIB2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB3","doi-asserted-by":"crossref","unstructured":"N. Ferguson, Single term off-line coins, in: T. Helleseth (Ed.), Advances in Cryptology-EUROCRYPT\u201993, Lecture Notes in Computer Science, vol. 765, Springer, 1994, pp. 318\u2013328","DOI":"10.1007\/3-540-48285-7_28"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB4","doi-asserted-by":"crossref","unstructured":"J.L. Camenisch, J.M. Piveteau, M.A. Stadler, Blind signatures based on the discrete logarithm problem, in: A.D. Santis (Ed.), Advances in Cryptology-EUROCRYPT\u201994, Lecture Notes in Computer Science, vol. 950, Springer, 1995, pp. 428\u2013432","DOI":"10.1007\/BFb0053458"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB5","unstructured":"Digital Signature Standard (DSS). National Institute of Standards and Technology, US Department of Commerce, 1993"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB6","doi-asserted-by":"crossref","unstructured":"K. Nyberg, R.A. Rueppel, A new signature scheme based on the DSA giving message recovery schemes, in: Proceedings of the First ACM Conference on Computer and Communications Security, Fairfax, Virginia, 1994, pp. 58\u201361","DOI":"10.1145\/168588.168595"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB7","doi-asserted-by":"crossref","unstructured":"T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, in: E.F. Brickell (Ed.), Advances in Cryptology-CRYPTO\u201992, Lecture Notes in Computer Science, vol. 740, Springer, 1992, pp. 31\u201353","DOI":"10.1007\/3-540-48071-4_3"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB8","unstructured":"C.P. Schnorr, Efficient identification and signatures for smart cards, in: G. Brassard (Ed.), Advances in Cryptology-CRYPTO\u201989, Lecture Notes in Computer Science, vol. 435, Springer, 1990, pp. 235\u2013251"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB9","doi-asserted-by":"crossref","unstructured":"D. Pointcheval, J. Stern, Provably secure blind signature schemes, in: K. Kwangjo, M. Tsutomu (Eds.), Advances in Cryptology-ASIACRYPT\u201996, Lecture Notes in Computer Science, vol. 1163, Springer, 1996, pp. 252\u2013265","DOI":"10.1007\/BFb0034852"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB10","doi-asserted-by":"crossref","unstructured":"L.C. Guillou, J.J. Quisquater, A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, in: C.G. Gunther (Ed.), Advances in Cryptology-EUROCRYPT\u201988, Lecture Notes in Computer Science, vol. 330, Springer, 1988, pp. 123\u2013128","DOI":"10.1007\/3-540-45961-8_11"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB11","series-title":"Contemporary Cryptology: The Science of Information Integrity","author":"Simmons","year":"1992"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB12","doi-asserted-by":"crossref","unstructured":"D. Pointcheval, J. Stern, New blind signatures equivalent to factorization, in: Proceedings of the 4th ACM Conference on Computer and Communication Security, 1997, pp. 92\u201399","DOI":"10.1145\/266420.266440"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB13","unstructured":"C.L. Lei, C.I. Fan, A universal single-authority election system, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E81-A(10) (1998) 2186\u20132193"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB14","doi-asserted-by":"crossref","unstructured":"M. Abe, E. Fujisaki, How to date blind signatures, in: K. Kwangjo, M. Tsutomu (Eds.), Advances in Cryptology-ASIACRYPT\u201996, Lecture Notes in Computer Science, vol. 1163, Springer, 1996, pp. 244\u2013251","DOI":"10.1007\/BFb0034851"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB15","doi-asserted-by":"crossref","unstructured":"M. Abe, T. Okamoto, Provably secure partially blind signatures, in: M. Bellare (Ed.), Advances in Cryptology-CRYPTO\u20192000, Lecture Notes in Computer Science, vol. 1880, Springer, 2000, pp. 271\u2013286","DOI":"10.1007\/3-540-44598-6_17"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB16","unstructured":"M.O. Rabin, Digitalized Signatures and Public-key Functions as Intractable as Factorization. Technical Report, MIT\/LCS\/TR212, MIT Lab., Computer Science, Cambridge, Mass, 1979"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB17","unstructured":"C.I. Fan, C.L. Lei, Low-computation partially blind signatures for electronic cash, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E81-A(5) (1998) 818\u2013824"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB18","unstructured":"M.S. Hwang, C.C. Lee, Y.C. Lai, Traceability on low-computation partially blind signatures for electronic cash, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E85-A(5) (2002) 1181\u20131182"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB19","unstructured":"C.I. Fan, L.C. Wu, Y.S. Yeh, Nearly optimal user efficient partially blind signatures, in: Proceedings of the 2002 International Computer Symposium, vol. 2, 2002, pp. 1083\u20131090"},{"issue":"6","key":"10.1016\/S0096-3003(03)00277-7_BIB20","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","article-title":"A modification of the RSA public-key encryption procedure","volume":"26","author":"Williams","year":"1980","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"10.1016\/S0096-3003(03)00277-7_BIB21","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/TIT.1986.1057236","article-title":"A simple and fast probabilistic algorithm for computing square roots modulo a prime number","volume":"32","author":"Peralta","year":"1986","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB22","doi-asserted-by":"crossref","unstructured":"D. Chaum, A. Fiat, M. Naor, Untraceable electronic cash, in: S. Goldwasser (Ed.), Advances in Cryptology-CRYPTO\u201988, Lecture Notes in Computer Science, vol. 403, Springer, 1990, pp. 319\u2013327","DOI":"10.1007\/0-387-34799-2_25"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB23","doi-asserted-by":"crossref","unstructured":"J.S. Coron, D. Naccache, J.P. Stern, On the security of RSA padding, in: M. Wiener (Ed.), Advances in Cryptology-CRYPTO\u201999, Lecture Notes in Computer Science, vol. 1666, Springer, 1999, pp. 1\u201318","DOI":"10.1007\/3-540-48405-1_1"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(84)90088-7","article-title":"Cryptanalysis of certain variants of Rabin\u2019s signature scheme","volume":"19","author":"Shamir","year":"1984","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB25","series-title":"Handbook of Applied Cryptography","author":"Menezes","year":"1997"},{"issue":"6","key":"10.1016\/S0096-3003(03)00277-7_BIB26","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1049\/el:19960345","article-title":"Hybrid method for modular exponentiation with precomputation","volume":"32","author":"Chen","year":"1996","journal-title":"Electronics Letters"},{"key":"10.1016\/S0096-3003(03)00277-7_BIB27","unstructured":"V. Dimitrov, T. Cooklev, Two algorithms for modular exponentiation using nonstandard arithmetics. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E78-A(1) (1995) 82\u201387"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300303002777?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300303002777?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:11:35Z","timestamp":1584652295000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300303002777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0096300303002777"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(03)00277-7","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}