INFORMATICA International Journal Main Page Editorial Board Abstracting/Indexing Instructions to Authors Subscription Information Contents Author Index Papers in Production		INFORMATICA, 2006, Vol. 17, No. 4, 519-534 © Institute of Mathematics and Informatics, ISSN 0868-4952 Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing Yu LONGa, Kefei CHENa, Shengli LIUb aDepartment 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.edu.cn bDepartment of Computer Science and Engineering, Shanghai Jiao Tong University 800 Dongchuan Road, Shanghai 200240, P. R. China 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. Keywords: threshold key escrow, identity-based cryptography, chosen-ciphertext attack, pairing based cryptology To preview Lithuanian abstract see full article text To preview full article text in PDF format click here You could obtain free Acrobat Reader from Adobe
Top		Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010