Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Communications of the ACM
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Certificateless threshold cryptosystem secure against chosen-ciphertext attack
Information Sciences: an International Journal
Robust threshold DSS signatures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Certificate-based encryption and the certificate revocation problem
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
CBE from CL-PKE: a generic construction and efficient schemes
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On constructing certificateless cryptosystems from identity based encryption
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
The security of triple encryption and a framework for code-based game-playing proofs
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
How to solve key escrow and identity revocation in identity-based encryption schemes
ICISS'05 Proceedings of the First international conference on Information Systems Security
Hi-index | 0.00 |
We propose the first secure Certificateless Threshold Encryption (CLTH-PKE) scheme against a malicious Key Generation Center (KGC) in the standard model. In this paper, we first define the new security model for CLTH-PKE. And then, we construct a new CLTH-PKE scheme with rigorous security proof against the attacks of a malicous KGC in the standard model based on Decisional Bilinear Diffie-Hellman (DBDH) assumption. Compared with the previous CLTH-PKE scheme proposed by Long et al. [13], our scheme is more secure. Since our scheme deals with a malicious KGC and is proved secure in the standard model. Furthermore, our scheme does not need to compute pairings in the encryption phase. Therefore it is more efficient than Long et al.'s scheme [13].