Jens Groth

Orcid: 0000-0001-6291-7832

Affiliations:
  • DFINITY, Zurich, Switzerland


According to our database1, Jens Groth authored at least 66 papers between 2002 and 2023.

Collaborative distances:

Timeline

2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
2
2
1
4
3
3
4
5
1
2
1
1
2
2
1
1
1
1
1
1
1
1
5
4
1
1
3
3
2
3

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast batched asynchronous distributed key generation.
IACR Cryptol. ePrint Arch., 2023

2022
Design and analysis of a distributed ECDSA signing service.
IACR Cryptol. ePrint Arch., 2022

2021
On the security of ECDSA with additive key derivation and presignatures.
IACR Cryptol. ePrint Arch., 2021

Non-interactive distributed key generation and key resharing.
IACR Cryptol. ePrint Arch., 2021

2020
Foundations of Fully Dynamic Group Signatures.
J. Cryptol., 2020

Linear-Time Arguments with Sublinear Verification from Tensor Codes.
IACR Cryptol. ePrint Arch., 2020

2019
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments.
J. Cryptol., 2019

2018
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs.
IACR Cryptol. ePrint Arch., 2018

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.
IACR Cryptol. ePrint Arch., 2018

Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
IACR Cryptol. ePrint Arch., 2018

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2018

Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs.
IACR Cryptol. ePrint Arch., 2017

Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups.
IACR Cryptol. ePrint Arch., 2017

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
IACR Cryptol. ePrint Arch., 2017

2016
Structure-Preserving Signatures and Commitments to Group Elements.
J. Cryptol., 2016

On the Size of Pairing-based Non-interactive Arguments.
IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Proof Systems.
Proceedings of the Foundations of Security Analysis and Design VIII, 2016

2015
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.
J. Cryptol., 2015

Efficient Fully Structure-Preserving Signatures for Large Messages.
IACR Cryptol. ePrint Arch., 2015

Short Accountable Ring Signatures Based on DDH.
IACR Cryptol. ePrint Arch., 2015

Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists.
IACR Cryptol. ePrint Arch., 2015

Making Sigma-Protocols Non-interactive Without Random Oracles.
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

2014
Cryptography in the Multi-string Model.
J. Cryptol., 2014

One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin.
IACR Cryptol. ePrint Arch., 2014

Square Span Programs with Applications to Succinct NIZK Arguments.
IACR Cryptol. ePrint Arch., 2014

Structure-Preserving Signatures from Type II Pairings.
IACR Cryptol. ePrint Arch., 2014

Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures.
IACR Cryptol. ePrint Arch., 2014

Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
Fine-Tuning Groth-Sahai Proofs.
IACR Cryptol. ePrint Arch., 2013

2012
Efficient Noninteractive Proof Systems for Bilinear Groups.
SIAM J. Comput., 2012

New Techniques for Noninteractive Zero-Knowledge.
J. ACM, 2012

Efficient Zero-Knowledge Argument for Correctness of a Shuffle.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2011

Optimal Structure-Preserving Signatures.
Proceedings of the Provable Security - 5th International Conference, 2011

Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Separating Short Structure-Preserving Signatures from Non-interactive Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Efficient Zero-Knowledge Proofs.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010
A Verifiable Secret Shuffle of Homomorphic Encryptions.
J. Cryptol., 2010

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.
Proceedings of the Public Key Cryptography, 2010

Pairing-Based Non-interactive Zero-Knowledge Proofs.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Short Non-interactive Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Short Pairing-Based Non-interactive Zero-Knowledge Arguments.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Sub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments.
IACR Cryptol. ePrint Arch., 2009

Homomorphic Trapdoor Commitments to Group Elements.
IACR Cryptol. ePrint Arch., 2009

Linear Algebra with Sub-linear Zero-Knowledge Arguments.
Proceedings of the Advances in Cryptology, 2009

2008
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.
Proceedings of the Advances in Cryptology, 2008

2007
Fully Anonymous Group Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2007

Efficient Non-interactive Proof Systems for Bilinear Groups.
Electron. Colloquium Comput. Complex., 2007

Verifiable Shuffle of Large Size Ciphertexts.
Proceedings of the Public Key Cryptography, 2007

Ring Signatures of Sub-linear Size Without Random Oracles.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

A Non-interactive Shuffle with Pairing Based Verifiability.
Proceedings of the Advances in Cryptology, 2007

2006
An Adaptively Secure Mix-Net Without Erasures.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Non-interactive Zaps and New Techniques for NIZK.
Proceedings of the Advances in Cryptology, 2006

Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures.
Proceedings of the Advances in Cryptology, 2006

2005
Perfect Non-Interactive Zero Knowledge for NP
Electron. Colloquium Comput. Complex., 2005

Cryptography in Subgroups of Z<sub>n</sub>.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Non-interactive Zero-Knowledge Arguments for Voting.
Proceedings of the Applied Cryptography and Network Security, 2005

2004
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Group Signatures: Better Efficiency and New Theoretical Aspects.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast.
Proceedings of the Financial Cryptography, 2004

2003
The Theory and Implementation of an Electronic Voting System.
Proceedings of the Secure Electronic Voting, 2003

Non-interactive and Reusable Non-malleable Commitment Schemes.
IACR Cryptol. ePrint Arch., 2003

2002
Evaluating Security of Voting Schemes in the Universal Composability Framework.
IACR Cryptol. ePrint Arch., 2002


  Loading...