This paper follows the line of works that design concretely efficient transparent sublinear zero-knowledge Interactive Oracle Proofs (IOP). Arguments obtained via this paradigm have the advantages of not relying on public-key cryptography, not requiring a trusted setup, and resistance to known quantum attacks. In the realm of transparent systems, Ligero and Aurora stand out with incomparable advantages where the former has a fast prover algorithm somewhat succinct proofs and the latter has somewhat fast prover and succinct proofs. In this work, we introduce Ligero++ that combines the best features of both approaches to achieve the best of both worlds. We implement our protocol and benchmark the results.
|Title of host publication
|CCS 2020 - Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security
|Association for Computing Machinery
|Number of pages
|Published - 30 Oct 2020
|27th ACM SIGSAC Conference on Computer and Communications Security, CCS 2020 - Virtual, Online, United States
Duration: 9 Nov 2020 → 13 Nov 2020
|Proceedings of the ACM Conference on Computer and Communications Security
|27th ACM SIGSAC Conference on Computer and Communications Security, CCS 2020
|9/11/20 → 13/11/20
Bibliographical notePublisher Copyright:
© 2020 ACM.