Jens Groth

MaRDI QIDQ290389zbMATH OpenDBLPORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Constraint-friendly map-to-elliptic-curve-group relations and their applications	2026-03-31	Paper
Fast batched asynchronous distributed key generation	2024-11-13	Paper
On the security of ECDSA with additive key derivation and presignatures	2022-08-30	Paper
Short accountable ring signatures based on DDH Computer Security -- ESORICS 2015	2022-08-19	Paper
Linear-time arguments with sublinear verification from tensor codes	2022-03-23	Paper
Foundations of fully dynamic group signatures Journal of Cryptology	2020-11-06	Paper
Updatable and universal common reference strings with applications to zk-SNARKs	2020-06-30	Paper
Efficient fully structure-preserving signatures and shrinking commitments Journal of Cryptology	2019-08-13	Paper
Arya: nearly linear-time zero-knowledge proofs for correct program execution	2018-12-20	Paper
Efficient zero-knowledge proof systems	2018-10-17	Paper
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits	2018-09-26	Paper
Efficient batch zero-knowledge arguments for low degree polynomials	2018-05-29	Paper
Towards a classification of non-interactive computational assumptions in cyclic groups	2018-03-08	Paper
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability	2018-02-23	Paper
Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks	2017-11-15	Paper
Foundations of fully dynamic group signatures Applied Cryptography and Network Security	2016-10-04	Paper
Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting Advances in Cryptology – EUROCRYPT 2016	2016-07-15	Paper
On the size of pairing-based non-interactive arguments Advances in Cryptology – EUROCRYPT 2016	2016-07-15	Paper
Efficient fully structure-preserving signatures for large messages Advances in Cryptology -- ASIACRYPT 2015	2016-06-10	Paper
Structure-preserving signatures and commitments to group elements Journal of Cryptology	2016-06-01	Paper
One-out-of-many proofs: or how to leak a secret and spend a coin Advances in Cryptology - EUROCRYPT 2015	2015-09-30	Paper
Making Sigma-protocols non-interactive without random oracles Lecture Notes in Computer Science	2015-08-27	Paper
Square span programs with applications to succinct NIZK arguments Lecture Notes in Computer Science	2015-01-16	Paper
Cryptography in the multi-string model Journal of Cryptology	2014-09-25	Paper
Structure-preserving signatures from type II pairings Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
Converting cryptographic schemes from symmetric to asymmetric bilinear groups Advances in Cryptology – CRYPTO 2014	2014-08-07	Paper
Fine-Tuning Groth-Sahai Proofs Public-Key Cryptography – PKC 2014	2014-03-25	Paper
Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures Theory of Cryptography	2014-02-18	Paper
New techniques for noninteractive zero-knowledge Journal of the ACM	2014-02-17	Paper
Zero-knowledge argument for polynomial evaluation with application to blacklists Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings	2013-05-31	Paper
Efficient noninteractive proof systems for bilinear groups SIAM Journal on Computing	2013-02-04	Paper
Efficient Zero-Knowledge Argument for Correctness of a Shuffle Advances in Cryptology – EUROCRYPT 2012	2012-06-29	Paper
Efficient zero-knowledge arguments from two-tiered homomorphic commitments Lecture Notes in Computer Science	2011-12-02	Paper
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions Lecture Notes in Computer Science	2011-12-02	Paper
Optimal structure-preserving signatures. (Abstract) Provable Security	2011-09-16	Paper
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups Advances in Cryptology – CRYPTO 2011	2011-08-12	Paper
Efficient zero-knowledge proofs. (Abstract) Lecture Notes in Computer Science	2011-06-29	Paper
Short pairing-based non-interactive zero-knowledge arguments Advances in Cryptology - ASIACRYPT 2010	2010-12-07	Paper
Short non-interactive zero-knowledge proofs Advances in Cryptology - ASIACRYPT 2010	2010-12-07	Paper
Pairing-based non-interactive zero-knowledge proofs Lecture Notes in Computer Science	2010-11-26	Paper
A verifiable secret shuffle of homomorphic encryptions Journal of Cryptology	2010-11-12	Paper
Structure-preserving signatures and commitments to group elements Advances in Cryptology – CRYPTO 2010	2010-08-24	Paper
Non-interactive and reusable non-malleable commitment schemes Proceedings of the thirty-fifth annual ACM symposium on Theory of computing	2010-08-16	Paper
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate Public Key Cryptography – PKC 2010	2010-05-28	Paper
Linear Algebra with Sub-linear Zero-Knowledge Arguments Advances in Cryptology - CRYPTO 2009	2009-10-20	Paper
Theory of Cryptography Lecture Notes in Computer Science	2009-05-14	Paper
Cryptography in the Multi-string Model Advances in Cryptology - CRYPTO 2007	2009-03-10	Paper
Fully Anonymous Group Signatures Without Random Oracles Advances in Cryptology – ASIACRYPT 2007	2008-05-15	Paper
A Non-interactive Shuffle with Pairing Based Verifiability Advances in Cryptology – ASIACRYPT 2007	2008-05-15	Paper
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures Advances in Cryptology – ASIACRYPT 2006	2008-04-24	Paper
Efficient Non-interactive Proof Systems for Bilinear Groups Advances in Cryptology – EUROCRYPT 2008	2008-04-15	Paper
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle Advances in Cryptology – EUROCRYPT 2008	2008-04-15	Paper
Ring Signatures of Sub-linear Size Without Random Oracles Automata, Languages and Programming	2007-11-28	Paper
Perfect Non-interactive Zero Knowledge for NP Advances in Cryptology - EUROCRYPT 2006	2007-09-24	Paper
Non-interactive Zero-Knowledge Arguments for Voting Applied Cryptography and Network Security	2007-09-24	Paper
An Adaptively Secure Mix-Net Without Erasures Automata, Languages and Programming	2007-09-11	Paper
Verifiable Shuffle of Large Size Ciphertexts Public Key Cryptography – PKC 2007	2007-09-04	Paper
Non-interactive Zaps and New Techniques for NIZK Lecture Notes in Computer Science	2007-09-04	Paper
Group Signatures: Better Efficiency and New Theoretical Aspects Security in Communication Networks	2006-10-10	Paper
Theory of Cryptography Lecture Notes in Computer Science	2005-12-07	Paper
Applied Cryptography and Network Security Lecture Notes in Computer Science	2005-06-13	Paper
Financial Cryptography Lecture Notes in Computer Science	2005-06-13	Paper
A Verifiable Secret Shuffe of Homomorphic Encryptions Public Key Cryptography — PKC 2003	2003-07-27	Paper

Research outcomes over time

This page was built for person: Jens Groth