Volume 7 Number 12 (Dec. 2012)
Home > Archive > 2012 > Volume 7 Number 12 (Dec. 2012) >
JCP 2012 Vol.7(12): 2987-2996 ISSN: 1796-203X
doi: 10.4304/jcp.7.12.2987-2996

An Efficient Certificateless Threshold Decryption Schemes Based On Pairings

Fei Li1, Wei Gao1, 2, Yilei Wang3, Xueli Wang4
1Department of Mathematics and Informatics, Ludong University, Yantai, China
2Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
3School of Information and Electrical Engineering, Ludong University, Yantai, China
4School of Mathematics, South China Normal University, Guangzhou, China


Abstract—As the combination of certificateless encryption and threshold cryptography, the certificateless threshold decryption (CLTD) scheme can avoid both the single point of failure in the distributed networks and the inherent key escrow problem in identity-based cryptosystem. This paper presents a CLTD schemes from pairings. We use the Shamir secret sharing method to indirectly split the private keys in the group G into the shares in the finite field Zq. Our CLTD scheme succeed in involving much less pairing computation for generating or verifying decryption shares. The decryption share supports short length, fast generation and batch verification. Sharing the private key is completed by its holder himself without needing help from KGC. The security proof is provided in the random oracle model.

Index Terms—Certificateless cryptography, certificateless threshold decryption, provable security, random oracle model, bilinear pairing.

[PDF]

Cite: Fei Li, Wei Gao, Yilei Wang, Xueli Wang, "An Efficient Certificateless Threshold Decryption Schemes Based On Pairings," Journal of Computers vol. 7, no. 12, pp. 2987-2996, 2012.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>