Follow
Jens Groth
Jens Groth
Principal Researcher, DFINITY
Verified email at ucl.ac.uk - Homepage
Title
Cited by
Cited by
Year
Efficient non-interactive proof systems for bilinear groups
J Groth, A Sahai
Annual International Conference on the Theory and Applications of …, 2008
10002008
On the size of pairing-based non-interactive arguments
J Groth
Annual international conference on the theory and applications of …, 2016
5792016
Short pairing-based non-interactive zero-knowledge arguments
J Groth
International Conference on the Theory and Application of Cryptology and …, 2010
4512010
Simulation-sound NIZK proofs for a practical language and constant size group signatures
J Groth
International Conference on the Theory and Application of Cryptology and …, 2006
4072006
Perfect non-interactive zero knowledge for NP
J Groth, R Ostrovsky, A Sahai
Annual International Conference on the Theory and Applications of …, 2006
3962006
Structure-preserving signatures and commitments to group elements
M Abe, G Fuchsbauer, J Groth, K Haralambiev, M Ohkubo
Annual Cryptology Conference, 209-236, 2010
3692010
Fully anonymous group signatures without random oracles
J Groth
International conference on the theory and application of cryptology and …, 2007
2962007
Group signatures: Better efficiency and new theoretical aspects
J Camenisch, J Groth
International Conference on Security in Communication Networks, 120-133, 2004
2822004
Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
J Bootle, A Cerulli, P Chaidos, J Groth, C Petit
Annual International Conference on the Theory and Applications of …, 2016
2472016
Efficient zero-knowledge argument for correctness of a shuffle
S Bayer, J Groth
Annual International Conference on the Theory and Applications of …, 2012
2472012
A verifiable secret shuffe of homomorphic encryptions
J Groth
International Workshop on Public Key Cryptography, 145-160, 2003
2262003
Non-interactive zaps and new techniques for NIZK
J Groth, R Ostrovsky, A Sahai
Annual International Cryptology Conference, 97-111, 2006
2112006
New techniques for noninteractive zero-knowledge
J Groth, R Ostrovsky, A Sahai
Journal of the ACM (JACM) 59 (3), 1-35, 2012
1822012
One-out-of-many proofs: Or how to leak a secret and spend a coin
J Groth, M Kohlweiss
Annual International Conference on the Theory and Applications of …, 2015
1682015
Efficient noninteractive proof systems for bilinear groups
J Groth, A Sahai
SIAM Journal on Computing 41 (5), 1193-1232, 2012
1672012
Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs
J Groth, M Maller
Annual International Cryptology Conference, 581-612, 2017
1602017
Non-interactive zero-knowledge arguments for voting
J Groth
International Conference on Applied Cryptography and Network Security, 467-482, 2005
1512005
Non-interactive and reusable non-malleable commitment schemes
I Damgard, J Groth
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
1452003
Optimal structure-preserving signatures in asymmetric bilinear groups
M Abe, J Groth, K Haralambiev, M Ohkubo
Advances in Cryptology–CRYPTO 2011, 649-666, 2011
1372011
Ring signatures of sub-linear size without random oracles
N Chandran, J Groth, A Sahai
International Colloquium on Automata, Languages, and Programming, 423-434, 2007
1372007
The system can't perform the operation now. Try again later.
Articles 1–20