Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing

Authors:
Yu Long;Kefei Chen;Shengli Liu
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University & National Laboratory of Modern Communications, 800 Dongchuan Road, Shanghai 200240, P. R. China, e-mail: longyu@sjtu. ...;Department of Computer Science and Engineering, Shanghai Jiao Tong University & National Laboratory of Modern Communications, 800 Dongchuan Road, Shanghai 200240, P. R. China, e-mail: longyu@sjtu. ...;Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai 200240, P. R. China
Venue:
Informatica
Year:
2006

Citing 9
Cited 1

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
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
Efficient revocation and threshold pairing based cryptosystems

Proceedings of the twenty-second annual symposium on Principles of distributed computing
ID-based threshold decryption without random oracles and its application in key escrow

InfoSecu '04 Proceedings of the 3rd international conference on Information security
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Adaptively Secure Threshold Signature Scheme in the Standard Model

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversary that can make corrupted servers to deviate from the protocol. The scheme is secure against threshold adaptive chosen-ciphertext attack. The formal proof of security is presented in the random oracle model, assuming the decision Bilinear Diffie-Hellman problem is computationally hard.