Jens Groth

From MaRDI portal
Person:290389

Available identifiers

zbMath Open groth.jensWikidataQ62058038 ScholiaQ62058038MaRDI QIDQ290389

List of research outcomes

PublicationDate of PublicationType
On the security of ECDSA with additive key derivation and presignatures2022-08-30Paper
Short Accountable Ring Signatures Based on DDH2022-08-19Paper
Linear-time arguments with sublinear verification from tensor codes2022-03-23Paper
Foundations of fully dynamic group signatures2020-11-06Paper
Updatable and universal common reference strings with applications to zk-SNARKs2020-06-30Paper
Efficient fully structure-preserving signatures and shrinking commitments2019-08-13Paper
Arya: nearly linear-time zero-knowledge proofs for correct program execution2018-12-20Paper
Efficient zero-knowledge proof systems2018-10-17Paper
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits2018-09-26Paper
Efficient batch zero-knowledge arguments for low degree polynomials2018-05-29Paper
Towards a classification of non-interactive computational assumptions in cyclic groups2018-03-08Paper
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability2018-02-23Paper
Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks2017-11-15Paper
Foundations of Fully Dynamic Group Signatures2016-10-04Paper
On the Size of Pairing-Based Non-interactive Arguments2016-07-15Paper
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting2016-07-15Paper
Efficient Fully Structure-Preserving Signatures for Large Messages2016-06-10Paper
Structure-preserving signatures and commitments to group elements2016-06-01Paper
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin2015-09-30Paper
Making Sigma-Protocols Non-interactive Without Random Oracles2015-08-27Paper
Square Span Programs with Applications to Succinct NIZK Arguments2015-01-16Paper
Cryptography in the multi-string model2014-09-25Paper
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups2014-08-07Paper
Structure-Preserving Signatures from Type II Pairings2014-08-07Paper
Fine-Tuning Groth-Sahai Proofs2014-03-25Paper
Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures2014-02-18Paper
New Techniques for Noninteractive Zero-Knowledge2014-02-17Paper
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists2013-05-31Paper
Efficient Noninteractive Proof Systems for Bilinear Groups2013-02-04Paper
Efficient Zero-Knowledge Argument for Correctness of a Shuffle2012-06-29Paper
Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments2011-12-02Paper
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions2011-12-02Paper
Optimal Structure-Preserving Signatures2011-09-16Paper
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups2011-08-12Paper
Efficient Zero-Knowledge Proofs2011-06-29Paper
Short Pairing-Based Non-interactive Zero-Knowledge Arguments2010-12-07Paper
Short Non-interactive Zero-Knowledge Proofs2010-12-07Paper
Pairing-Based Non-interactive Zero-Knowledge Proofs2010-11-26Paper
A verifiable secret shuffle of homomorphic encryptions2010-11-12Paper
Structure-Preserving Signatures and Commitments to Group Elements2010-08-24Paper
Non-interactive and reusable non-malleable commitment schemes2010-08-16Paper
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate2010-05-28Paper
Linear Algebra with Sub-linear Zero-Knowledge Arguments2009-10-20Paper
Theory of Cryptography2009-05-14Paper
Cryptography in the Multi-string Model2009-03-10Paper
A Non-interactive Shuffle with Pairing Based Verifiability2008-05-15Paper
Fully Anonymous Group Signatures Without Random Oracles2008-05-15Paper
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures2008-04-24Paper
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle2008-04-15Paper
Efficient Non-interactive Proof Systems for Bilinear Groups2008-04-15Paper
Ring Signatures of Sub-linear Size Without Random Oracles2007-11-28Paper
Perfect Non-interactive Zero Knowledge for NP2007-09-24Paper
Non-interactive Zero-Knowledge Arguments for Voting2007-09-24Paper
An Adaptively Secure Mix-Net Without Erasures2007-09-11Paper
Verifiable Shuffle of Large Size Ciphertexts2007-09-04Paper
Non-interactive Zaps and New Techniques for NIZK2007-09-04Paper
Group Signatures: Better Efficiency and New Theoretical Aspects2006-10-10Paper
Theory of Cryptography2005-12-07Paper
Financial Cryptography2005-06-13Paper
Applied Cryptography and Network Security2005-06-13Paper
A Verifiable Secret Shuffe of Homomorphic Encryptions2003-07-27Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jens Groth