ติดตาม
Fermi Ma
Fermi Ma
UC Berkeley & Simons Institute
ยืนยันอีเมลแล้วที่ berkeley.edu - หน้าแรก
ชื่อ
อ้างโดย
อ้างโดย
ปี
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
762021
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
A Chiesa, F Ma, N Spooner, M Zhandry
arXiv preprint arXiv:2103.08140, 2021
642021
Return of GGH15: Provable Security Against Zeroizing Attacks
J Bartusek, J Guan, F Ma, M Zhandry
IACR Cryptology ePrint Archive 2018, 2018
59*2018
New techniques for obfuscating conjunctions
J Bartusek, T Lepoint, F Ma, M Zhandry
Annual International Conference on the Theory and Applications of …, 2019
432019
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
402022
Does Fiat-Shamir require a cryptographic hash function?
Y Chen, A Lombardi, F Ma, W Quach
Annual International Cryptology Conference, 334-363, 2021
402021
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
382019
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
362021
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), 82 …, 2020
352020
The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks
F Ma, M Zhandry
IACR Cryptology ePrint Archive 2017, 2017
34*2017
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
282024
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
242023
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
222019
How to construct random unitaries
F Ma, HY Huang
arXiv preprint arXiv:2410.10116, 2024
172024
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
152022
The fewest clues problem
ED Demaine, F Ma, A Schvartzman, E Waingarten, S Aaronson
Theoretical Computer Science 748, 28-39, 2018
152018
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
122019
On the security of doubly efficient PIR
E Boyle, J Holmgren, F Ma, M Weiss
Cryptology ePrint Archive, 2021
72021
Encryptor Combiners: A Unified Approach to Multiparty NIKE,(H) IBE, and Broadcast Encryption.
F Ma, M Zhandry
IACR Cryptology ePrint Archive 2017, 2017
72017
Leakage-resilient key exchange and two-seed extractors
X Li, F Ma, W Quach, D Wichs
Annual International Cryptology Conference, 401-429, 2020
62020
ระบบไม่สามารถดำเนินการได้ในขณะนี้ โปรดลองใหม่อีกครั้งในภายหลัง
บทความ 1–20