Improved low-computation partially blind signatures

Applied Mathematics and Computation

Volumn 145, Issue 2-3, 2003, Pages 853-867

  Fan, Chun I ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Cryptology; Electronic cash; Partially blind signatures; Quadratic residues; Security and privacy

Indexed keywords

DATA PRIVACY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA;

PARTIALLY BLIND SIGNATURES;

CRYPTOGRAPHY;

EID: 0043023439     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(03)00277-7     Document Type: Article

References (27)

1. D. Chaum, Blind signatures for untraceable payments, in: R.L. Rivest, A.T. Sherman (Eds.), Advances in Cryptology-CRYPTO'82, Lecture Notes in Computer Science, Springer, 1983, pp. 199-203.
2. Rivest R.L., Shamir A., Adleman L. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM. 21(2):1978;120-126.
3. N. Ferguson, Single term off-line coins, in: T. Helleseth (Ed.), Advances in Cryptology-EUROCRYPT'93, Lecture Notes in Computer Science, vol. 765, Springer, 1994, pp. 318-328.
4. 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'94, Lecture Notes in Computer Science, vol. 950, Springer, 1995, pp. 428-432.
5. Digital Signature Standard (DSS). National Institute of Standards and Technology, US Department of Commerce, 1993.
6. 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-61.
7. T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, in: E.F. Brickell (Ed.), Advances in Cryptology-CRYPTO'92, Lecture Notes in Computer Science, vol. 740, Springer, 1992, pp. 31-53.
8. C.P. Schnorr, Efficient identification and signatures for smart cards, in: G. Brassard (Ed.), Advances in Cryptology-CRYPTO'89, Lecture Notes in Computer Science, vol. 435, Springer, 1990, pp. 235-251.
9. D. Pointcheval, J. Stern, Provably secure blind signature schemes, in: K. Kwangjo, M. Tsutomu (Eds.), Advances in Cryptology-ASIACRYPT'96, Lecture Notes in Computer Science, vol. 1163, Springer, 1996, pp. 252-265.
10. 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'88, Lecture Notes in Computer Science, vol. 330, Springer, 1988, pp. 123-128.
11. Simmons G.J. Contemporary Cryptology: The Science of Information Integrity. 1992;IEEE Press, NY.
12. 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-99.
13. 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-2193.
14. M. Abe, E. Fujisaki, How to date blind signatures, in: K. Kwangjo, M. Tsutomu (Eds.), Advances in Cryptology-ASIACRYPT'96, Lecture Notes in Computer Science, vol. 1163, Springer, 1996, pp. 244-251.
15. M. Abe, T. Okamoto, Provably secure partially blind signatures, in: M. Bellare (Ed.), Advances in Cryptology-CRYPTO'2000, Lecture Notes in Computer Science, vol. 1880, Springer, 2000, pp. 271-286.
16. 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.
17. 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-824.
18. 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-1182.
19. 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-1090.
20. Williams H.C. A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory. 26(6):1980;726-729.
21. Peralta R.C. A simple and fast probabilistic algorithm for computing square roots modulo a prime number. IEEE Transactions on Information Theory. 32(6):1986;846-847.
22. D. Chaum, A. Fiat, M. Naor, Untraceable electronic cash, in: S. Goldwasser (Ed.), Advances in Cryptology-CRYPTO'88, Lecture Notes in Computer Science, vol. 403, Springer, 1990, pp. 319-327.
23. J.S. Coron, D. Naccache, J.P. Stern, On the security of RSA padding, in: M. Wiener (Ed.), Advances in Cryptology-CRYPTO'99, Lecture Notes in Computer Science, vol. 1666, Springer, 1999, pp. 1-18.
24. Shamir A., Schnorr C.P. Cryptanalysis of certain variants of Rabin's signature scheme. Information Processing Letters. 19:1984;113-115.
25. Menezes A., van Oorschot P., Vanstone S. Handbook of Applied Cryptography. 1997;CRC Press LLC.
26. Chen C.Y., Chang C.C., Yang W.P. Hybrid method for modular exponentiation with precomputation. Electronics Letters. 32(6):1996;540-541.
27. 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-87.