Sciweavers

2 search results - page 1 / 1
» Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Sort
View
IACR
2011
152views more  IACR 2011»
12 years 3 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
ASIACRYPT
2010
Springer
13 years 1 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 ...
Jens Groth