Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes

DOI10.1007/3-540-48910-X_8zbMath0971.94009OpenAlexW172970726MaRDI QIDQ4250757

Markus Michels, Jan Camenisch

Publication date: 2 November 2001

Published in: Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-48910-x_8

zbMATH Keywords

RSAzero-knowledge proofsprimality testing

Mathematics Subject Classification ID

Cryptography (94A60) Factorization; primality (11A51) Primality (11Y11)

Related Items (19)

Anonymous single-sign-on for \(n\) designated services with traceability ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Public-key generation with verifiable randomness ⋮ Property-Based Attestation without a Trusted Third Party ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Several cryptographic applications of \(\Sigma\)-protocol ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ Efficient Sequential Aggregate Signed Data ⋮ A note on Girault's self-certified model ⋮ Encryption Switching Protocols ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Two-sided malicious security for private intersection-sum with cardinality

This page was built for publication: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes