Sciweavers

Share
EUROCRYPT
2000
Springer

Fair Encryption of RSA Keys

12 years 1 months ago
Fair Encryption of RSA Keys
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when they use public key encryption. Accordingly, mechanisms are needed to check the correctness of encrypted data, without compromising secrecy. We consider an optimistic scenario in which users have pairs of public and private keys and give an encryption of their secret key with the public key of a third party. In this setting we wish to provide a publicly verifiable proof that the third party is able to recover the secret key if needed. Our emphasis is on size; we believe that the proof should be of the same length as the original key. In this paper, we propose such proofs of fair encryption for El Gamal and RSA keys, using the Paillier cryptosystem. Our proofs are really efficient since in practical terms they are only a few hundred bytes long. As an application, we design a very simple and efficient key recovery...
Guillaume Poupard, Jacques Stern
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where EUROCRYPT
Authors Guillaume Poupard, Jacques Stern
Comments (0)
books