Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures

By Jens Groth. International Conference on the Theory and Application of Cryptology and Information Security, 2006

433 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/79c6318aa384f28652ea451f22dc979b0f6013f7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Geometry and Topology

Citations in the corpus

Doubly-Efficient zkSNARKs Without Trusted Setup (2018, background): “More recent work [24, 27, 28, 30, 51, 52, 55] avoids those issues, but generally entails many expensive cryptographic operations.”
Attribute-Based Signatures (2011, methodology): “• In Appendix E we show how our techniques of incorporating digital signatures and noninteractive proofs can be used to add simulation-extractability to the Groth-Sahai proof system, several orders of magnitude more efficiently than the only other comparable scheme, constucted by Groth in [21].”
Succinct Malleable NIZKs and an Application to Compact Shuffles (2013, background): “In terms of controlling malleability, the main definition of CKLM reconciles simulation soundness [29,12] and simulation-sound extractability [21] with malleability by requiring that, for a set of transformations T , if an adversary can produce a proof π that x ∈ LR then the extractor can extract fr”
On the Size of Pairing-Based Non-interactive Arguments (2016, background): “Groth, Ostrovsky and Sahai [GOS12,GOS06,Gro06,GS12] introduced pairing-based NIZK proofs, yielding the ﬁrst linear size proofs based on standard assumptions.”
Structure-Preserving Signatures and Commitments to Group Elements (2010, methodology): “Research on signature schemes that are compatible with GS proofs was initiated in [ Gro06 ].”
Short Pairing-Based Non-interactive Zero-Knowledge Arguments (2010, background): “In some special cases, for instance in the ring signature of Chandran, Groth and Sahai [CGS07], these techniques lead to sub-linear size NIZK proofs but in general the number of group elements in an NIZK proof grows linearly in the size of the statement.”
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends (2017, background): “The latter property is also known under the name of robust NIZK [47], [29].”
Efficient Noninteractive Proof Systems for Bilinear Groups (2008, background): “Groth [23] was the first to suggest a general group-dependent language and NIZK proofs for statements in this language.”