Skip to content

Home > Cryptographic Primitives > Camenisch-Michels-Safe-Primes

Proving in ZK that a Number Is the Product of Two Safe Primes

Paper: Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes

Description

Demonstrates how to prove properties of secret values in zero-knowledge, specifically that a committed number is the product of two safe primes. Gives a broad overview of composition possibilities with Sigma-protocols and Pedersen Commitments.

Properties

  • Completeness: Yes
  • Soundness: Computational
  • Zero-knowledge: Yes

Based on

Pedersen-Commitments, Sigma-Protocols-Damgard

Used by

Docknetwork

Resources