A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme
<|reference_start|>A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme: In this paper, firstly we propose two new concepts concerning the notion of key escrow encryption schemes: provable partiality and independency. Roughly speaking we say that a scheme has provable partiality if existing polynomial time algorithm for recovering the secret knowing escrowed information implies a polynomial time algorithm that can solve a well-known intractable problem. In addition, we say that a scheme is independent if the secret key and the escrowed information are independent. Finally, we propose a new verifiable partial key escrow, which has both of above criteria. The new scheme use McCurley encryption scheme as underlying scheme.<|reference_end|>
@article{azimian2005a,
    title={A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme},
    author={Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh, Siamak Fayyaz},
    journal={arXiv preprint arXiv:cs/0505055},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0505055},
    primaryClass={cs.CR cs.CC}
}