| On the size of pairing-based non-interactive arguments J Groth Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 1422 | 2016 |
| Efficient non-interactive proof systems for bilinear groups J Groth, A Sahai Annual International Conference on the Theory and Applications of …, 2008 | 1182 | 2008 |
| Short pairing-based non-interactive zero-knowledge arguments J Groth Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the …, 2010 | 620 | 2010 |
| Simulation-sound NIZK proofs for a practical language and constant size group signatures J Groth Advances in Cryptology–ASIACRYPT 2006: 12th International Conference on the …, 2006 | 490 | 2006 |
| Perfect non-interactive zero knowledge for NP J Groth, R Ostrovsky, A Sahai Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference …, 2006 | 477 | 2006 |
| Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting J Bootle, A Cerulli, P Chaidos, J Groth, C Petit Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 472 | 2016 |
| Structure-preserving signatures and commitments to group elements M Abe, G Fuchsbauer, J Groth, K Haralambiev, M Ohkubo Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010 | 443 | 2010 |
| Efficient zero-knowledge argument for correctness of a shuffle S Bayer, J Groth Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012 | 329 | 2012 |
| Fully anonymous group signatures without random oracles J Groth Advances in Cryptology–ASIACRYPT 2007: 13th International Conference on the …, 2007 | 313 | 2007 |
| Group signatures: Better efficiency and new theoretical aspects J Camenisch, J Groth International Conference on Security in Communication Networks, 120-133, 2004 | 296 | 2004 |
| 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 | 283 | 2015 |
| Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs J Groth, M Maller Annual International Cryptology Conference, 581-612, 2017 | 276 | 2017 |
| Non-interactive zaps and new techniques for NIZK J Groth, R Ostrovsky, A Sahai Advances in Cryptology-CRYPTO 2006: 26th Annual International Cryptology …, 2006 | 259 | 2006 |
| Updatable and universal common reference strings with applications to zk-SNARKs J Groth, M Kohlweiss, M Maller, S Meiklejohn, I Miers Annual International Cryptology Conference, 698-728, 2018 | 239 | 2018 |
| A verifiable secret shuffe of homomorphic encryptions J Groth International Workshop on Public Key Cryptography, 145-160, 2002 | 235 | 2002 |
| New techniques for noninteractive zero-knowledge J Groth, R Ostrovsky, A Sahai Journal of the ACM (JACM) 59 (3), 1-35, 2012 | 232 | 2012 |
| Efficient noninteractive proof systems for bilinear groups J Groth, A Sahai SIAM Journal on Computing 41 (5), 1193-1232, 2012 | 202 | 2012 |
| Non-interactive zero-knowledge arguments for voting J Groth Applied Cryptography and Network Security: Third International Conference …, 2005 | 201 | 2005 |
| Optimal structure-preserving signatures in asymmetric bilinear groups M Abe, J Groth, K Haralambiev, M Ohkubo Advances in Cryptology–CRYPTO 2011, 649-666, 2011 | 176 | 2011 |
| Square span programs with applications to succinct NIZK arguments G Danezis, C Fournet, J Groth, M Kohlweiss International Conference on the Theory and Application of Cryptology and …, 2014 | 167 | 2014 |
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLA在 cs.ucla.edu 的电子邮件经过验证
