| Publication | Date of Publication | Type |
|---|
Efficient maliciously secure oblivious exponentiations
IACR Communications in Cryptology | 2026-09-09 | Paper |
| Seedless condensers for efficiently samplable sources | 2026-04-24 | Paper |
| Black box crypto is useless for doubly efficient PIR | 2025-12-02 | Paper |
| Unique NIZKs and steganography detection | 2025-12-02 | Paper |
| Binary codes for error detection and correction in a computationally bounded world | 2025-11-20 | Paper |
| Laconic function evaluation and applications | 2025-08-12 | Paper |
| Obfuscating compute-and-compare programs under LWE | 2025-08-06 | Paper |
| Outsourcing private RAM computation | 2025-08-05 | Paper |
| Adaptively secure attribute-based encryption from witness encryption | 2025-07-25 | Paper |
| Interval key-encapsulation mechanism | 2025-07-03 | Paper |
| Cryptography against continuous memory attacks | 2025-04-29 | Paper |
| Laconic function evaluation and ABE for RAMs from (Ring-)LWE | 2024-12-13 | Paper |
| Doubly efficient cryptography: commitments, arguments and RAM MPC | 2024-12-13 | Paper |
| PIR with client-side preprocessing: information-theoretic constructions and lower bounds | 2024-12-13 | Paper |
| Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation | 2024-11-12 | Paper |
| Security with functional re-encryption from CPA | 2024-08-02 | Paper |
| Lower bounds on anonymous whistleblowing | 2024-08-02 | Paper |
| Multi-instance randomness extraction and security against bounded-storage mass surveillance | 2024-08-02 | Paper |
| Refuting the dream XOR lemma via ideal obfuscation and resettable MPC | 2024-06-25 | Paper |
| Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE | 2024-05-08 | Paper |
| Boosting batch arguments and RAM delegation | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829288 (Why is no real title available?) | 2024-04-09 | Paper |
The pseudorandom oracle model and ideal obfuscation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Universal amplification of KDM security: from 1-key circular to multi-key KDM
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Speak much, remember little: cryptography in the bounded storage model, revisited
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
A map of witness maps: new definitions and connections
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Witness encryption and null-iO from evasive LWE
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Post-quantum insecurity from LWE
Theory of Cryptography | 2023-08-14 | Paper |
Nearly optimal property preserving hashing
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
| Succinct LWE sampling, random polynomials, and obfuscation | 2023-04-13 | Paper |
| Updatable public key encryption in the standard model | 2023-04-13 | Paper |
Adaptively secure MPC with sublinear communication complexity
Journal of Cryptology | 2023-04-13 | Paper |
| Leakage-resilient key exchange and two-seed extractors | 2022-11-09 | Paper |
| Incompressible encodings | 2022-11-09 | Paper |
Witness maps and applications
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| Incompressible cryptography | 2022-08-30 | Paper |
| Authentication in the bounded storage model | 2022-08-30 | Paper |
| Targeted lossy functions and applications | 2022-05-18 | Paper |
| Limits on the adaptive security of Yao's garbling | 2022-04-22 | Paper |
| Two-round oblivious transfer from CDH or LPN | 2022-03-23 | Paper |
| Candidate obfuscation via oblivious LWE sampling | 2021-12-08 | Paper |
| Extracting randomness from extractor-dependent sources | 2021-12-01 | Paper |
| Statistical ZAPR arguments from bilinear maps | 2021-12-01 | Paper |
| Optimal broadcast encryption from LWE and pairings in the standard model | 2021-12-01 | Paper |
Is there an oblivious RAM lower bound for online reads?
Journal of Cryptology | 2021-07-02 | Paper |
| Non-malleable codes for decision trees | 2020-05-20 | Paper |
| On the plausibility of fully homomorphic encryption for RAMs | 2020-05-20 | Paper |
From cryptomania to obfustopia through secret-key functional encryption
Journal of Cryptology | 2020-04-28 | Paper |
| New constructions of reusable designated-verifier NIZKs | 2020-03-09 | Paper |
| Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions | 2020-03-09 | Paper |
Adaptively secure MPC with sublinear communication complexity
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
| Private anonymous data access | 2020-02-06 | Paper |
| Reusable designated-verifier NIZKs for all NP from CDH | 2020-02-06 | Paper |
| Worst-case hardness for LPN and cryptographic hashing via code smoothing | 2020-02-04 | Paper |
Fiat-Shamir: from practice to theory
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Succinct delegation for low-space non-deterministic computation
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Traitor-tracing from LWE made simple and attribute-based | 2018-12-06 | Paper |
| Watermarking PRFs under standard assumptions: public marking and security with extraction queries | 2018-12-06 | Paper |
Non-malleable codes
Journal of the ACM | 2018-12-06 | Paper |
Is there an oblivious RAM lower bound for online reads?
Theory of Cryptography | 2018-12-06 | Paper |
Watermarking cryptographic capabilities
SIAM Journal on Computing | 2018-12-05 | Paper |
| Non-trivial witness encryption and null-iO from standard assumptions | 2018-10-17 | Paper |
| Hardness of non-interactive differential privacy from one-way functions | 2018-09-12 | Paper |
| Multi-key searchable encryption, revisited | 2018-05-16 | Paper |
| The edited truth | 2018-01-19 | Paper |
| Adaptively indistinguishable garbled circuits | 2018-01-19 | Paper |
How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
Algorithmica | 2018-01-05 | Paper |
On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
Algorithmica | 2018-01-05 | Paper |
| Be adaptive, avoid overcommitting | 2017-11-03 | Paper |
Watermarking cryptographic capabilities
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
On the communication complexity of secure function evaluation with long output
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Barriers in cryptography with weak, correlated and leaky sources
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Dynamic proofs of retrievability via oblivious RAM
Journal of Cryptology | 2017-03-02 | Paper |
Standard security does not imply indistinguishability under selective opening
Theory of Cryptography | 2016-12-22 | Paper |
From cryptomania to obfustopia through secret-key functional encryption
Theory of Cryptography | 2016-12-22 | Paper |
Adaptive security of Yao's garbled circuits
Theory of Cryptography | 2016-12-21 | Paper |
Spooky Encryption and Its Applications
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Adaptively secure garbled circuits from one-way functions
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
A counterexample to the chain rule for conditional HILL entropy
Computational Complexity | 2016-10-28 | Paper |
Leakage-resilient cryptography from minimal assumptions
Journal of Cryptology | 2016-09-21 | Paper |
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
Anonymous traitor tracing: how to embed arbitrary information in a key
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Two round multiparty computation via multi-key FHE
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
New realizations of somewhere statistically binding hashing and positional accumulators
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Obfuscating conjunctions under entropic ring LWE
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Onion ORAM: a constant bandwidth blowup oblivious RAM
Theory of Cryptography | 2016-04-08 | Paper |
Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
Theory of Cryptography | 2016-03-23 | Paper |
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Leveled fully homomorphic signatures from standard lattices
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Tamper detection and continuous non-malleable codes
Theory of Cryptography | 2015-07-06 | Paper |
Non-malleable extractors and symmetric key cryptography from weak secrets
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Optimizing ORAM and Using It Efficiently for Secure Computation
Privacy Enhancing Technologies | 2014-08-19 | Paper |
On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
How to eat your entropy and have it too -- optimal recovery strategies for compromised RNGs
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Separating succinct non-interactive arguments from all falsifiable assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Key derivation without entropy waste
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Efficient non-malleable codes and key-derivation for poly-size tampering circuits
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Garbled RAM revisited
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Fully homomorphic message authenticators
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
