A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme

Simple item page
dc.creatorAzimian, Kooshiar
dc.creatorMohajeri, Javad
dc.creatorSalmasizadeh, Mahmoud
dc.creatorFayyaz, Siamak
dc.date2005-05-22
dc.date.accessioned2026-07-07T03:23:01Z
dc.date.available2026-07-07T03:23:01Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0505055
dc.identifierhttp://arxiv.org/abs/cs/0505055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32780
dc.subjectCryptography and Security
dc.subjectComputational Complexity
dc.titleA Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme
dc.typetext

Files

Collections

arXiv