Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms

DOI10.1007/978-3-319-66402-6_13zbMath1500.94018OpenAlexW2740912794MaRDI QIDQ2167716

Houda Ferradi, Fabrice Benhamouda, Rémi Géraud, David Naccache

Publication date: 25 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-66402-6_13

zbMATH Keywords

random oraclenon-interactive proofRSA key generation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items

Zero-knowledge arguments for subverted RSA groups ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ Public-key generation with verifiable randomness

Cites Work

• Minimum disclosure proofs of knowledge
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• Cliptography: Clipping the Power of Kleptographic Attacks
• The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
• Perfect Non-interactive Zero Knowledge for NP
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Certifying RSA
• A Space Efficient Backdoor in RSA and Its Applications
• Topics in Cryptology – CT-RSA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item