RSA key generation with verifiable randomness

DOI10.1007/3-540-45664-3_26MaRDI QIDQ3043952zbMATH OpenFDO

Authors Ari Juels, Jorge Guajardo

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2274/22740357.htm

zbMATH Keywords

certificate authoritykey generationkey validationpublic-key infrastructureverifiable randomnesszero knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public-key generation with verifiable randomness
• RSA public key validation
• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
• Efficient noninteractive certification of RSA moduli and beyond
• scientific article; zbMATH DE number 1775456

Cited in

(14)

• Short RSA keys and their generation
• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
• Public-key generation with verifiable randomness
• RSA public key validation
• Public keys
• Cliptography: clipping the power of kleptographic attacks
• Simple backdoors for RSA key generation
• Common randomness and secret key generation with a helper
• Short certification of secure RSA modulus (transcript of discussion)
• Certifying RSA
• scientific article; zbMATH DE number 5199039 (Why is no real title available?)
• Removing the strong RSA assumption from arguments over the integers
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
• Immunizing backdoored PRGs

This page was built for publication: RSA key generation with verifiable randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043952)