Sciweavers

Share
ASIACRYPT
2010
Springer

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

10 years 9 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
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 sub-linear size and very efficient public verification. The size of the non-interactive zero-knowledge arguments 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.
Jens Groth
Added 10 Feb 2011
Updated 10 Feb 2011
Type Journal
Year 2010
Where ASIACRYPT
Authors Jens Groth
Comments (0)
books