| 2025 | ASIACRYPT | Constraint-Friendly Map-to-Elliptic-Curve-Group Relations and Their Applications. | Jens Groth, Harjasleen Malvai, Andrew Miller, Yi-Nuo Zhang |
| 2024 | EuroCrypt | Fast Batched Asynchronous Distributed Key Generation. | Jens Groth, Victor Shoup |
| 2022 | EuroCrypt | On the Security of ECDSA with Additive Key Derivation and Presignatures. | Jens Groth, Victor Shoup |
| 2020 | TCC | Linear-Time Arguments with Sublinear Verification from Tensor Codes. | Jonathan Bootle, Alessandro Chiesa, Jens Groth |
| 2018 | ASIACRYPT | Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. | Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller |
| 2018 | CRYPTO | Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. | Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafal del Pino, Jens Groth, Vadim Lyubashevsky |
| 2018 | CRYPTO | Updatable and Universal Common Reference Strings with Applications to zk-SNARKs. | Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers |
| 2018 | PKC | Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials. | Jonathan Bootle, Jens Groth |
| 2017 | ASIACRYPT | Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. | Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen |
| 2017 | ASIACRYPT | Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups. | Essam Ghadafi, Jens Groth |
| 2017 | CRYPTO | Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs. | Jens Groth, Mary Maller |
| 2016 | ACNS | Foundations of Fully Dynamic Group Signatures. | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth |
| 2016 | EuroCrypt | Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit |
| 2016 | EuroCrypt | On the Size of Pairing-Based Non-interactive Arguments. | Jens Groth |
| 2015 | ASIACRYPT | Efficient Fully Structure-Preserving Signatures for Large Messages. | Jens Groth |
| 2015 | ESORICS | Short Accountable Ring Signatures Based on DDH. | Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit |
| 2015 | EuroCrypt | One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin. | Jens Groth, Markulf Kohlweiss |
| 2015 | PKC | Making Sigma-Protocols Non-interactive Without Random Oracles. | Pyrros Chaidos, Jens Groth |
| 2014 | ASIACRYPT | Square Span Programs with Applications to Succinct NIZK Arguments. | George Danezis, Cdric Fournet, Jens Groth, Markulf Kohlweiss |
| 2014 | CRYPTO | Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups. | Masayuki Abe, Jens Groth, Miyako Ohkubo, Takeya Tango |
| 2014 | CRYPTO | Structure-Preserving Signatures from Type II Pairings. | Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi |
| 2014 | PKC | Fine-Tuning Groth-Sahai Proofs. | Alex Escala, Jens Groth |
| 2014 | TCC | Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures. | Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi |
| 2013 | EuroCrypt | Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists. | Stephanie Bayer, Jens Groth |
| 2012 | EuroCrypt | Efficient Zero-Knowledge Argument for Correctness of a Shuffle. | Stephanie Bayer, Jens Groth |
| 2011 | ASIACRYPT | Separating Short Structure-Preserving Signatures from Non-interactive Assumptions. | Masayuki Abe, Jens Groth, Miyako Ohkubo |
| 2011 | ASIACRYPT | Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments. | Jens Groth |
| 2011 | CRYPTO | Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups. | Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo |
| 2011 | ProvSec | Optimal Structure-Preserving Signatures. | Jens Groth |
| 2010 | ASIACRYPT | Short Pairing-Based Non-interactive Zero-Knowledge Arguments. | Jens Groth |
| 2010 | ASIACRYPT | Short Non-interactive Zero-Knowledge Proofs. | Jens Groth |
| 2010 | CRYPTO | Structure-Preserving Signatures and Commitments to Group Elements. | Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo |
| 2010 | Pairing | Pairing-Based Non-interactive Zero-Knowledge Proofs. | Jens Groth |
| 2010 | PKC | Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. | Jens Groth, Aggelos Kiayias, Helger Lipmaa |
| 2009 | CRYPTO | Linear Algebra with Sub-linear Zero-Knowledge Arguments. | Jens Groth |
| 2008 | EuroCrypt | Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. | Jens Groth, Yuval Ishai |
| 2008 | EuroCrypt | Efficient Non-interactive Proof Systems for Bilinear Groups. | Jens Groth, Amit Sahai |
| 2007 | ASIACRYPT | Fully Anonymous Group Signatures Without Random Oracles. | Jens Groth |
| 2007 | ASIACRYPT | A Non-interactive Shuffle with Pairing Based Verifiability. | Jens Groth, Steve Lu |
| 2007 | CRYPTO | Cryptography in the Multi-string Model. | Jens Groth, Rafail Ostrovsky |
| 2007 | ICALP | Ring Signatures of Sub-linear Size Without Random Oracles. | Nishanth Chandran, Jens Groth, Amit Sahai |
| 2007 | PKC | Verifiable Shuffle of Large Size Ciphertexts. | Jens Groth, Steve Lu |
| 2006 | ASIACRYPT | Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. | Jens Groth |
| 2006 | CRYPTO | Non-interactive Zaps and New Techniques for NIZK. | Jens Groth, Rafail Ostrovsky, Amit Sahai |
| 2006 | EuroCrypt | Perfect Non-interactive Zero Knowledge for NP. | Jens Groth, Rafail Ostrovsky, Amit Sahai |
| 2006 | ICALP | An Adaptively Secure Mix-Net Without Erasures. | Douglas Wikstrm, Jens Groth |
| 2005 | ACNS | Non-interactive Zero-Knowledge Arguments for Voting. | Jens Groth |
| 2005 | TCC | Cryptography in Subgroups of Z | Jens Groth |
| 2004 | ACNS | Evaluating Security of Voting Schemes in the Universal Composability Framework. | Jens Groth |
| 2004 | FC | Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast. | Jens Groth |
| 2004 | SCN | Group Signatures: Better Efficiency and New Theoretical Aspects. | Jan Camenisch, Jens Groth |
| 2004 | TCC | Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems. | Jens Groth |
| 2003 | PKC | A Verifiable Secret Shuffle of Homomorphic Encryptions. | Jens Groth |
| 2003 | STOC | Non-interactive and reusable non-malleable commitment schemes. | Ivan Damgrd, Jens Groth |