Jens Groth

According to our database, Jens Groth authored at least 67 papers between 2003 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Constraint-Friendly Map-to-Elliptic-Curve-Group Relations and Their Applications.

Jens Groth, Harjasleen Malvai, Andrew Miller, Yi-Nuo Zhang

IACR Cryptol. ePrint Arch., 2025

2024

Fast Batched Asynchronous Distributed Key Generation.

Jens Groth, Victor Shoup

Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2022

Design and analysis of a distributed ECDSA signing service.

Jens Groth, Victor Shoup

IACR Cryptol. ePrint Arch., 2022

On the Security of ECDSA with Additive Key Derivation and Presignatures.

Jens Groth, Victor Shoup

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021

Non-interactive distributed key generation and key resharing.

Jens Groth

IACR Cryptol. ePrint Arch., 2021

2020

Linear-Time Arguments with Sublinear Verification from Tensor Codes.

Jonathan Bootle, Alessandro Chiesa, Jens Groth

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

Efficient Fully Structure-Preserving Signatures and Shrinking Commitments.

Masayuki Abe, Jens Groth, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi

J. Cryptol., 2019

2018

Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.

Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller

IACR Cryptol. ePrint Arch., 2018

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.

Jonathan Bootle, Jens Groth

Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Updatable and Universal Common Reference Strings with Applications to zk-SNARKs.

Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.

Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.

Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs.

Jens Groth, Mary Maller

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups.

Essam Ghadafi, Jens Groth

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.

Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Efficient Zero-Knowledge Proof Systems.

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth

Proceedings of the Foundations of Security Analysis and Design VIII, 2016

On the Size of Pairing-Based Non-interactive Arguments.

Jens Groth

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Foundations of Fully Dynamic Group Signatures.

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth

Proceedings of the Applied Cryptography and Network Security, 2016

2015

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.

Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam D. Smith

J. Cryptol., 2015

Making Sigma-Protocols Non-interactive Without Random Oracles.

Pyrros Chaidos, Jens Groth

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin.

Jens Groth, Markulf Kohlweiss

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Short Accountable Ring Signatures Based on DDH.

Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit

Proceedings of the Computer Security - ESORICS 2015, 2015

Efficient Fully Structure-Preserving Signatures for Large Messages.

Jens Groth

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures.

Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Fine-Tuning Groth-Sahai Proofs.

Alex Escala, Jens Groth

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Structure-Preserving Signatures from Type II Pairings.

Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups.

Masayuki Abe, Jens Groth, Miyako Ohkubo, Takeya Tango

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Square Span Programs with Applications to Succinct NIZK Arguments.

George Danezis, Cédric Fournet, Jens Groth, Markulf Kohlweiss

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists.

Stephanie Bayer, Jens Groth

Proceedings of the Advances in Cryptology, 2013

2012

Efficient Noninteractive Proof Systems for Bilinear Groups.

Jens Groth, Amit Sahai

SIAM J. Comput., 2012

New Techniques for Noninteractive Zero-Knowledge.

Jens Groth, Rafail Ostrovsky, Amit Sahai

J. ACM, 2012

Efficient Zero-Knowledge Argument for Correctness of a Shuffle.

Stephanie Bayer, Jens Groth

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011

Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption.

Jens Groth

IACR Cryptol. ePrint Arch., 2011

Optimal Structure-Preserving Signatures.

Jens Groth

Proceedings of the Provable Security - 5th International Conference, 2011

Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups.

Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments.

Jens Groth

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Separating Short Structure-Preserving Signatures from Non-interactive Assumptions.

Masayuki Abe, Jens Groth, Miyako Ohkubo

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Efficient Zero-Knowledge Proofs.

Jens Groth

Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.

Jens Groth, Aggelos Kiayias, Helger Lipmaa

Proceedings of the Public Key Cryptography, 2010

Pairing-Based Non-interactive Zero-Knowledge Proofs.

Jens Groth

Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Structure-Preserving Signatures and Commitments to Group Elements.

Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo

Proceedings of the Advances in Cryptology, 2010

Short Non-interactive Zero-Knowledge Proofs.

Jens Groth

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Short Pairing-Based Non-interactive Zero-Knowledge Arguments.

Jens Groth

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments.

Jens Groth

IACR Cryptol. ePrint Arch., 2009

Homomorphic Trapdoor Commitments to Group Elements.

Jens Groth

IACR Cryptol. ePrint Arch., 2009

Linear Algebra with Sub-linear Zero-Knowledge Arguments.

Jens Groth

Proceedings of the Advances in Cryptology, 2009

2008

Efficient Non-interactive Proof Systems for Bilinear Groups.

Jens Groth, Amit Sahai

Proceedings of the Advances in Cryptology, 2008

Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.

Jens Groth, Yuval Ishai

Proceedings of the Advances in Cryptology, 2008

2007

Verifiable Shuffle of Large Size Ciphertexts.

Jens Groth, Steve Lu

Proceedings of the Public Key Cryptography, 2007

Ring Signatures of Sub-linear Size Without Random Oracles.

Nishanth Chandran, Jens Groth, Amit Sahai

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Cryptography in the Multi-string Model.

Jens Groth, Rafail Ostrovsky

Proceedings of the Advances in Cryptology, 2007

A Non-interactive Shuffle with Pairing Based Verifiability.

Jens Groth, Steve Lu

Proceedings of the Advances in Cryptology, 2007

Fully Anonymous Group Signatures Without Random Oracles.

Jens Groth

Proceedings of the Advances in Cryptology, 2007

2006

An Adaptively Secure Mix-Net Without Erasures.

Douglas Wikström, Jens Groth

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Perfect Non-interactive Zero Knowledge for NP.

Jens Groth, Rafail Ostrovsky, Amit Sahai

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Non-interactive Zaps and New Techniques for NIZK.

Jens Groth, Rafail Ostrovsky, Amit Sahai

Proceedings of the Advances in Cryptology, 2006

Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures.

Jens Groth

Proceedings of the Advances in Cryptology, 2006

2005

Cryptography in Subgroups of Z_n.

Jens Groth

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Non-interactive Zero-Knowledge Arguments for Voting.

Jens Groth

Proceedings of the Applied Cryptography and Network Security, 2005

2004

Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems.

Jens Groth

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Group Signatures: Better Efficiency and New Theoretical Aspects.

Jan Camenisch, Jens Groth

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast.

Jens Groth

Proceedings of the Financial Cryptography, 2004

Evaluating Security of Voting Schemes in the Universal Composability Framework.

Jens Groth

Proceedings of the Applied Cryptography and Network Security, 2004

2003

The Theory and Implementation of an Electronic Voting System.

Ivan Damgård, Jens Groth, Gorm Salomonsen

Proceedings of the Secure Electronic Voting, 2003

Non-interactive and reusable non-malleable commitment schemes.

Ivan Damgård, Jens Groth

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

A Verifiable Secret Shuffle of Homomorphic Encryptions.

Jens Groth

Proceedings of the Public Key Cryptography, 2003