| Publication | Date of Publication | Type |
|---|
| Scalable agreement protocols with optimal optimistic efficiency | 2025-01-10 | Paper |
| The cost of statistical security in proofs for repeated squaring | 2024-11-22 | Paper |
| Distributed-prover interactive proofs | 2024-08-01 | Paper |
| 3-party secure computation for RAMs: optimal and concretely efficient | 2024-08-01 | Paper |
| Optimal oblivious parallel RAM | 2024-07-19 | Paper |
| OptORAMa: Optimal oblivious RAM | 2024-07-04 | Paper |
| New bounds on the local leakage resilience of Shamir's secret sharing scheme | 2024-02-02 | Paper |
| Fully adaptive decentralized multi-authority \textsf{ABE} | 2023-12-12 | Paper |
| Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions | 2023-12-08 | Paper |
| Maliciously-secure MrNISC in the plain model | 2023-12-08 | Paper |
| Oblivious parallel tight compaction | 2023-11-02 | Paper |
| On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing | 2023-10-31 | Paper |
| On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing | 2023-06-30 | Paper |
| Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions | 2023-06-30 | Paper |
| \(\log^\ast\)-round game-theoretically-fair leader election | 2023-06-30 | Paper |
| Maliciously secure massively parallel computation for all-but-one corruptions | 2023-06-12 | Paper |
| SPARKs: Succinct Parallelizable Arguments of Knowledge | 2023-04-27 | Paper |
| Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH | 2023-04-13 | Paper |
| Oblivious RAM with worst-case logarithmic overhead | 2023-04-13 | Paper |
| Non-malleable time-lock puzzles and applications | 2023-04-13 | Paper |
| One-Way Functions and (Im)perfect Obfuscation | 2023-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875759 | 2023-02-03 | Paper |
| Impossibility of strong KDM security with auxiliary input | 2022-12-16 | Paper |
| A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols | 2022-07-21 | Paper |
| On the complexity of compressing obfuscation | 2022-07-18 | Paper |
| A logarithmic lower bound for oblivious RAM (for all Parameters) | 2022-05-18 | Paper |
| Oblivious RAM with \textit{worst-case} logarithmic overhead | 2022-05-18 | Paper |
| Non-malleable codes for bounded parallel-time tampering | 2022-04-22 | Paper |
| Secure massively parallel computation for dishonest majority | 2022-03-23 | Paper |
| OptORAMa: optimal oblivious RAM | 2022-03-23 | Paper |
| Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} | 2021-12-08 | Paper |
| Multiparty reusable non-interactive secure computation from LWE | 2021-12-08 | Paper |
| Continuous verifiable delay functions | 2021-12-01 | Paper |
| SPARKs: succinct parallelizable arguments of knowledge | 2021-12-01 | Paper |
| A lower bound for adaptively-secure collective coin flipping protocols | 2021-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140836 | 2020-12-17 | Paper |
| On the complexity of compressing obfuscation | 2020-06-30 | Paper |
| From minicrypt to obfustopia via private-key functional encryption | 2020-04-28 | Paper |
| Non-uniformly sound certificates with applications to concurrent zero-knowledge | 2020-03-09 | Paper |
| White-Box vs. Black-Box Complexity of Search Problems | 2020-02-11 | Paper |
| Distributional collision resistance beyond one-way functions | 2020-02-04 | Paper |
| Strong Locally Testable Codes with Relaxed Local Decoders | 2019-12-16 | Paper |
| Hardness-preserving reductions via cuckoo hashing | 2019-06-20 | Paper |
| Cutting-edge cryptography through the lens of secret sharing | 2018-12-03 | Paper |
| Communication with contextual uncertainty | 2018-11-07 | Paper |
| Non-trivial witness encryption and null-iO from standard assumptions | 2018-10-17 | Paper |
| Leakage resilient one-way functions: the auxiliary-input setting | 2018-09-27 | Paper |
| On distributional collision resistant hashing | 2018-09-26 | Paper |
| How to Share a Secret, Infinitely | 2018-09-14 | Paper |
| Compressing communication in distributed protocols | 2018-08-24 | Paper |
| Communication with contextual uncertainty | 2018-07-16 | Paper |
| Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation) | 2018-07-09 | Paper |
| Another step towards realizing random oracles: non-malleable point obfuscation | 2018-07-09 | Paper |
| Collision resistant hashing for paranoids: dealing with multiple collisions | 2018-07-09 | Paper |
| Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions | 2018-05-28 | Paper |
| Functional encryption for randomized functionalities in the private-key setting from minimal assumptions | 2018-04-26 | Paper |
| Non-interactive multiparty computation without correlated randomness | 2018-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601820 | 2018-01-24 | Paper |
| Evolving secret sharing: dynamic thresholds and robustness | 2018-01-19 | Paper |
| Be adaptive, avoid overcommitting | 2017-11-03 | Paper |
| Negation-Limited Formulas. | 2017-08-31 | Paper |
| From Minicrypt to Obfustopia via Private-Key Functional Encryption | 2017-06-13 | Paper |
| Secret-sharing for NP | 2017-05-22 | Paper |
| Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound | 2017-02-15 | Paper |
| Negation-limited formulas | 2016-12-22 | Paper |
| How to Share a Secret, Infinitely | 2016-12-22 | Paper |
| Threshold Secret Sharing Requires a Linear Size Alphabet | 2016-12-22 | Paper |
| Leakage Resilient One-Way Functions: The Auxiliary-Input Setting | 2016-12-21 | Paper |
| Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions | 2016-07-15 | Paper |
| Cutting-Edge Cryptography Through the Lens of Secret Sharing | 2016-04-08 | Paper |
| Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions | 2015-07-06 | Paper |
| Secret-Sharing for NP | 2015-01-06 | Paper |
| Average-case lower bounds for formula size | 2014-08-07 | Paper |
| Hardness Preserving Reductions via Cuckoo Hashing | 2013-03-18 | Paper |
