| Publication | Date of Publication | Type |
|---|
| New algorithmic directions in optimal transport and applications for product spaces | 2026-10-01 | Paper |
A note on the minimality of one-way functions in post-quantum cryptography
IACR Communications in Cryptology | 2026-09-09 | Paper |
Publicly-detectable watermarking for language models
IACR Communications in Cryptology | 2026-09-09 | Paper |
| Black-box uselessness: composing separations in cryptography | 2026-04-15 | Paper |
| Can verifiable delay functions be based on random oracles? | 2026-03-18 | Paper |
| Can adversarially robust learning leverage computational hardness? | 2025-01-31 | Paper |
| 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
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Black-box separations for non-interactive classical commitments in a quantum world
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Lower bounds for the number of decryption updates in registration-based encryption
Theory of Cryptography | 2023-08-14 | Paper |
On the impossibility of key agreements from quantum random oracles
Advances in Cryptology – CRYPTO 2022 | 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
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Learning under \(p\)-tampering poisoning attacks
Annals of Mathematics and Artificial Intelligence | 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 |
Learning under p-tampering attacks
(available as arXiv preprint) | 2019-02-06 | Paper |
| Learning under p-tampering attacks | 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
Algorithmica | 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
Journal of Cryptology | 2017-10-12 | Paper |
Limits of random oracles in secure computation (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
On the power of nonuniformity in proofs of security
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
On the power of hierarchical identity-based encryption
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
Theory of Cryptography | 2016-03-23 | Paper |
Lower bounds on assumptions behind indistinguishability obfuscation
Theory of Cryptography | 2016-03-23 | Paper |
On the impossibility of cryptography with tamperable randomness
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Can optimally-fair coin tossing be based on one-way functions?
Theory of Cryptography | 2014-02-18 | Paper |
On the power of public-key encryption in secure computation
Theory of Cryptography | 2014-02-18 | Paper |
Languages with efficient zero-knowledge PCPs are in SZK
Theory of Cryptography | 2013-03-18 | Paper |
The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On Efficient Zero-Knowledge PCPs
Theory of Cryptography | 2012-06-15 | Paper |
On black-box reductions between predicate encryption schemes
Theory of Cryptography | 2012-06-15 | Paper |
Time-lock puzzles in the random oracle model
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
On the Black-Box Complexity of Optimally-Fair Coin Tossing
Theory of Cryptography | 2011-05-19 | Paper |
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
| On rainbow cycles in edge colored complete graphs | 2007-07-26 | Paper |
