JOURNAL BROWSE
Search
Advanced SearchSearch Tips
CRYPTANALYSIS OF A DYNAMIC THRESHOLD DECRYPTION SCHEME
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
CRYPTANALYSIS OF A DYNAMIC THRESHOLD DECRYPTION SCHEME
Kim, Ki-Tae; Lim, Seong-An; Yie, Ik-Kwon; Kim, Kyung-Hee;
  PDF(new window)
 Abstract
In this paper, we analyze a dynamic threshold decryption scheme proposed by Long et al. It was claimed that the scheme allows to renew the master key, or to add/remove or update a decryption server, without leaking any information on the master key and changing other decryption server's secret keys. We present an attack to Long et al's scheme by using the fact that it renews a decryption server's secret key without changing other decryption server's secret shares.
 Keywords
bilinear pairing;cryptography;dynamic threshold decryption;
 Language
English
 Cited by
 References
1.
D. Boneh and X. Boyen, Efficienty Selective-ID Secure Identity based encryption scheme without random oracles, Advances in Cryptology-Eurocrypt 04, LNCS, Vol. 3027, pp. 223-238, 2004. crossref(new window)

2.
D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, Advances in Cryptology-Crypto 2001, LNCS Vol. 2139, pp. 213-229, Springer-Verlag, 2001. crossref(new window)

3.
Z. Chai, Z. F. Cao, and R. X. Lu, ID-based threshold decryption without random oracles and its application in key escrow, Inforsec 2004, ACM press, pp. 119-124, 2004. crossref(new window)

4.
B. Libert and J. J. Quisquater, Efficient revocation and threshold pairing based cryp-tosystems, PODC 2003, ACM press, pp. 163-171, 2003. crossref(new window)

5.
Y. Long and K.-F. Chen, Construction of dynamic threshold decryption scheme from pairing, International Journal of Network Security, Vol.2, No. 2, pp. 111-113, 2006.

6.
A. Shamir, Identity based cryptosystems and signature schemes, Advances in Cryptology-Crypto 1984, LNCS Vol. 196, pp. 47-53, Springer-Verlag, 1984.