Home > Resources > papers > CM99-Safe-Primes

Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes (Camenisch-Michels 1999)

URL: https://link.springer.com/content/pdf/10.1007/3-540-48910-X_8.pdf

Summary

Presents efficient zero-knowledge proofs for showing that an integer is the product of two safe primes, without revealing the factorization. Key building block for RSA-based anonymous credential systems and group signature schemes where safe-prime moduli must be certified.

Used by

• Camenisch-Michels-Safe-Primes
• ZK-Proof-Taxonomy