Cryptology ePrint Archive: Report 2009/390
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments
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.
Category / Keywords: foundations / Sub-linear size non-interactive zero-knowledge arguments, circuit satisfiability, pairing-based cryptography, generic group model.
Date: received 11 Aug 2009
Contact author: jg at brics dk
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20090815:023048 (All versions of this report)
Short URL: ia.cr/2009/390
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]