Paper 2017/640
Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms
Fabrice Benhamouda, Houda Ferradi, Rémi Géraud, and David Naccache
Abstract
RSA public keys are central to many cryptographic applications; hence their validity is of primary concern to the scrupulous cryptographer. The most relevant properties of an RSA public key
Note: One word was missing from the title / Some non-math LaTeX remained in the abstract.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Minor revision. ESORICS 2017
- Keywords
- RSA key generationrandom oraclenon-interactive proof
- Contact author(s)
- remi geraud @ ens fr
- History
- 2017-07-06: revised
- 2017-07-05: received
- See all versions
- Short URL
- https://ia.cr/2017/640
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/640, author = {Fabrice Benhamouda and Houda Ferradi and Rémi Géraud and David Naccache}, title = {Non-Interactive Provably Secure Attestations for Arbitrary {RSA} Prime Generation Algorithms}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/640}, year = {2017}, url = {https://eprint.iacr.org/2017/640} }