Identity-based threshold decryption revisited

Authors:
Shengli Liu;Kefei Chen;Weidong Qiu
Affiliations:
Department of Computer Science and Engineering;Department of Computer Science and Engineering;School of Information Security Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China
Venue:
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Year:
2007

Citing 11
Cited 1

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
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
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On the Security of ElGamal Based Encryption

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Modern Cryptography: Theory and Practice

Modern Cryptography: Theory and Practice
Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case

SISW '02 Proceedings of the First International IEEE Security in Storage Workshop
Efficient revocation and threshold pairing based cryptosystems

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Lower bounds for discrete logarithms and related problems

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
High security pairing-based cryptography revisited

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory

Threshold privacy preserving keyword searches

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an identity-based threshold decryption scheme, which is secure against adaptive chosen ciphertext attack (IND-CCA) in the random oracle and generic model (ROM+GM). In our scheme, a onetime Schnorr signature is used for public checkability of ciphertexts, and a new method was proposed to distribute the shares of the decryption key to decrease the number of bilinear pairings involved. Hence our scheme is more efficient than the recent proposals by Baek and Zheng in [1] and by Kiltz and Galindo in [13].