2 citations · 7 across the 19 of their papers we have counts for
7 papers · 1 filter
Natural Barriers to Quantum Extraction: On the Post-Quantum (In)security of (O)EKE and Masny-Rindal OT
James Bartusek, Jake Januzelli
Encrypted key exchange (EKE), introduced by Bellovin and Merritt (IEEE S\&P 1992), and Masny-Rindal OT, introduced by Masny and Rindal (ACM CCS 2019), are highly-efficient methods…
Succinct Arguments for QMA from Collapsing Hash Functions
James Bartusek, Giulio Malavolta
We prove the existence of succinct arguments for QMA, assuming only the existence of collapsing hash functions. This is the first scheme that relies only on unstructured ``Minicryp…
On the Cryptographic Structure Required for Verifying Qubits
James Bartusek, Itay Shalit
Classically testing for the presence of anti-commuting operators on a quantum device is a critical tool underpinning recent progress in classical verification of quantum computatio…
A Modular Approach to Succinct Arguments for QMA
James Bartusek, Jiahui Liu, Giulio Malavolta
Succinct argument systems are of central importance to modern crytpography, enabling the efficient verification of computational claims. In the classical setting, Kilian (STOC 92)…
How To Track Qubits Through Space and Time (Or: Sailing in a Quantum Boat)
James Bartusek, Zikuan Huang, Leo Orshansky +1
While quantum position verification aims to certify a prover's location using quantum information, existing security definitions only guarantee that part of the successful adversar…
A Note on Boosting Uncloneable Encryption in Microcrypt
James Bartusek, Eli Goldin
In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphert…
Unclonable Encryption in the Haar Random Oracle Model
James Bartusek, Eli Goldin
We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to for a Haar random unitary . Our scheme sati…