@inproceedings{3c5ee95778924fc4b333985243ca4bfa,
title = "Public-Key Generation with Verifiable Randomness",
abstract = "We revisit the problem of proving that a user algorithm selected and correctly used a truly random seed in the generation of her cryptographic key. A first approach was proposed in 2002 by Juels and Guajardo for the validation of RSA secret keys. We present a new security model and general tools to efficiently prove that a private key was generated at random according to a prescribed process, without revealing any further information about the private key. We give a generic protocol for all key-generation algorithms based on probabilistic circuits and prove its security. We also propose a new protocol for factoring-based cryptography that we prove secure in the aforementioned model. This latter relies on a new efficient zero-knowledge argument for the double discrete logarithm problem that achieves an exponential improvement in communication complexity compared to the state of the art, and is of independent interest.",
author = "Olivier Blazy and Patrick Towa and Damien Vergnaud",
note = "Publisher Copyright: {\textcopyright} 2020, International Association for Cryptologic Research.; 26th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2020 ; Conference date: 07-12-2020 Through 11-12-2020",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-64837-4\_4",
language = "English",
isbn = "9783030648367",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "97--127",
editor = "Shiho Moriai and Huaxiong Wang",
booktitle = "Advances in Cryptology {\textendash} ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, 2020, Proceedings",
}