An Efficient Certificateless Threshold Decryption Schemes Based On Pairings
- 1 December 2012
- journal article
- research article
- Published by International Academy Publishing (IAP) in Journal of Computers
- Vol. 7 (12) , 2987-2996-2996
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.Keywords
This publication has 8 references indexed in Scilit:
- Cryptanalysis and Improvement of an ID-Based Threshold Signcryption SchemeJournal of Computers, 2012
- A Certificateless and Across Administrative Domains Authenticated Key Exchange Scheme for E-paymentJournal of Software, 2011
- Security Mediated Certificateless Signatures Without PairingJournal of Computers, 2010
- Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanismInformation Sciences, 2010
- A survey of certificateless encryption schemes and security modelsInternational Journal of Information Security, 2008
- Certificateless threshold cryptosystem secure against chosen-ciphertext attackInformation Sciences, 2007
- Short Signatures from the Weil PairingJournal of Cryptology, 2004
- Securing Threshold Cryptosystems against Chosen Ciphertext AttackJournal of Cryptology, 2002