Fermi Ma

According to our database, Fermi Ma authored at least 29 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Strong random unitaries and fast scrambling.

Thomas Schuster, Fermi Ma, Alex Lombardi, Fernando Brandao, Hsin-Yuan Huang

CoRR, September, 2025

How to Construct Random Unitaries.

Fermi Ma, Hsin-Yuan Huang

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography.

Alex Lombardi, Fermi Ma, John Wright

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Commitments to Quantum States.

Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably.

Alex Lombardi, Fermi Ma, Nicholas Spooner

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Succinct Classical Verification of Quantum Computation.

James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Quantum Security and Fiat-Shamir for Cryptographic Protocols

Fermi Ma

PhD thesis, 2021

On the Security of Doubly Efficient PIR.

Elette Boyle, Justin Holmgren, Fermi Ma, Mor Weiss

IACR Cryptol. ePrint Arch., 2021

Post-Quantum Succinct Arguments.

Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

Electron. Colloquium Comput. Complex., 2021

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier.

Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Does Fiat-Shamir Require a Cryptographic Hash Function?

Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

One-Way Functions Imply Secure Computation in a Quantum World.

James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

On the Round Complexity of Secure Quantum Computation.

James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

On The Round Complexity of Two-Party Quantum Computation.

James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma

IACR Cryptol. ePrint Arch., 2020

Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.

James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Leakage-Resilient Key Exchange and Two-Seed Extractors.

Xin Li, Fermi Ma, Willy Quach, Daniel Wichs

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

On the (In)security of Kilian-Based SNARGs.

James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

New Techniques for Obfuscating Conjunctions.

James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

The Distinction Between Fixed and Random Generators in Group-Based Assumptions.

James Bartusek, Fermi Ma, Mark Zhandry

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Public-Key Function-Private Hidden Vector Encryption (and More).

James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018

Preventing Zeroizing Attacks on GGH15.

James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry

IACR Cryptol. ePrint Arch., 2018

The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks.

Fermi Ma, Mark Zhandry

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Return of GGH15: Provable Security Against Zeroizing Attacks.

James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

2017

Arboral satisfaction: Recognition and LP approximation.

Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler

Inf. Process. Lett., 2017

New Multilinear Maps from CLT13 with Provable Security Against Zeroizing Attacks.

Fermi Ma, Mark Zhandry

IACR Cryptol. ePrint Arch., 2017

Encryptor Combiners: A Unified Approach to Multiparty NIKE, (H)IBE, and Broadcast Encryption.

Fermi Ma, Mark Zhandry

IACR Cryptol. ePrint Arch., 2017

2016

The Fewest Clues Problem.

Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

You Should Be Scared of German Ghost.

Erik D. Demaine, Fermi Ma, Matthew Susskind, Erik Waingarten

J. Inf. Process., 2015

2014

Playing Dominoes Is Hard, Except by Yourself.

Erik D. Demaine, Fermi Ma, Erik Waingarten

Proceedings of the Fun with Algorithms - 7th International Conference, 2014