| Publication | Date of Publication | Type |
|---|
Polymath: Groth16 is not the limit
| 2025-01-10 | Paper |
Constant-size zk-SNARKs in ROM from falsifiable assumptions
| 2024-11-13 | Paper |
Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
| 2024-11-12 | Paper |
Set (non-)membership NIZKs from determinantal accumulators
| 2024-10-16 | Paper |
Algebraic group model with oblivious sampling
| 2024-08-15 | Paper |
On black-box knowledge-sound commit-and-prove SNARKs
| 2024-06-26 | Paper |
Counting vampires: from univariate sumcheck to updatable ZK-SNARK
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Lecture Notes in Computer Science | 2023-05-26 | Paper |
Smooth zero-knowledge hash functions
Lecture Notes in Computer Science | 2023-05-12 | Paper |
Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
Lecture Notes in Computer Science | 2023-05-12 | Paper |
Efficient NIZKs for algebraic sets
Lecture Notes in Computer Science | 2023-05-12 | Paper |
Succinct functional commitment for a large class of arithmetic circuits
| 2023-03-29 | Paper |
Key-and-argument-updatable QA-NIZKs
| 2022-12-16 | Paper |
On QA-NIZK in the BPK model
Lecture Notes in Computer Science | 2022-10-13 | Paper |
A unified framework for non-universal SNARKs
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
Somewhere statistically binding commitment schemes with applications
| 2022-06-17 | Paper |
More efficient shuffle argument from unique factorization
| 2021-12-20 | Paper |
On subversion-resistant SNARKs
Journal of Cryptology | 2021-07-02 | Paper |
Optimally sound sigma protocols under DCRA
Financial Cryptography and Data Security | 2021-03-17 | Paper |
A simpler rate-optimal CPIR protocol
Financial Cryptography and Data Security | 2021-03-17 | Paper |
UC-secure CRS generation for SNARKs
| 2020-05-06 | Paper |
DL-extractable UC-commitment schemes
| 2020-01-30 | Paper |
Prover-efficient commit-and-prove zero-knowledge snarks
International Journal of Applied Cryptography | 2018-11-26 | Paper |
On the security properties of e-voting bulletin boards
| 2018-10-17 | Paper |
An efficient pairing-based shuffle argument
| 2018-03-08 | Paper |
A subversion-resistant SNARK
| 2018-02-23 | Paper |
CCA-secure inner-product functional encryption from projective hash functions
Lecture Notes in Computer Science | 2017-06-13 | Paper |
A shuffle argument secure in the generic model
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Prover-efficient commit-and-prove zero-knowledge SNARKs
Progress in Cryptology – AFRICACRYPT 2016 | 2016-06-22 | Paper |
Efficient culpably sound NIZK shuffle argument without random oracles
Topics in Cryptology - CT-RSA 2016 | 2016-04-08 | Paper |
Communication optimal Tardos-based asymmetric fingerprinting
Lecture Notes in Computer Science | 2016-03-02 | Paper |
Linear batch codes
Coding Theory and Applications | 2016-01-07 | Paper |
Efficient NIZK arguments via parallel verification of Beneš networks
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Secure equality and greater-than tests with sublinear online complexity
Automata, Languages, and Programming | 2013-08-07 | Paper |
A more efficient computationally sound non-interactive zero-knowledge shuffle argument
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
Theory of Cryptography | 2012-06-15 | Paper |
On the CCA1-security of Elgamal and Damgård's Elgamal
Information Security and Cryptology | 2011-07-29 | Paper |
Secure Vickrey auctions without threshold trust
Financial Cryptography | 2011-04-20 | Paper |
Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication
Information Security and Cryptology | 2010-11-23 | Paper |
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
On the feasibility of consistent computations
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Verifiable homomorphic oblivious transfer and private equality test
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Advances in Cryptology - ASIACRYPT 2003
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Public Key Cryptography – PKC 2004
Lecture Notes in Computer Science | 2009-05-14 | Paper |
A New Protocol for Conditional Disclosure of Secrets and Its Applications
Applied Cryptography and Network Security | 2009-03-10 | Paper |
3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
Algorithms and Computation | 2009-01-29 | Paper |
Hybrid Damgård Is CCA1-Secure under the DDH Assumption
Cryptology and Network Security | 2009-01-09 | Paper |
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Succinct NP Proofs from an Extractability Assumption
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation
| 2008-05-27 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Information and Communications Security
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Information and Communications Security
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Information Security
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Fast Software Encryption
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Financial Cryptography and Data Security
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Financial Cryptography
Lecture Notes in Computer Science | 2005-06-13 | Paper |
scientific article; zbMATH DE number 2089318 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 1955781 (Why is no real title available?)
| 2003-07-29 | Paper |
scientific article; zbMATH DE number 1941229 (Why is no real title available?)
| 2003-06-29 | Paper |
scientific article; zbMATH DE number 1941252 (Why is no real title available?)
| 2003-06-29 | Paper |
Secure and efficient time-stamping systems
Dissertationes Mathematicae Universitatis Tartuensis | 2002-02-26 | Paper |
scientific article; zbMATH DE number 1440064 (Why is no real title available?)
| 2000-05-07 | Paper |
scientific article; zbMATH DE number 1304123 (Why is no real title available?)
| 1999-08-24 | Paper |
scientific article; zbMATH DE number 1302867 (Why is no real title available?)
| 1999-06-17 | Paper |
