Welcome to the resource topic for 2009/390
Title:
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments
Authors: Jens Groth
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.
ePrint: https://eprint.iacr.org/2009/390
Talk: https://www.youtube.com/watch?v=OseAdq0CoOY
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .