Sciweavers

Share
2 search results - page 1 / 1
» On the Size of Pairing-based Non-interactive Arguments
Sort
View
IACR
2011
152views more  IACR 2011»
9 years 11 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 satis´Čüability in the common reference string model. We p...
Helger Lipmaa
ASIACRYPT
2010
Springer
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 ...
Jens Groth
books