activity
20152026
most citedVerifiable Quantum Advantage without Structure

22 citations · 45 across the 22 of their papers we have counts for

collaborators
Showing 2024Show all

7 papers · 1 filter

quant-ph2024

Toward Separating QMA from QCMA with a Classical Oracle

Mark Zhandry

QMA is the class of languages that can be decided by an efficient quantum verifier given a quantum witness, whereas QCMA is the class of such languages where the efficient quantum…

quant-ph2024★ 3 cited

A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire

John Bostanci, Barak Nehoran, Mark Zhandry

Aaronson, Atia, and Susskind (2020) established that efficiently mapping between quantum states and is computationally equivalent to distinguishing their su…

quant-ph2024

(Quantum) Indifferentiability and Pre-Computation

Joseph Carolan, Alexander Poremba, Mark Zhandry

Indifferentiability is a popular cryptographic paradigm for analyzing the security of ideal objects -- both in a classical as well as in a quantum world. It is typically stated in…

cs.CR2024

Composability in Watermarking Schemes

Jiahui Liu, Mark Zhandry

Software watermarking allows for embedding a mark into a piece of code, such that any attempt to remove the mark will render the code useless. Provably secure watermarking schemes…

quant-ph2024

Quantum State Group Actions

Saachi Mutreja, Mark Zhandry

Cryptographic group actions are a leading contender for post-quantum cryptography, and have also been used in the development of quantum cryptographic protocols. In this work, we e…

quant-ph2024

Hard Quantum Extrapolations in Quantum Cryptography

Luowen Qian, Justin Raizes, Mark Zhandry

Although one-way functions are well-established as the minimal primitive for classical cryptography, a minimal primitive for quantum cryptography is still unclear. Universal extrap…