A Key Recovery System as Secure as Factoring (original) (raw)

Lecture Notes in Computer Science, 2004

Abstract

There has been a lot of recent work in the area of proving in zero-knowledge that an RSA modulus N is in the correct form. For example, protocols have been given that prove that N is the product of: two safe primes, two primes nearly equal in size, etc. Such proof systems are rather remarkable in what they achieve, but

Moti Yung hasn't uploaded this paper.

Let Moti know you want this paper to be uploaded.

Ask for this paper to be uploaded.