J
Jens Groth
Researcher at University College London
Publications - 85
Citations - 8695
Jens Groth is an academic researcher from University College London. The author has contributed to research in topics: Mathematical proof & Zero-knowledge proof. The author has an hindex of 46, co-authored 84 publications receiving 7176 citations. Previous affiliations of Jens Groth include University of California, Los Angeles & Cryptomathic.
Papers
More filters
Book ChapterDOI
Efficient non-interactive proof systems for bilinear groups
Jens Groth,Amit Sahai +1 more
TL;DR: In this article, a general methodology for constructing very simple and efficient non-interactive zero-knowledge proofs and noninteractive witness-indistinguishable proofs that work directly for groups with a bilinear map, without needing a reduction to Circuit Satisfiability is presented.
Book ChapterDOI
On the Size of Pairing-Based Non-interactive Arguments
TL;DR: It is shown that linear interactive proofs cannot have a linear decision procedure, and it follows that SNARGs where the prover and verifier use generic asymmetric bilinear group operations cannot consist of a single group element.
Book ChapterDOI
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
TL;DR: This work constructs non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero- knowledge and computational soundness and security is based on two new cryptographic assumptions.
Book ChapterDOI
Simulation-sound NIZK proofs for a practical language and constant size group signatures
TL;DR: This work gets the first group signature scheme satisfying the strong security definition of Bellare, Shi and Zhang in the standard model without random oracles where each group signature consists only of a constant number of group elements.
Book ChapterDOI
Structure-preserving signatures and commitments to group elements
TL;DR: This work focuses on schemes in bilinear groups that preserve parts of the group structure, which makes it easy to combine them with other primitives such as non-interactive zero-knowledge proofs for bilinears groups.