| Publication | Date of Publication | Type |
|---|
Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
Journal of Cryptology | 2024-12-27 | Paper |
| Succinct verification of compressed sigma protocols in the updatable SRS setting | 2024-11-12 | Paper |
Impossibilities in succinct arguments: black-box extraction and more
Progress in Cryptology - AFRICACRYPT 2023 | 2024-02-02 | Paper |
Reverse firewalls for oblivious transfer extension and applications to zero-knowledge
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Witness-succinct universally-composable SNARKs
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Rinocchio: SNARKs for ring arithmetic
Journal of Cryptology | 2023-11-21 | Paper |
\textsf{Dew}: a transparent constant-sized polynomial commitment scheme
Lecture Notes in Computer Science | 2023-11-16 | Paper |
What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Lecture Notes in Computer Science | 2023-07-25 | Paper |
NIWI and new notions of extraction for algebraic languages
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Achieving almost all blockchain functionalities with polylogarithmic storage
Financial Cryptography and Data Security | 2023-05-26 | Paper |
Reverse firewalls for adaptively secure MPC without setup
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) | 2022-08-30 | Paper |
\textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
Public-Key Cryptography – PKC 2022 | 2022-07-08 | Paper |
| Balancing privacy and accountability in blockchain identity management | 2021-12-20 | Paper |
Optimal extension protocols for Byzantine broadcast and agreement
Distributed Computing | 2021-03-12 | Paper |
Cryptographic reverse firewalls for interactive proof systems
Theoretical Computer Science | 2021-01-25 | Paper |
| Non-interactive zero-knowledge proofs for composite statements | 2020-06-30 | Paper |
| Proofs of replicated storage without timing assumptions | 2020-05-20 | Paper |
| Efficient adaptively secure zero-knowledge from garbled circuits | 2018-05-29 | Paper |
Broadcast Extensions with Optimal Communication and Round Complexity
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Hashing garbled circuits for free
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
A formal treatment of backdoored pseudorandom generators
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
On-line/off-line leakage resilient secure computation protocols
Lecture Notes in Computer Science | 2014-08-20 | Paper |
| scientific article; zbMATH DE number 4093276 (Why is no real title available?) | 1988-01-01 | Paper |
