Randomization enhanced Chaum's blind signature scheme

Computer Communications

Volumn 23, Issue 17, 2000, Pages 1677-1680

  Fan, Chun I ^a   Chen, Wei Kuei ^b   Yeh, Yi Shung ^b  

^a CHUNGHWA TELECOM CO LTD   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA STRUCTURES; RANDOM PROCESSES;

BLIND SIGNATURE METHODS; ELECTRONIC CASH; ELECTRONIC VOTING;

SECURITY OF DATA;

EID: 0034316694     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(00)00254-1     Document Type: Article

References (19)

1. C.A. Boyd, A new multiple key cipher and an improved voting scheme. Advances in Cryptology - EUROCRYPT'94, LNCS 434, Springer, 1990, pp. 617-625.
2. S. Brands, Untraceable off-line cash in wallets with observers. Advances in Cryptology - CRYPTO'93, LNCS 773, Springer, 1993, pp. 302-318.
3. J. Camenisch, J.M. Piveteau, M. Stadler, An efficient fair payment system protecting privacy. Proceedings of ESORICS'94, LNCS 875, Springer, 1994, pp. 207-215.
4. D. Chaum, Blind signatures for untraceable payments. Advances in Cryptology - CRYPTO'82, Plenum, 1983.
5. D. Chaum, A. Fiat, M. Naor, Untraceable electronic cash. Advances in Cryptology - CRYPTO'88, LNCS 403, Springer, 1990, pp. 319-327.
6. J.D. Cohen, M.J. Fisher, A robust and verifiable cryptographically secure election scheme. Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, IEEE, 1985, pp. 372-382.
7. J.S. Coron, D. Naccache, J.P. Stern, On the security of RSA padding. Advances in Cryptology - CRYPTO'99, LNCS 1666, Springer, 1999, pp. 1-18.
8. Y. Desmedt, A. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. Advances in Cryptology - CRYPTO'85, LNCS 218, Springer, 1994, pp. 318-328.
9. N. Ferguson, Single term off-line coins. Advances in Cryptology - EUROCRYPT'93, LNCS 765, Springer, 1994, pp. 318-328.
10. A. Fujioka, T. Okamoto, K. Ohta, A practical secret voting scheme for large scale elections. Advances in Cryptology - AUSCRYPT'92, LNCS 718, Springer, 1992, pp. 244-251.
11. S. Goldwasser, S. Micali, R.L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, Technical Report, MIT Lab., Computer Science, Cambridge, Mass., March, 1995.
12. Menezes A., van Oorschot P., Vanstone S. Handbook of Applied Cryptography. 1997;CRC Press.
13. T. Okamoto, K. Ohta, Universal electronic cash. Advances in Cryptology - CRYPTO'91, LNCS 576, Springer, 1992, pp. 324-337.
14. Pfitzmann B., Waidner M. Strong loss tolerance of electronic coin systems. ACM Transactions on Computer Systems. 15:(2):1999;194-213.
15. D. Pointcheval, J. Stern, Provably secure blind signature schemes. Advances in Cryptology - ASIACRYPT'96, LNCS 1163, Springer, 1996, pp. 252-265.
16. D. Pointcheval, J. Stern, New blind signatures equivalent to factorization. Proceedings of the 4th ACM Conference on Computer and Communication Safety, 1997, pp. 92-99.
17. 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.
18. Rivest R.L., Shamir A., Adleman L.M. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM. 21:(2):1978;120-126.
19. Sako K. Electronic voting schemes allowing open objection to the tally. IEICE Transactions onFundamentals. E77-A:(1):1994;24-33.