Paper 2009/390 Original: eprint.iacr.org/2009/390 ↗
Short Pairing-based Non-interactive Zero-Knowledge Arguments
Abstract
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero knowledge and computational soundness. The non-interactive zero-knowledge arguments have sublinear size and very efficient public verification. Their size can even be reduced to a constant number of group elements if we allow the common reference string to be large. Our constructions rely on groups with pairings, and security is based on two new cryptographic assumptions; we do not use the Fiat-Shamir heuristic or random oracles.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2026-04-19: last updated
- 2009-08-15: published
- Short URL
- https://ia.cr/2009/390
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/390,
author = {Jens Groth},
title = {Short Pairing-based Non-interactive Zero-Knowledge Arguments},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/390},
year = {2009},
url = {https://eprint.iacr.org/2009/390}
}