Paper 2018/560
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafael del Pino, Jens Groth, and Vadim Lyubashevsky
Abstract
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic circuit satisfiability over a prime
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in CRYPTO 2018
- Keywords
- Zero-KnowledgeArithmetic CircuitsSub-linear proofsCommitments
- Contact author(s)
-
carsten baum @ biu ac il
jonathan bootle 14 @ ucl ac uk
andrea cerulli 13 @ ucl ac uk
Rafael Del Pino @ ens fr
j groth @ ucl ac uk
vadim lyubash @ gmail com - History
- 2018-06-04: received
- Short URL
- https://ia.cr/2018/560
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/560, author = {Carsten Baum and Jonathan Bootle and Andrea Cerulli and Rafael del Pino and Jens Groth and Vadim Lyubashevsky}, title = {Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/560}, year = {2018}, url = {https://eprint.iacr.org/2018/560} }