Computer Science – Cryptography and Security
Scientific paper
2005-05-22
Computer Science
Cryptography and Security
Scientific paper
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.
Azimian Kooshiar
Fayyaz Siamak
Mohajeri Javad
Salmasizadeh Mahmoud
No associations
LandOfFree
A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-79674