| Publication | Date of Publication | Type |
|---|
| 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 | 2022-08-19 | Paper |
| Linear-time arguments with sublinear verification from tensor codes | 2022-03-23 | Paper |
| Foundations of fully dynamic group signatures | 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 | 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 | 2016-10-04 | Paper |
| Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting | 2016-07-15 | Paper |
| On the Size of Pairing-Based Non-interactive Arguments | 2016-07-15 | Paper |
| Efficient Fully Structure-Preserving Signatures for Large Messages | 2016-06-10 | Paper |
| Structure-preserving signatures and commitments to group elements | 2016-06-01 | Paper |
| One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin | 2015-09-30 | Paper |
| Making Sigma-Protocols Non-interactive Without Random Oracles | 2015-08-27 | Paper |
| Square Span Programs with Applications to Succinct NIZK Arguments | 2015-01-16 | Paper |
| Cryptography in the multi-string model | 2014-09-25 | Paper |
| Structure-Preserving Signatures from Type II Pairings | 2014-08-07 | Paper |
| Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups | 2014-08-07 | Paper |
| Fine-Tuning Groth-Sahai Proofs | 2014-03-25 | Paper |
| Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures | 2014-02-18 | Paper |
| New Techniques for Noninteractive Zero-Knowledge | 2014-02-17 | Paper |
| Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists | 2013-05-31 | Paper |
| Efficient Noninteractive Proof Systems for Bilinear Groups | 2013-02-04 | Paper |
| Efficient Zero-Knowledge Argument for Correctness of a Shuffle | 2012-06-29 | Paper |
| Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments | 2011-12-02 | Paper |
| Separating Short Structure-Preserving Signatures from Non-interactive Assumptions | 2011-12-02 | Paper |
| Optimal Structure-Preserving Signatures | 2011-09-16 | Paper |
| Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups | 2011-08-12 | Paper |
| Efficient Zero-Knowledge Proofs | 2011-06-29 | Paper |
| Short Pairing-Based Non-interactive Zero-Knowledge Arguments | 2010-12-07 | Paper |
| Short Non-interactive Zero-Knowledge Proofs | 2010-12-07 | Paper |
| Pairing-Based Non-interactive Zero-Knowledge Proofs | 2010-11-26 | Paper |
| A verifiable secret shuffle of homomorphic encryptions | 2010-11-12 | Paper |
| Structure-Preserving Signatures and Commitments to Group Elements | 2010-08-24 | Paper |
| Non-interactive and reusable non-malleable commitment schemes | 2010-08-16 | Paper |
| Multi-query Computationally-Private Information Retrieval with Constant Communication Rate | 2010-05-28 | Paper |
| Linear Algebra with Sub-linear Zero-Knowledge Arguments | 2009-10-20 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Cryptography in the Multi-string Model | 2009-03-10 | Paper |
| Fully Anonymous Group Signatures Without Random Oracles | 2008-05-15 | Paper |
| A Non-interactive Shuffle with Pairing Based Verifiability | 2008-05-15 | Paper |
| Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures | 2008-04-24 | Paper |
| Efficient Non-interactive Proof Systems for Bilinear Groups | 2008-04-15 | Paper |
| Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle | 2008-04-15 | Paper |
| Ring Signatures of Sub-linear Size Without Random Oracles | 2007-11-28 | Paper |
| Perfect Non-interactive Zero Knowledge for NP | 2007-09-24 | Paper |
| Non-interactive Zero-Knowledge Arguments for Voting | 2007-09-24 | Paper |
| An Adaptively Secure Mix-Net Without Erasures | 2007-09-11 | Paper |
| Verifiable Shuffle of Large Size Ciphertexts | 2007-09-04 | Paper |
| Non-interactive Zaps and New Techniques for NIZK | 2007-09-04 | Paper |
| Group Signatures: Better Efficiency and New Theoretical Aspects | 2006-10-10 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Applied Cryptography and Network Security | 2005-06-13 | Paper |
| Financial Cryptography | 2005-06-13 | Paper |
| A Verifiable Secret Shuffe of Homomorphic Encryptions | 2003-07-27 | Paper |
