Provably Secure Identity-based Threshold Key Escrow from Pairing
Yu Long, Zheng Hu Gong, Kefei Chen, Shengli Liu · 2009
This paper proposes an identity-based threshold key escrow scheme. The scheme is secure against identity-based threshold chosen-plaintext attack. It tol-erates the passive adversary to access data of corrupted key escrow agency servers and the active adversary that can modify corrupted servers ’ keys. The formal proof of security is presented in the random oracle model, assuming the Bilinear Diffie-Hellman problem is computationally hard. Keywords: Pairing based cryptology, Threshold key escrow, Identity-based cryp-tography, Chosen-plaintext attack