Certificateless threshold cryptosystem secure against chosen-ciphertext attack

Authors:
Yu Long;Kefei Chen
Affiliations:
Department of Computer Science and Technology, Shanghai Jiaotong University, 800 Dongchuan Road, Shanghai 200240, People's Republic of China;Department of Computer Science and Technology, Shanghai Jiaotong University, 800 Dongchuan Road, Shanghai 200240, People's Republic of China
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 19
Cited 5

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Noninteractive zero-knowledge

SIAM Journal on Computing
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Another method for attaining security against adaptively chosen ciphertext attacks

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
How to share a secret

Communications of the ACM
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
Threshold-based declustering

Information Sciences: an International Journal
Simulatability and security of certificateless threshold signatures

Information Sciences: an International Journal
Optimal resilient threshold GQ signatures

Information Sciences: an International Journal
A note on variable threshold concept lattices: Threshold-based operators are reducible to classical concept-forming operators

Information Sciences: an International Journal
Generic Constructions of Identity-Based and Certificateless KEMs

Journal of Cryptology
A novel efficient (t,n) threshold proxy signature scheme

Information Sciences: an International Journal
On the security of certificateless signature schemes from asiacrypt 2003

CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
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
On constructing certificateless cryptosystems from identity based encryption

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
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

Secure public-key encryption scheme without random oracles

Information Sciences: an International Journal
Chosen Ciphertext Secure Certificateless Threshold Encryption in the Standard Model

Information Security and Cryptology
Certificateless Threshold Ring Signature

Information Sciences: an International Journal
Certificateless signcryption scheme in the standard model

Information Sciences: an International Journal
Self-generated-certificate public key encryption without pairing and its application

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper proposes the first certificateless threshold decryption scheme which avoids both the single point of failure in the distributed networks and the inherent key escrow problem in identity-based cryptosystem. The scheme is secure against threshold chosen-ciphertext attack. It tolerates the Type I adversary that can replace public key and the Type II adversary that has access to the system's master key. The formal proof of security is presented in the random oracle model, assuming some underlying problems closely related to the Bilinear Diffie-Hellman Problem are computationally hard.