Ecole Normale Superièure, Paris
Invited Lecture: Fair encryption of RSA keys
Abstract : As cryptographers design more and more elaborate protocols, appears a need to ensure that participants behave fairly. In this talk, we will present a cryptographic scheme by which one can encrypt an RSA secret key and provide a proof that the correct key is actually included in the public envelope that has been created. The novelty here is that the proof is short enough to be appended to the envelope: typically a few hundred bytes.
Our scheme uses a new zero-knowledge proof for the factorization of an integer, which is of independent interest. We believe that the technique that we introduce may have other applications.
joint work with Guillaume POUPARD.