Hashing solutions instead of generating problems: on the interactive certification of RSA moduli

DOI10.1007/978-3-319-76581-5_14zbMath1420.94035OpenAlexW2792961291MaRDI QIDQ1753859

Benedikt Auerbach, Bertram Poettering

Publication date: 29 May 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

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

This page was built for publication: Hashing solutions instead of generating problems: on the interactive certification of RSA moduli