| Publication | Date of Publication | Type |
|---|
| Succinct garbled circuits with low-depth garbling algorithms | 2026-07-20 | Paper |
Attribute-based encryption for circuits of unbounded depth from lattices: garbled circuits of optimal size, laconic functional evaluation, and more
SIAM Journal on Computing | 2026-07-08 | Paper |
Indistinguishability obfuscation from well-founded assumptions
Journal of the ACM | 2026-04-09 | Paper |
| Lattice-based post-quantum iO from circular security with random opening assumption | 2026-02-06 | Paper |
| A unified framework for succinct garbling from homomorphic secret sharing | 2026-02-04 | Paper |
| TinyLabels: how to compress garbled circuit input labels, efficiently | 2025-12-02 | Paper |
| Attribute-based encryption for circuits of unbounded depth from lattices | 2025-08-15 | Paper |
| Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings | 2025-08-06 | Paper |
| Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles | 2025-08-06 | Paper |
| Constant-round concurrent zero knowledge from P-certificates | 2025-05-20 | Paper |
| From unprovability to environmentally friendly protocols | 2025-05-20 | Paper |
| Adaptive hardness and composable security in the plain model from standard assumptions | 2025-04-29 | Paper |
| A systematic study of sparse LWE | 2024-12-13 | Paper |
| A general framework for lattice-based ABE using evasive inner-product functional encryption | 2024-11-12 | Paper |
| LERNA: secure single-server aggregation via key-homomorphic masking | 2024-08-30 | Paper |
Indistinguishability obfuscation
International Congress of Mathematicians | 2024-03-20 | Paper |
The pseudorandom oracle model and ideal obfuscation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
| scientific article; zbMATH DE number 7799582 (Why is no real title available?) | 2024-02-05 | Paper |
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
New ways to garble arithmetic circuits
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Indistinguishability obfuscation from well-founded assumptions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
ABE for circuits with constant-size secret keys and adaptive security
Theory of Cryptography | 2023-08-14 | Paper |
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
| Succinct and adaptively secure ABE for ABP from \(k\)-Lin | 2023-03-29 | Paper |
| Non-malleable commitments against quantum attacks | 2022-08-30 | Paper |
| Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) | 2022-08-30 | Paper |
| Counterexamples to new circular security assumptions underlying iO | 2022-04-22 | Paper |
| Information-theoretic 2-round MPC without round collapsing: adaptive security, and more | 2022-03-23 | Paper |
| Mr NISC: multiparty reusable non-interactive secure computation | 2022-03-23 | Paper |
| Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification | 2021-12-08 | Paper |
Oblivious transfer is in MiniQCrypt
(available as arXiv preprint) | 2021-12-08 | Paper |
| Multiparty reusable non-interactive secure computation from LWE | 2021-12-08 | Paper |
| Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) | 2021-12-01 | Paper |
| Foundations of homomorphic secret sharing | 2021-06-15 | Paper |
Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
SIAM Journal on Computing | 2020-08-25 | Paper |
| Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification | 2020-03-09 | Paper |
| Non-malleable codes against bounded polynomial time tampering | 2020-02-04 | Paper |
| How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\) | 2020-02-04 | Paper |
| One-message zero knowledge and non-malleable commitments | 2018-12-11 | Paper |
| Two-round adaptively secure multiparty computation from standard assumptions | 2018-12-11 | Paper |
| \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits | 2018-07-09 | Paper |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
SIAM Journal on Computing | 2018-07-04 | Paper |
The hunting of the SNARK
Journal of Cryptology | 2018-02-15 | Paper |
| A unified approach to constructing black-box UC protocols in trusted setup models | 2018-01-19 | Paper |
| Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs | 2017-11-03 | Paper |
| Indistinguishability obfuscation from trilinear maps and block-wise local PRGs | 2017-11-03 | Paper |
On Removing Graded Encodings from Functional Encryption
Lecture Notes in Computer Science | 2017-06-13 | Paper |
The Computational Benefit of Correlated Instances
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | 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 |
Delegating RAM computations with adaptive soundness and privacy
Theory of Cryptography | 2016-12-22 | Paper |
Adaptive hardness and composable security in the plain model from standard assumptions
SIAM Journal on Computing | 2016-09-23 | Paper |
Indistinguishability obfuscation from constant-degree graded encoding schemes
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
Indistinguishability obfuscation with non-trivial efficiency
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Oblivious parallel RAM: improved efficiency and generic constructions
Theory of Cryptography | 2016-04-08 | Paper |
Output-compressing randomized encodings and applications
Theory of Cryptography | 2016-03-23 | Paper |
Constant-round concurrent zero-knowledge from indistinguishability obfuscation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Succinct randomized encodings and their applications
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Constant-Round Nonmalleable Commitments from Any One-Way Function
Journal of the ACM | 2015-08-14 | Paper |
Obfuscation of probabilistic circuits and applications
Theory of Cryptography | 2015-07-06 | Paper |
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Theory of Cryptography | 2015-07-06 | Paper |
Non-malleability amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A unified framework for concurrent security
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Leakage-tolerant computation with input-independent preprocessing
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Constant-round non-malleable commitments from any one-way function
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Amplification of Chosen-Ciphertext Security
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
A unified framework for UC from only OT
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
Theory of Cryptography | 2013-03-18 | Paper |
Black-box constructions of composable protocols without set-up
Lecture Notes in Computer Science | 2012-09-25 | Paper |
After-the-fact leakage in public-key encryption
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent non-malleable zero knowledge with adaptive inputs
Theory of Cryptography | 2011-05-19 | Paper |
Concurrent non-malleable zero knowledge proofs
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Concurrent Non-malleable Commitments from Any One-Way Function
Theory of Cryptography | 2008-03-05 | Paper |
