Jens Groth

102 papers A* 12A 7B 6C 3Misc 1Journal 44Unranked 28
YearRankTypeTitle / Venue / Authors
2025 — conf
Constraint-Friendly Map-to-Elliptic-Curve-Group Relations and Their Applications.
ASIACRYPT (2)
Jens Groth, Harjasleen Malvai, Andrew Miller, Yi-Nuo Zhang
2025 J jnl
Constraint-Friendly Map-to-Elliptic-Curve-Group Relations and Their Applications.
IACR Cryptol. ePrint Arch.
Jens Groth, Harjasleen Malvai, Andrew Miller, Yi-Nuo Zhang
2024 — conf
Fast Batched Asynchronous Distributed Key Generation.
EUROCRYPT (5)
Jens Groth, Victor Shoup
2023 J jnl
Fast batched asynchronous distributed key generation.
IACR Cryptol. ePrint Arch.
Jens Groth, Victor Shoup
2022 J jnl
Design and analysis of a distributed ECDSA signing service.
IACR Cryptol. ePrint Arch.
Jens Groth, Victor Shoup
2022 — conf
On the Security of ECDSA with Additive Key Derivation and Presignatures.
EUROCRYPT (1)
Jens Groth, Victor Shoup
2021 J jnl
Non-interactive distributed key generation and key resharing.
IACR Cryptol. ePrint Arch.
Jens Groth
2021 J jnl
On the security of ECDSA with additive key derivation and presignatures.
IACR Cryptol. ePrint Arch.
Jens Groth, Victor Shoup
2020 J jnl
Foundations of Fully Dynamic Group Signatures.
J. Cryptol.
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth
2020 — conf
Linear-Time Arguments with Sublinear Verification from Tensor Codes.
TCC (2)
Jonathan Bootle, Alessandro Chiesa, Jens Groth
2020 J jnl
Linear-Time Arguments with Sublinear Verification from Tensor Codes.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Alessandro Chiesa, Jens Groth
2019 J jnl
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments.
J. Cryptol.
Masayuki Abe, Jens Groth, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi
2018 — conf
Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
ASIACRYPT (1)
Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller
2018 — conf
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.
Public Key Cryptography (2)
Jonathan Bootle, Jens Groth
2018 J jnl
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Jens Groth
2018 J jnl
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Andrea Cerulli, Jens Groth, Sune K. Jakobsen, Mary Maller
2018 J jnl
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
IACR Cryptol. ePrint Arch.
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky
2018 — conf
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
CRYPTO (2)
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky
2018 — conf
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs.
CRYPTO (3)
Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers
2018 J jnl
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs.
IACR Cryptol. ePrint Arch.
Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn, Ian Miers
2017 — conf
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
ASIACRYPT (3)
Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen
2017 J jnl
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen
2017 — conf
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs.
CRYPTO (2)
Jens Groth, Mary Maller
2017 J jnl
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs.
IACR Cryptol. ePrint Arch.
Jens Groth, Mary Maller
2017 — conf
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups.
ASIACRYPT (2)
Essam Ghadafi, Jens Groth
2017 J jnl
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups.
IACR Cryptol. ePrint Arch.
Essam Ghadafi, Jens Groth
2016 — conf
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
EUROCRYPT (2)
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit
2016 J jnl
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit
2016 — conf
Efficient Zero-Knowledge Proof Systems.
FOSAD
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth
2016 B conf
Foundations of Fully Dynamic Group Signatures.
ACNS
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth
2016 J jnl
Foundations of Fully Dynamic Group Signatures.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth
2016 — conf
On the Size of Pairing-Based Non-interactive Arguments.
EUROCRYPT (2)
Jens Groth
2016 J jnl
On the Size of Pairing-based Non-interactive Arguments.
IACR Cryptol. ePrint Arch.
Jens Groth
2016 J jnl
Structure-Preserving Signatures and Commitments to Group Elements.
J. Cryptol.
Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo
2015 C ed.
Cryptography and Coding - 15th IMA International Conference, IMACC 2015, Oxford, UK, December 15-17, 2015. Proceedings
IMACC
Jens Groth
2015 — conf
Efficient Fully Structure-Preserving Signatures for Large Messages.
ASIACRYPT (1)
Jens Groth
2015 J jnl
Efficient Fully Structure-Preserving Signatures for Large Messages.
IACR Cryptol. ePrint Arch.
Jens Groth
2015 — conf
Making Sigma-Protocols Non-interactive Without Random Oracles.
Public Key Cryptography
Pyrros Chaidos, Jens Groth
2015 — conf
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin.
EUROCRYPT (2)
Jens Groth, Markulf Kohlweiss
2015 — conf
Short Accountable Ring Signatures Based on DDH.
ESORICS (1)
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit
2015 J jnl
Short Accountable Ring Signatures Based on DDH.
IACR Cryptol. ePrint Arch.
Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, Christophe Petit
2015 J jnl
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.
J. Cryptol.
Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam D. Smith
2015 J jnl
Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists.
IACR Cryptol. ePrint Arch.
Stephanie Bayer, Jens Groth
2014 — conf
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups.
CRYPTO (1)
Masayuki Abe, Jens Groth, Miyako Ohkubo, Takeya Tango
2014 J jnl
Cryptography in the Multi-string Model.
J. Cryptol.
Jens Groth, Rafail Ostrovsky
2014 — conf
Fine-Tuning Groth-Sahai Proofs.
Public Key Cryptography
Alex Escala, Jens Groth
2014 J jnl
One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin.
IACR Cryptol. ePrint Arch.
Jens Groth, Markulf Kohlweiss
2014 — conf
Square Span Programs with Applications to Succinct NIZK Arguments.
ASIACRYPT (1)
George Danezis, Cédric Fournet, Jens Groth, Markulf Kohlweiss
2014 J jnl
Square Span Programs with Applications to Succinct NIZK Arguments.
IACR Cryptol. ePrint Arch.
George Danezis, Cédric Fournet, Jens Groth, Markulf Kohlweiss
2014 — conf
Structure-Preserving Signatures from Type II Pairings.
CRYPTO (1)
Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi
2014 J jnl
Structure-Preserving Signatures from Type II Pairings.
IACR Cryptol. ePrint Arch.
Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi
2014 B conf
Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures.
TCC
Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi
2014 J jnl
Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures.
IACR Cryptol. ePrint Arch.
Masayuki Abe, Jens Groth, Miyako Ohkubo, Mehdi Tibouchi
2013 J jnl
Fine-Tuning Groth-Sahai Proofs.
IACR Cryptol. ePrint Arch.
Alex Escala, Jens Groth
2013 A* conf
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists.
EUROCRYPT
Stephanie Bayer, Jens Groth
2012 J jnl
Efficient Noninteractive Proof Systems for Bilinear Groups.
SIAM J. Comput.
Jens Groth, Amit Sahai
2012 A* conf
Efficient Zero-Knowledge Argument for Correctness of a Shuffle.
EUROCRYPT
Stephanie Bayer, Jens Groth
2012 J jnl
New Techniques for Noninteractive Zero-Knowledge.
J. ACM
Jens Groth, Rafail Ostrovsky, Amit Sahai
2011 A conf
Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments.
ASIACRYPT
Jens Groth
2011 — conf
Efficient Zero-Knowledge Proofs.
AFRICACRYPT
Jens Groth
2011 J jnl
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch.
Jens Groth
2011 A* conf
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups.
CRYPTO
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo
2011 C conf
Optimal Structure-Preserving Signatures.
ProvSec
Jens Groth
2011 A conf
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions.
ASIACRYPT
Masayuki Abe, Jens Groth, Miyako Ohkubo
2010 J jnl
A Verifiable Secret Shuffle of Homomorphic Encryptions.
J. Cryptol.
Jens Groth
2010 — conf
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.
Public Key Cryptography
Jens Groth, Aggelos Kiayias, Helger Lipmaa
2010 C conf
Pairing-Based Non-interactive Zero-Knowledge Proofs.
Pairing
Jens Groth
2010 A conf
Short Non-interactive Zero-Knowledge Proofs.
ASIACRYPT
Jens Groth
2010 A conf
Short Pairing-Based Non-interactive Zero-Knowledge Arguments.
ASIACRYPT
Jens Groth
2010 A* conf
Structure-Preserving Signatures and Commitments to Group Elements.
CRYPTO
Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo
2009 J jnl
Homomorphic Trapdoor Commitments to Group Elements.
IACR Cryptol. ePrint Arch.
Jens Groth
2009 A* conf
Linear Algebra with Sub-linear Zero-Knowledge Arguments.
CRYPTO
Jens Groth
2009 J jnl
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments.
IACR Cryptol. ePrint Arch.
Jens Groth
2008 A* conf
Efficient Non-interactive Proof Systems for Bilinear Groups.
EUROCRYPT
Jens Groth, Amit Sahai
2008 A* conf
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.
EUROCRYPT
Jens Groth, Yuval Ishai
2007 A conf
A Non-interactive Shuffle with Pairing Based Verifiability.
ASIACRYPT
Jens Groth, Steve Lu
2007 A* conf
Cryptography in the Multi-string Model.
CRYPTO
Jens Groth, Rafail Ostrovsky
2007 J jnl
Efficient Non-interactive Proof Systems for Bilinear Groups.
Electron. Colloquium Comput. Complex.
Jens Groth, Amit Sahai
2007 J jnl
Efficient Non-interactive Proof Systems for Bilinear Groups.
IACR Cryptol. ePrint Arch.
Jens Groth, Amit Sahai
2007 A conf
Fully Anonymous Group Signatures Without Random Oracles.
ASIACRYPT
Jens Groth
2007 J jnl
Fully Anonymous Group Signatures without Random Oracles.
IACR Cryptol. ePrint Arch.
Jens Groth
2007 A* conf
Ring Signatures of Sub-linear Size Without Random Oracles.
ICALP
Nishanth Chandran, Jens Groth, Amit Sahai
2007 — conf
Verifiable Shuffle of Large Size Ciphertexts.
Public Key Cryptography
Jens Groth, Steve Lu
2006 — conf
An Adaptively Secure Mix-Net Without Erasures.
ICALP (2)
Douglas Wikström, Jens Groth
2006 J jnl
Cryptography in the Multi-string Model.
IACR Cryptol. ePrint Arch.
Jens Groth, Rafail Ostrovsky
2006 A* conf
Non-interactive Zaps and New Techniques for NIZK.
CRYPTO
Jens Groth, Rafail Ostrovsky, Amit Sahai
2006 A* conf
Perfect Non-interactive Zero Knowledge for NP.
EUROCRYPT
Jens Groth, Rafail Ostrovsky, Amit Sahai
2006 A conf
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures.
ASIACRYPT
Jens Groth
2005 J jnl
A Verifiable Secret Shuffle of Homomorphic Encryptions.
IACR Cryptol. ePrint Arch.
Jens Groth
2005 B conf
Cryptography in Subgroups of Z
TCC
Jens Groth
2005 B conf
Non-interactive Zero-Knowledge Arguments for Voting.
ACNS
Jens Groth
2005 J jnl
Perfect Non-Interactive Zero Knowledge for NP
Electron. Colloquium Comput. Complex.
Jens Groth, Rafail Ostrovsky, Amit Sahai
2005 J jnl
Perfect Non-Interactive Zero Knowledge for NP.
IACR Cryptol. ePrint Arch.
Jens Groth, Rafail Ostrovsky, Amit Sahai
2004 — conf
Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast.
Financial Cryptography
Jens Groth
2004 B conf
Evaluating Security of Voting Schemes in the Universal Composability Framework.
ACNS
Jens Groth
2004 Misc conf
Group Signatures: Better Efficiency and New Theoretical Aspects.
SCN
Jan Camenisch, Jens Groth
2004 B conf
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems.
TCC
Jens Groth
2003 — conf
A Verifiable Secret Shuffle of Homomorphic Encryptions.
Public Key Cryptography
Jens Groth
2003 J jnl
Non-interactive and Reusable Non-malleable Commitment Schemes.
IACR Cryptol. ePrint Arch.
Ivan Damgård, Jens Groth
2003 A* conf
Non-interactive and reusable non-malleable commitment schemes.
STOC
Ivan Damgård, Jens Groth
2003 — ch.
The Theory and Implementation of an Electronic Voting System.
Secure Electronic Voting
Ivan Damgård, Jens Groth, Gorm Salomonsen
2002 J jnl
Evaluating Security of Voting Schemes in the Universal Composability Framework.
IACR Cryptol. ePrint Arch.
Jens Groth