Certifying RSA

DOI10.1007/978-3-642-34961-4_25zbMath1292.94087OpenAlexW2340481244WikidataQ59163684 ScholiaQ59163684MaRDI QIDQ4911598

Alexander May, Saqib A. Kakvi, Eike Kiltz

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

RSACoppersmithcertified trapdoor permutations

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ 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 ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Verifiable Random Functions from Standard Assumptions

This page was built for publication: Certifying RSA