| One-way functions imply secure computation in a quantum world J Bartusek, A Coladangelo, D Khurana, F Ma Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 57 | 2021 |
| Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier A Chiesa, F Ma, N Spooner, M Zhandry arXiv preprint arXiv:2103.08140, 2021 | 53 | 2021 |
| Return of GGH15: Provable Security Against Zeroizing Attacks J Bartusek, J Guan, F Ma, M Zhandry IACR Cryptology ePrint Archive 2018, 2018 | 50* | 2018 |
| New techniques for obfuscating conjunctions J Bartusek, T Lepoint, F Ma, M Zhandry Annual International Conference on the Theory and Applications of …, 2019 | 41 | 2019 |
| Does Fiat-Shamir require a cryptographic hash function? Y Chen, A Lombardi, F Ma, W Quach Annual International Cryptology Conference, 334-363, 2021 | 36 | 2021 |
| The distinction between fixed and random generators in group-based assumptions J Bartusek, F Ma, M Zhandry Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 34 | 2019 |
| The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks F Ma, M Zhandry IACR Cryptology ePrint Archive 2017, 2017 | 33* | 2017 |
| Affine determinant programs: a framework for obfuscation and witness encryption J Bartusek, Y Ishai, A Jain, F Ma, A Sahai, M Zhandry 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020 | 31 | 2020 |
| Post-quantum zero knowledge, revisited or: How to do quantum rewinding undetectably A Lombardi, F Ma, N Spooner 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 29 | 2022 |
| On the round complexity of secure quantum computation J Bartusek, A Coladangelo, D Khurana, F Ma Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 29 | 2021 |
| On the (in) security of Kilian-based SNARGs J Bartusek, L Bronfman, J Holmgren, F Ma, RD Rothblum Theory of Cryptography Conference, 522-551, 2019 | 19 | 2019 |
| Commitments to quantum states S Gunn, N Ju, F Ma, M Zhandry Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1579-1588, 2023 | 18 | 2023 |
| The fewest clues problem ED Demaine, F Ma, A Schvartzman, E Waingarten, S Aaronson Theoretical Computer Science 748, 28-39, 2018 | 13 | 2018 |
| Succinct classical verification of quantum computation J Bartusek, YT Kalai, A Lombardi, F Ma, G Malavolta, V Vaikuntanathan, ... Annual International Cryptology Conference, 195-211, 2022 | 11 | 2022 |
| Public-key function-private hidden vector encryption (and more) J Bartusek, B Carmer, A Jain, Z Jin, T Lepoint, F Ma, T Malkin, ... International Conference on the Theory and Application of Cryptology and …, 2019 | 10 | 2019 |
| A one-query lower bound for unitary synthesis and breaking quantum cryptography A Lombardi, F Ma, J Wright Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 979-990, 2024 | 8 | 2024 |
| Encryptor Combiners: A Unified Approach to Multiparty NIKE,(H) IBE, and Broadcast Encryption. F Ma, M Zhandry IACR Cryptology ePrint Archive 2017, 2017 | 7 | 2017 |
| On the security of doubly efficient PIR E Boyle, J Holmgren, F Ma, M Weiss Cryptology ePrint Archive, 2021 | 6 | 2021 |
| Playing dominoes is hard, except by yourself ED Demaine, F Ma, E Waingarten Fun with Algorithms: 7th International Conference, FUN 2014, Lipari Island …, 2014 | 6 | 2014 |
| Leakage-resilient key exchange and two-seed extractors X Li, F Ma, W Quach, D Wichs Annual International Cryptology Conference, 401-429, 2020 | 5 | 2020 |
James BartusekUC Berkeley在 berkeley.edu 的电子邮件经过验证
