Paper 2009/390
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments
Jens Groth
Abstract
We construct non-interactive zero-knowledge arguments for circuit satisfiability and arithmetic circuits with perfect completeness, perfect zero-knowledge and computational (co-)soundness. The non-interactive zero-knowledge arguments have sub-linear size and very efficient public verification. Our construction uses bilinear groups and is only proven secure in the generic group model, but does not rely on random oracles.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- circuit satisfiabilitypairing-based cryptographygeneric group model.
- Contact author(s)
- jg @ brics dk
- History
- 2009-08-15: received
- Short URL
- https://ia.cr/2009/390
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/390,
author = {Jens Groth},
title = {Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/390},
year = {2009},
url = {https://eprint.iacr.org/2009/390}
}
