default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFermi Ma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Alex Lombardi
, Fermi Ma, John Wright:
A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography. STOC 2024: 979-990- [i30]Fermi Ma, Hsin-Yuan Huang:
How to Construct Random Unitaries. CoRR abs/2410.10116 (2024) - [i29]Fermi Ma, Hsin-Yuan Huang:
How to Construct Random Unitaries. IACR Cryptol. ePrint Arch. 2024: 1652 (2024) - 2023
- [c17]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. STOC 2023: 1579-1588 - [i28]Alex Lombardi, Fermi Ma, John Wright:
A one-query lower bound for unitary synthesis and breaking quantum cryptography. CoRR abs/2310.08870 (2023) - [i27]Alex Lombardi, Fermi Ma, John Wright:
A one-query lower bound for unitary synthesis and breaking quantum cryptography. IACR Cryptol. ePrint Arch. 2023: 1602 (2023) - 2022
- [c16]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. CRYPTO (2) 2022: 195-211 - [c15]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably. FOCS 2022: 851-859 - [i26]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. CoRR abs/2206.14929 (2022) - [i25]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. CoRR abs/2210.05138 (2022) - [i24]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. Electron. Colloquium Comput. Complex. TR22 (2022) - [i23]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. IACR Cryptol. ePrint Arch. 2022: 857 (2022) - [i22]Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry:
Commitments to Quantum States. IACR Cryptol. ePrint Arch. 2022: 1358 (2022) - 2021
- [b1]Fermi Ma:
Quantum Security and Fiat-Shamir for Cryptographic Protocols. Princeton University, USA, 2021 - [c14]Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? CRYPTO (4) 2021: 334-363 - [c13]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On the Round Complexity of Secure Quantum Computation. CRYPTO (1) 2021: 406-435 - [c12]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. CRYPTO (1) 2021: 467-496 - [c11]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier. FOCS 2021: 49-58 - [i21]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. CoRR abs/2103.08140 (2021) - [i20]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). CoRR abs/2111.12257 (2021) - [i19]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. Electron. Colloquium Comput. Complex. TR21 (2021) - [i18]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). Electron. Colloquium Comput. Complex. TR21 (2021) - [i17]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. IACR Cryptol. ePrint Arch. 2021: 334 (2021) - [i16]Elette Boyle, Justin Holmgren, Fermi Ma, Mor Weiss:
On the Security of Doubly Efficient PIR. IACR Cryptol. ePrint Arch. 2021: 1113 (2021) - [i15]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to do Quantum Rewinding Undetectably). IACR Cryptol. ePrint Arch. 2021: 1543 (2021) - 2020
- [c10]Xin Li, Fermi Ma, Willy Quach, Daniel Wichs:
Leakage-Resilient Key Exchange and Two-Seed Extractors. CRYPTO (1) 2020: 401-429 - [c9]James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry:
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption. ITCS 2020: 82:1-82:39 - [i14]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On The Round Complexity of Two-Party Quantum Computation. CoRR abs/2011.11212 (2020) - [i13]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. CoRR abs/2011.13486 (2020) - [i12]Xin Li, Fermi Ma, Willy Quach, Daniel Wichs:
Leakage-Resilient Key Exchange and Two-Seed Extractors. IACR Cryptol. ePrint Arch. 2020: 771 (2020) - [i11]James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai, Mark Zhandry:
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption. IACR Cryptol. ePrint Arch. 2020: 889 (2020) - [i10]Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? IACR Cryptol. ePrint Arch. 2020: 915 (2020) - [i9]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
On The Round Complexity of Two-Party Quantum Computation. IACR Cryptol. ePrint Arch. 2020: 1471 (2020) - [i8]James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma:
One-Way Functions Imply Secure Computation in a Quantum World. IACR Cryptol. ePrint Arch. 2020: 1487 (2020)
2010 – 2019
- 2019
- [c8]James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova:
Public-Key Function-Private Hidden Vector Encryption (and More). ASIACRYPT (3) 2019: 489-519 - [c7]James Bartusek, Fermi Ma, Mark Zhandry:
The Distinction Between Fixed and Random Generators in Group-Based Assumptions. CRYPTO (2) 2019: 801-830 - [c6]James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry:
New Techniques for Obfuscating Conjunctions. EUROCRYPT (3) 2019: 636-666 - [c5]James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum:
On the (In)security of Kilian-Based SNARGs. TCC (2) 2019: 522-551 - [i7]James Bartusek, Fermi Ma, Mark Zhandry:
The Distinction Between Fixed and Random Generators in Group-Based Assumptions. IACR Cryptol. ePrint Arch. 2019: 202 (2019) - [i6]James Bartusek, Brent Carmer, Abhishek Jain, Zhengzhong Jin, Tancrède Lepoint, Fermi Ma, Tal Malkin, Alex J. Malozemoff, Mariana Raykova:
Public-Key Function-Private Hidden Vector Encryption (and More). IACR Cryptol. ePrint Arch. 2019: 746 (2019) - [i5]James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron Rothblum:
On the (In)security of Kilian-Based SNARGs. IACR Cryptol. ePrint Arch. 2019: 997 (2019) - 2018
- [j3]Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The fewest clues problem. Theor. Comput. Sci. 748: 28-39 (2018) - [c4]Fermi Ma, Mark Zhandry:
The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks. TCC (2) 2018: 513-543 - [c3]James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry:
Return of GGH15: Provable Security Against Zeroizing Attacks. TCC (2) 2018: 544-574 - [i4]James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry:
Preventing Zeroizing Attacks on GGH15. IACR Cryptol. ePrint Arch. 2018: 511 (2018) - [i3]James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry:
New Techniques for Obfuscating Conjunctions. IACR Cryptol. ePrint Arch. 2018: 936 (2018) - 2017
- [j2]Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler:
Arboral satisfaction: Recognition and LP approximation. Inf. Process. Lett. 127: 1-5 (2017) - [i2]Fermi Ma, Mark Zhandry:
Encryptor Combiners: A Unified Approach to Multiparty NIKE, (H)IBE, and Broadcast Encryption. IACR Cryptol. ePrint Arch. 2017: 152 (2017) - [i1]Fermi Ma, Mark Zhandry:
New Multilinear Maps from CLT13 with Provable Security Against Zeroizing Attacks. IACR Cryptol. ePrint Arch. 2017: 946 (2017) - 2016
- [c2]Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The Fewest Clues Problem. FUN 2016: 12:1-12:12 - 2015
- [j1]Erik D. Demaine, Fermi Ma, Matthew Susskind, Erik Waingarten:
You Should Be Scared of German Ghost. J. Inf. Process. 23(3): 293-298 (2015) - 2014
- [c1]Erik D. Demaine, Fermi Ma, Erik Waingarten:
Playing Dominoes Is Hard, Except by Yourself. FUN 2014: 137-146
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
