| Publication | Date of Publication | Type |
|---|
| Online mergers and applications to registration-based encryption and accumulators | 2024-11-22 | Paper |
| On the (im)possibility of time-lock puzzles in the quantum random oracle model | 2024-09-13 | Paper |
| Lower bounds on assumptions behind registration-based encryption | 2024-08-02 | Paper |
| Fine-grained non-interactive key-exchange: constructions and lower bounds | 2024-01-16 | Paper |
| Black-box separations for non-interactive classical commitments in a quantum world | 2024-01-16 | Paper |
| Lower bounds for the number of decryption updates in registration-based encryption | 2023-08-14 | Paper |
| On the impossibility of key agreements from quantum random oracles | 2023-06-28 | Paper |
| Polynomial-time targeted attacks on coin tossing for any number of corruptions | 2023-04-13 | Paper |
| Computational Concentration of Measure: Optimal Bounds, Reductions, and More | 2021-02-02 | Paper |
| Learning under \(p\)-tampering poisoning attacks | 2020-09-18 | Paper |
| Limits on the power of garbling techniques for public-key encryption | 2020-06-30 | Paper |
| On the round complexity of OT extension | 2020-06-30 | Paper |
| Registration-based encryption from standard assumptions | 2020-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617626 | 2019-02-06 | Paper |
| Registration-based encryption: removing private-key generator from IBE | 2018-12-11 | Paper |
| When does functional encryption imply obfuscation? | 2018-01-19 | Paper |
| Blockwise \(p\)-tampering attacks on cryptographic primitives, extractors, and learners | 2018-01-19 | Paper |
| On the impossibility of cryptography with tamperable randomness | 2018-01-05 | Paper |
| Lower bounds on obfuscation from all-or-nothing encryption primitives | 2017-11-03 | Paper |
| Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles | 2017-10-12 | Paper |
| Limits of random oracles in secure computation | 2017-05-19 | Paper |
| On the power of nonuniformity in proofs of security | 2017-05-16 | Paper |
| Publicly verifiable proofs of sequential work | 2017-05-16 | Paper |
| On the Power of Hierarchical Identity-Based Encryption | 2016-07-15 | Paper |
| On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models | 2016-03-23 | Paper |
| Lower Bounds on Assumptions Behind Indistinguishability Obfuscation | 2016-03-23 | Paper |
| On the Impossibility of Cryptography with Tamperable Randomness | 2014-08-07 | Paper |
| Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? | 2014-02-18 | Paper |
| On the Power of Public-Key Encryption in Secure Computation | 2014-02-18 | Paper |
| Languages with Efficient Zero-Knowledge PCPs are in SZK | 2013-03-18 | Paper |
| The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives | 2012-09-25 | Paper |
| On Efficient Zero-Knowledge PCPs | 2012-06-15 | Paper |
| On Black-Box Reductions between Predicate Encryption Schemes | 2012-06-15 | Paper |
| Time-Lock Puzzles in the Random Oracle Model | 2011-08-12 | Paper |
| On the Black-Box Complexity of Optimally-Fair Coin Tossing | 2011-05-19 | Paper |
| Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography | 2010-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294911 | 2007-07-26 | Paper |
