Abstract
We introduce the notion of non-uniformly sound certificates: succinct single-message (unidirectional) argument systems that satisfy a “best-possible security” against non-uniform polynomial-time attackers. In particular, no polynomial-time attacker with s bits of non-uniform advice can find significantly more than s accepting proofs for false statements. Our first result is a construction of non-uniformly sound certificates for all (Formula Presented) in the random oracle model, where the attacker’s advice can depend arbitrarily on the random oracle. We next show that the existence of non-uniformly sound certificates for (Formula Presented) (and collision resistant hash functions) yields a public-coin constant-round fully concurrent zero-knowledge argument for (Formula Presented).
Original language | English |
---|---|
Title of host publication | Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings |
Editors | Daniele Micciancio, Alexandra Boldyreva |
Publisher | Springer Verlag |
Pages | 98-127 |
Number of pages | 30 |
ISBN (Print) | 9783030269531 |
DOIs | |
State | Published - 2019 |
Externally published | Yes |
Event | 39th Annual International Cryptology Conference, CRYPTO 2019 - Santa Barbara, United States Duration: 18 Aug 2019 → 22 Aug 2019 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 11694 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 39th Annual International Cryptology Conference, CRYPTO 2019 |
---|---|
Country/Territory | United States |
City | Santa Barbara |
Period | 18/08/19 → 22/08/19 |
Bibliographical note
Publisher Copyright:© 2019, International Association for Cryptologic Research.