ID-based threshold decryption secure against adaptive chosen-ciphertext attack

Authors:
Yu Long;Kefei Chen;Shengli Liu
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.O. Box A0403391, 800 Dongchuan Road, Shanghai 200240, PR China and National Laboratory of Modern Communications, Ch ...;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.O. Box A0403391, 800 Dongchuan Road, Shanghai 200240, PR China and National Laboratory of Modern Communications, Ch ...;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.O. Box A0403391, 800 Dongchuan Road, Shanghai 200240, PR China
Venue:
Computers and Electrical Engineering
Year:
2007

Citing 7
Cited 2

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
Relations Among Notions of Security for Public-Key Encryption Schemes

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Chosen ciphertext secure public key threshold encryption without random oracles

CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Key escrowing today

IEEE Communications Magazine

An ID-based group-oriented decryption scheme secure against adaptive chosen-ciphertext attacks

Computer Communications
Certificate-Based encryption scheme with general access structure

CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie-Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems.