| Publication | Date of Publication | Type |
|---|
| Lossy cryptography from code-based assumptions | 2024-12-13 | Paper |
| A systematic study of sparse LWE | 2024-12-13 | Paper |
| Non-interactive zero-knowledge from LPN and MQ | 2024-12-13 | 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 |
Computational wiretap coding from indistinguishability obfuscation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | 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 |
Maliciously-secure MrNISC in the plain model
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 |
| Secure MPC: laziness leads to GOD | 2023-03-29 | Paper |
| scientific article; zbMATH DE number 7650430 (Why is no real title available?) | 2023-02-03 | Paper |
| Amplifying the security of functional encryption, unconditionally | 2022-11-09 | 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 |
| Multiparty reusable non-interactive secure computation from LWE | 2021-12-08 | Paper |
| Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification | 2021-12-08 | Paper |
| Combiners for functional encryption, unconditionally | 2021-12-01 | Paper |
| Statistical ZAP arguments | 2021-12-01 | Paper |
Performance analysis of non-banking finance companies using two-stage data envelopment analysis
Annals of Operations Research | 2021-01-07 | Paper |
| From FE combiners to secure MPC and back | 2020-04-30 | Paper |
| Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification | 2020-03-09 | Paper |
| Simultaneous amplification: the case of non-interactive zero-knowledge | 2020-03-09 | Paper |
| Sum-of-squares meets program obfuscation, revisited | 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 |
| Non-trivial witness encryption and null-iO from standard assumptions | 2018-10-17 | Paper |
| scientific article; zbMATH DE number 6866298 (Why is no real title available?) | 2018-05-03 | Paper |
Robust transforming combiners from indistinguishability obfuscation to functional encryption
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Verifiable functional encryption
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Multi-input functional encryption with unbounded-message security
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
