Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Fermi Ma:

TR22-140 | 10th October 2022
Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry

Commitments to Quantum States

Revisions: 1

What does it mean to commit to a quantum state? In this work, we propose a simple answer: a commitment to quantum messages is binding if, after the commit phase, the committed state is hidden from the sender's view. We accompany this new definition with several instantiations. We build the ... more >>>

TR21-038 | 15th March 2021
Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

Post-Quantum Succinct Arguments

Revisions: 1

We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness of Learning with Errors).

At the heart of our proof is a new ... more >>>

ISSN 1433-8092 | Imprint