Jens Groth
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jens Groth has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Jonathan Bootle
IBM Research Zurich
9 shared publications Masayuki Abe
NTT Secure Platform Laboratories
6 shared publicationsMiyako Ohkubo
Security Architecture Lab, NSRI, NICT
6 shared publicationsAndrea Cerulli
5 shared publications- Essam Ghadafi
Newcastle University
5 shared publications Amit Sahai
3 shared publications
Latest Publications
- 10 May 2025
- Published by Springer Nature
- p. 2452-2456
SNARK
- 29 April 2024
- Published by Springer Nature
- p. 370-400
Fast Batched Asynchronous Distributed Key Generation
- 29 April 2024
- Published by Springer Nature
- p. 370-400
Fast Batched Asynchronous Distributed Key Generation
- Open Access
- 2 June 2020
- Published by Springer Nature in Journal of Cryptology
- Vol. 33 (4) , 1822-1870
Foundations of Fully Dynamic Group Signatures
Group signatures allow members of a group to anonymously sign on behalf of the group. Membership is administered by a designated group manager. The group manager can also reveal the identity of a signer if and when needed to enforce accountability and deter abuse. For group signatures to be applicable in practice, they need to support fully dynamic groups, i.e., users may join and leave at any time. Existing security definitions for fully dynamic group signatures are informal, have shortcomings, and are mutually incompatible. We fill the gap by providing a formal rigorous security model for fully dynamic group signatures. Our model is general and is not tailored toward a specific design paradigm and can therefore, as we show, be used to argue about the security of different existing constructions following different design paradigms. Our definitions are stringent and when possible incorporate protection against maliciously chosen keys. We consider both the case where the group management and tracing signatures are administered by the same authority, i.e., a single group manager, and also the case where those roles are administered by two separate authorities, i.e., a group manager and an opening authority. We also show that a specialization of our model captures existing models for static and partially dynamic schemes. In the process, we identify a subtle gap in the security achieved by group signatures using revocation lists. We show that in such schemes new members achieve a slightly weaker notion of traceability. The flexibility of our security model allows to capture such relaxation of traceability.
- 2 June 2020
- Published by Springer Nature in Journal of Cryptology
- Vol. 33 (4) , 1822-1870
Open AccessFoundations of Fully Dynamic Group Signatures
Group signatures allow members of a group to anonymously sign on behalf of the group. Membership is administered by a designated group manager. The group manager can also reveal the identity of a signer if and when needed to enforce accountability and deter abuse. For group signatures to be applicable in practice, they need to support fully dynamic groups, i.e., users may join and leave at any time. Existing security definitions for fully dynamic group signatures are informal, have shortcomings, and are mutually incompatible. We fill the gap by providing a formal rigorous security model for fully dynamic group signatures. Our model is general and is not tailored toward a specific design paradigm and can therefore, as we show, be used to argue about the security of different existing constructions following different design paradigms. Our definitions are stringent and when possible incorporate protection against maliciously chosen keys. We consider both the case where the group management and tracing signatures are administered by the same authority, i.e., a single group manager, and also the case where those roles are administered by two separate authorities, i.e., a group manager and an opening authority. We also show that a specialization of our model captures existing models for static and partially dynamic schemes. In the process, we identify a subtle gap in the security achieved by group signatures using revocation lists. We show that in such schemes new members achieve a slightly weaker notion of traceability. The flexibility of our security model allows to capture such relaxation of traceability.
- 27 October 2018
- Published by Springer Nature
- p. 595-626
Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
- 27 October 2018
- Published by Springer Nature
- p. 595-626
Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
- 8 August 2018
- Published by Springer Nature in Journal of Cryptology
- Vol. 32 (3) , 973-1025
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments
- 8 August 2018
- Published by Springer Nature in Journal of Cryptology
- Vol. 32 (3) , 973-1025
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments
- 24 July 2018
- Published by Springer Nature
- p. 669-699
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
- 24 July 2018
- Published by Springer Nature
- p. 669-699
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
- 24 July 2018
- Published by Springer Nature
- p. 698-728
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs
- 24 July 2018
- Published by Springer Nature
- p. 698-728
Updatable and Universal Common Reference Strings with Applications to zk-SNARKs
- 1 March 2018
- Published by Springer Nature
- p. 561-588
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
- 1 March 2018
- Published by Springer Nature
- p. 561-588
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials
- Open Access
- 18 November 2017
- Published by Springer Nature
- p. 66-96
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups
- 18 November 2017
- Published by Springer Nature
- p. 66-96
Open AccessTowards a Classification of Non-interactive Computational Assumptions in Cyclic Groups
- 17 November 2017
- Published by Springer Nature
- p. 336-365
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
- 17 November 2017
- Published by Springer Nature
- p. 336-365
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability