Provable Partial Key Escrow


In this paper we first propose two new concepts concerning the notion of key escrow schemes: provable partiality and independence. Roughly speaking, a scheme has provable partiality if the existence of a polynomial time for recovering the secret from escrowed information implies there is a polynomial time algorithm for solving a well known intractable… (More)


Cite this paper

@article{Azimian2010ProvablePK, title={Provable Partial Key Escrow}, author={Kooshiar Azimian and Javad Mohajeri and Mahmoud Salmasizadeh and Samuel S. Wagstaff}, journal={I. J. Network Security}, year={2010}, volume={10}, pages={121-124} }