ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem

Applied Mathematics and Computation

Volumn 164, Issue 3, 2005, Pages 757-772

  Su, Pin Chang ^a   Chang, Henry Ker Chang ^b   Lu, Erl Huei ^a  

^a CHANG GUNG UNIVERSITY   (Taiwan)

^b CHANG GUNG UNIVERSITY   (Taiwan)

Author keywords

Elliptic curve cryptography; ID based; Threshold digital signature

Indexed keywords

BANDWIDTH; ELECTRIC POWER UTILIZATION; FUNCTIONS; OPTIMIZATION; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES;

ELLIPTIC CURVE CRYPTOGRAPHY; ID-BASED; JACOBI SYMBOL METHOD; THRESHOLD DIGITAL SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 16344375627     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2004.06.033     Document Type: Article

References (14)

1. L. Harn Group-oriented (t, n) threshold signature and multisignature IEE Proceedings - Computers and Digital Techniques 141 1994 307 313
2. U.M. Maurer, and Y. Yacobi A non-interactive public-key distribution system Designs Codes and Cryptography 9 1996 305 316
3. Y.M. Tseng, and J.K. Jan ID-based cryptographic schemes using a non-interactive public-key distribution system Computer Security Applications Conference, Arizona, USA 1998 237 243
4. N. Kobiltz Elliptic curve cryptosystems Mathematics of Commutation 48 1987 203 209
5. V.S. Miller Uses of Elliptic Curves in Cryptography, Advances in Cryptology-Crypto'85 1986 Springer-Verlag Berlin 417-426
6. N. Ikram, Cryptographic identification of users over network, In: Proceedings of IEEE MILCOM-Communications for Network-Centric Operations: Creating the Information Force (2001) 59-63
7. M.J.B. Robshaw, Y.L. Yin, Elliptic Curve Cryptosystems, RSA Laboratories, June 1997
8. A. Menezes Elliptic curve cryptosystems RSA Laboratories' CryptoBytes 1 1995 1 4
9. J. Pollard Monte Carlo methods for index computation mod p Mathematics of Computation 32 1978 918 924
10. Z.C. Li, L.C.K. Hui, K.P. Chow, C.F. Chong, W.W. Tsang, and H.W. Chan Cryptanalysis of Harn digital multisignature scheme with distinguished signing authorities Electronics Letters 36 4 2000 314
11. S. Polling, and M. Hellman An improved algorithm for computing logarithms over GF (p) and its cryptographic significance IEEE Transactions on Information Theory 24 1978 106 110
12. A. Menezes, T. Okamoto, and S. Vanstone Reducing elliptic curve logarithms to logarithms in a finite field IEEE Transactions on Information Theory 39 1993 1639 1646
13. G. Frey, and H. Ruck A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves Mathematics of Computation 67 1998 353 356
14. N. Smart The discrete logarithm problem on elliptic curves of trace one Journal of Cryptology 12 1999 193 196