Abstract
In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive chosen ciphertext attack under the computational bilinear Diffie-Hellman (CBDH) problem assumption in the random oracle. The pubic checkability of ciphertext in the IDTDS is given by simply creating a signed ElGamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously.
Similar content being viewed by others
References
Desmedt Y, Frankel Y. Threshold cryptosystems[C] //Proceedings of Crypto 1989. Berlin: Springer-Verlag, 1989: 307–315.
Shamir A. Identity-based cryptosystems and signature schemes[C]//Proceedings of Crypto 1984. Berlin: Springer-Verlag, 1984: 47–53.
Boneh D, Franklin M. Identity-based encryption from the Weil pairing[C]//Proceedings of Crypto2001. Berlin: Springer-Verlag, 2001: 213–229.
Boneh D, Boyen X. Efficient selective-ID secure identity based encryption without random oracles[C]// Proceedings of Crypto 2004. Berlin: Springer-Verlag, 2004: 223–238.
Cocks C. An identity based encryption scheme based on quadratic residues[C]// Proceedings of Cryptography and coding. Berlin: Springer-Verlag, 2001: 360–363.
Boneh D, Katz J. Improved efficiency for CCA-secure cryptosystems built using identity-based encryption[C]// Proceedings of CT-RSA. Berlin: Springer-Verlag, 2005: 87–103.
Boneh D, Canetti R, Halevi S, et al. Chosen-ciphertext security from identity-based encryption[C]// Proceedings of EuroCrypt. Berlin: Springer-Verlag, 2004: 207–222.
Chattterjee S, Sarkar P. Generalization of the selective-ID security model for HIBE protocols[C]//Proceedings of PKC 2006. Berlin: Springer-Verlag, 2006: 241–256.
Boneh D, Boyen X, Halevi S. Chosen ciphertext secure public key threshold encryption without random oracles[C]// Proceedings of RSA-CT’06. Berlin: Springer-Verlag, 2006: 226–243.
Baek J, Zheng Y L. Identity-based threshold decryption[C]// Proceedings of PKC. Berlin: Springer-Verlag, 2004: 262–276.
Shoup V, Gennaro R. Securing threshold cryptosystems against chosen ciphertext attack[J]. J Cryptology, 2002, (15): 75–96.
Chow S S M. Verifiable pairing and its applications[C]// Proceedings of WISA2004. Berlin: Springer-Verlag, 2004: 170–187.
Schnorr C P, Jakobsson M. Security of signed ElGamal encryption[ C]//Proceedings of Asiacrypt2000. Berlin: Springer-Verlag, 2000: 73–89.
Chai Zhenchuan, Cao Zhenfu, Lu Rongxing. ID-based threshold decryption without random oracles and its application in key escrow[C]//Proceedings of the 3rd International Conference on Information Security, New York: ACM Press, 2004: 119–124.
Long Yu, Chen Kefei, Liu Shengli. ID-based threshold decryption secure against adaptive chosen-ciphertext attack[J]. Computers and Electrical Engineering. 2007, 33(3): 166–176 (Ch).
Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing[C]//Proceedings of Asiacrypt2001. Berlin: Springer-Verlag, 2001: 514–532.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60970119, 60803149) and the National Basic Research Program of China (973 Program) (2007CB311201)
Biography: ZHANG Leyou, male, Associate professor, Ph. D., research direction: information security.
Rights and permissions
About this article
Cite this article
Zhang, L., Hu, Y., Tian, X. et al. New constructions of identity-based threshold decryption. Wuhan Univ. J. Nat. Sci. 15, 222–226 (2010). https://doi.org/10.1007/s11859-010-0308-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-010-0308-4
Key words
- ID-Based threshold decryption
- verifiable pair
- computational bilinear Diffie-Hellman (CBDH) problem
- provable security