Non-interactive Zaps and New Techniques for NIZK
By Jens Groth, Rafail M. Ostrovsky, Amit Sahai. 2006
218 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
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
- Eli Ben-Sasson
- Dan Boneh
- Allison Bishop
- Brent Waters
- Eran Tromer
- Alessandro Chiesa
- Amit Sahai
- Jens Groth
In Computational Theory and Mathematics
- Eli Ben-Sasson
- Allison Bishop
- Brent Waters
- Eran Tromer
- Amit Sahai
- Jens Groth
- Alessandro Chiesa
- Dan Boneh
Citations in the corpus
- 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 first linear size proofs based on standard assumptions.”
- Decentralizing Attribute-Based Encryption (2011, methodology): “We note that several systems such as BGN encryption [15], GrothOstrovsky-Sahai NIZK proofs [32], traitor tracing [16] , and predicate encryption [17, 36] were originally developed in the composite order setting, but later variants were developed in prime order groups [31, 48, 33, 35, 25, 26, 37].”
- Efficient Noninteractive Proof Systems for Bilinear Groups (2008, methodology): “Groth, Ostrovsky, and Sahai [27,26] investigated NIZK proofs for Circuit Satisfiability using bilinear groups.”
- 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.”
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures (2006, background): “Even more recently Groth, Ostrovsky and Sahai [29] have introduced the setting in this paper, a bilinear group of prime order and the DLIN assumption.”
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract (2013, background): “Reducing from BHRAM to sCSAT benefits many zero-knowledge argument systems, including [52, 51, 1, 48, 50, 49, 66, 35, 15].”