Low-computation partially blind signatures for electronic cash

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 5, 1998, Pages 818-824

  Fan, Chun I ^a   Lei, Chin Laung ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Cryptography; Electronic cash; Partially blind signatures; Quadratic residue

Indexed keywords

COMPUTATION THEORY; DATABASE SYSTEMS; SMART CARDS; TELECOMMUNICATION NETWORKS;

ELECTRONIC CASH SYSTEMS; MOBILE CLIENTS; QUADRATIC RESIDUE;

CRYPTOGRAPHY;

EID: 0032066059     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. M. Abe and E. Fujisaki, How to date blind signatures, Advances in Cryptology-ASIACRYPT'96, LNCS 1163, Springer-Verlag, pp.244-251, 1996.
2. C.A. Boyd, A new multiple key ciphers and an improved voting scheme, Advances in CryptologyEUROCRYPT4'89, LNCS 434, Springer-Verlag, pp.617625, 1990.
3. J.L. Camenisch, J.M. Pivereau, and M.A. Stadler, Blind signatures based on the discrete logarithm problem, Advances in CryptoIogy-EUROCRYPT'94, LNCS 950, Springer-Verlag, pp.428-432, 1995.
4. D. Chaum, Blind signatures systems, Advances in Cryptology-CRYPTO'83, Plenum, p. 153, 1983.
5. D. Chaum, A. Fiat, and M. Naor, Untraceable electronic cash, Advances in Cryptology-CRYPTO'88, LNCS 403, Springer-Verlag, pp.319-327, 1990.
6. C.Y. Chen, C.C. Chang, and W.P. Yang, Hybrid method for modular exponentiation with precomputation, Electron. Lett., vol.32, no.6, pp.540-541, 1996.
7. J.D. Cohen and M.J. Fisher, A robust and verifiable cryptographically secure election scheme, Proc. 26th IEEE Symp. on Foundations of Computer Science, pp.372-382, 1985.
8. V. Dimitrov and T. Cooklev, Two algorithms for modular exponentiation using nonstandard arithmetics, IEICE Trans. Fundamentals, vol.E78-A, no.l, pp.82-87, 1995.
9. A. Evans, W. Kantrowitz, Jr., and E. Weiss, A user authentication scheme not requiring secrecy in the computer, Commun. ACM, vol.17, no.8, pp.437-442, 1974.
10. C.I. Fan and C.L. Lei, A multi-recastable ticket scheme for electronic elections, Advances in CryptologyASIACRYPT'96, LNCS 1163, Springer-Verlag, pp.116124, 1996.
11. C.I. Fan and C.L. Lei, Secure Rewarding Schemes, Proc. Thirtieth Annual Hawaii International Conference on System Sciences, vol.3, pp.571-580, 1997.
12. N. Ferguson, Single term off-line coins, Advances in CryptoIogy-EUROCRYPT'93, LNCS 765, SpringerVerlag, pp.318-328, 1994.
13. A. Fujioka, T. Okamoto, and K. Ohta, A practical secret voting scheme for large scale elections, Advances in Cryptology-AUSCRYPT'92, LNCS 718, Springer-Verlag, pp.244-251, 1992.
14. L.C. Guillou and J.J. Quisquater, A practical zeroknowledge protocol fitted to security microprocessor minimizing both transmission and memory, Advances in Cryptology-EUROCRYPT'88, LNCS 330, SpringerVerlag, pp. 123-128, 1988.
15. K.R. Iversen, A cryptographic scheme for computerized general elections, Advances in Cryptology-CRYPTO'91, LNCS 576, Springer-Verlag, pp.405-419,1991.
16. W.S. Juang and C.L. Lei, A collision free secret ballot protocol for computerized general elections, Computers & Security vol.15, no.4, pp.339-348, 1996.
17. W.J. LeVeque, Fundamentals of Number Theory, Addison-Wesley, Reading, Mass., 1977.
18. NIST FIPS PUB XX, Digital Signature Standard (DSS), National Institute of Standards and Technology, U.S. Department of Commerce, DRAFT, 1993.
19. H. Nurmi, A. Salomaa, and L. Santean, Secret ballot elections in computer networks, Computers & Security, vol.10, pp.553-560, 1991.
20. D.H. Nyang and JooSeok Song, Fast digital signature scheme based on the quadratic residue problem, Electron. Lett., vol.33, no.3, pp.205-206, 1997.
21. K. Nyberg and R.A. Rueppel, A new signature scheme based on the DSA giving message recovery Schemes, The first ACM Conference on Computer and Communications Security, Fairfax, Virginia. Nov. 3-5, 1993.
22. T. Okamoto and K. Ohta, Universal electronic cash, Advances in Cryptology-CRYPTO'91, LNCS 576, SpringerVerlag, pp.324-337, 1992.
23. T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, Advances in Cryptology-CRYPTO'92, LNCS 740, Springer-Verlae, pp.31-53, 1992.
24. R.C. Peralta, A simple and fast probabilistic algorithm for computing square roots modulo a prime number, IEEE Trans. Inf. Theory, vol.32, no.6, pp.846-847, 1986.
25. S. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inf. Theory, vol.24, pp.106-110, 1978.
26. D. Pointcheval and J. Stern, Provably secure blind signature schemes, Advances in Cryptoloey-ASIACRYPT'96, LNCS 1163, Springer-Verlag, pp.252-265, 1996.
27. D. Pointcheval and J. Stern, New blind signatures equivalent to factorization, Proc. 4th ACM Conference on Computer and Communication Security, pp.92-99, 1997.
28. J.M. Pollard and C.P. Schnorr, An efficient solution of the congruence x2 + ky2 = m (mod n), IEEE Trans. Inf. Theory, vol.33, no.5, pp.702-709, 1987.
29. O.P. Purdy, A high security log-in procedure, Commun. ACM, vol.17, no.8, pp.442-445, 1974.
30. M.O. Rabin, Digitalized signatures and public-key functions as intractable as factorization, Technical Report, MIT/LCS/TR212, MIT Lab., Computer Science, Cambridge, Mass. Jan. 1979.
31. R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Commun. ACM, vol.21, no.2, pp. 120-126, 1978.
32. C.P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology-CRYPTO'89, Springer-Verlag, LNCS 435, pp.235-251, 1990.
33. A. Shamir and C.P. Schnorr, Cryptanalysis of certain variants of Rabin's signature scheme, Information Processing Letters, vol.19, pp.113-115, 1984.
34. G.J. Simmons, Contemporary Cryptology: The Science of Information Integrity, IEEE Press, N.Y., 1992.
35. P.M. Slessenger, Socially secure cryptographic election scheme, Electron. Lett., vol.27, no.ll, pp.955-957, 1991.
36. I.M. Vinogradov, An Introduction to the Theory of Numbers, Pergamon Press, Elmsford, N.Y., 1955.
37. H.C. Williams, A modification of the RSA public-key encryption procedure, IEEE Trans. Inf. Theory, vol.26, no.6, pp.726-729, 1980.