Ligero++: A New Optimized Sublinear IOP

54Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Bhadauria, R., Fang, Z., Hazay, C., Venkitasubramaniam, M., Xie, T., & Zhang, Y. (2020). Ligero++: A New Optimized Sublinear IOP. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 2025–2038). Association for Computing Machinery. https://doi.org/10.1145/3372297.3417893

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free