Certifying RSA

DOI10.1007/978-3-642-34961-4_25MaRDI QIDQ4911598zbMATH OpenOpenAlexWikidataFDO

Authors Saqib A. Kakvi, Eike Kiltz, Alexander May

Publication date 19 March 2013

Published in Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34961-4_25

zbMATH Keywords

certified trapdoor permutationsCoppersmithRSA

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1588487
• Certifying variant of RSA with generalized moduli
• scientific article; zbMATH DE number 1870586
• scientific article; zbMATH DE number 2085443
• RSA-based undeniable signatures
• scientific article; zbMATH DE number 1088231
• scientific article; zbMATH DE number 4213912
• Batch RSA
• Proof Checking the RSA Public Key Encryption Algorithm

Cited in

(10)

• Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
• Optimal security proofs for full domain hash. Revisited
• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• Certifying variant of RSA with generalized moduli
• Oblivious transfer from trapdoor permutations in minimal rounds
• Verifiable random functions from standard assumptions
• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• New results on the -hiding assumption and factoring related RSA moduli

This page was built for publication: Certifying RSA

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