2 citations · 7 across the 19 of their papers we have counts for
24 papers
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…
A New Approach to Arguments of Quantum Knowledge
James Bartusek, Ruta Jawale, Justin Raizes +1
We construct a publicly-verifiable non-interactive zero-knowledge argument system for QMA with the following properties. 1. Transparent setup. Our protocol only requires a uniforml…
Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE
James Bartusek, Aparna Gupte, Saachi Mutreja +1
A classical obfuscator for quantum circuits is a classical program that, given the classical description of a quantum circuit , outputs the classical description of a functional…
On the Power of Oblivious State Preparation
James Bartusek, Dakshita Khurana
We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client…
On the Communication Complexity of Secure Multi-Party Computation With Aborts
James Bartusek, Thiago Bergamaschi, Seri Khoury +2
A central goal of cryptography is Secure Multi-party Computation (MPC), where parties desire to compute a function of their joint inputs without letting any party learn about t…
Secret Sharing with Certified Deletion
James Bartusek, Justin Raizes
Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. Although secret shari…
Quantum State Obfuscation from Classical Oracles
James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan
A major unresolved question in quantum cryptography is whether it is possible to obfuscate arbitrary quantum computation. Indeed, there is much yet to understand about the feasibil…
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
James Bartusek, Dakshita Khurana, Akshayaram Srinivasan
Can a sender non-interactively transmit one of two strings to a receiver without knowing which string was received? Does there exist minimally-interactive secure multiparty computa…
Weakening Assumptions for Publicly-Verifiable Deletion
James Bartusek, Dakshita Khurana, Giulio Malavolta +2
We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state ge…
Publicly-Verifiable Deletion via Target-Collapsing Functions
James Bartusek, Dakshita Khurana, Alexander Poremba
We build quantum cryptosystems that support publicly-verifiable deletion from standard cryptographic assumptions. We introduce target-collapsing as a weakening of collapsing for ha…
Obfuscation of Pseudo-Deterministic Quantum Circuits
James Bartusek, Fuyuki Kitagawa, Ryo Nishimaki +1
We show how to obfuscate pseudo-deterministic quantum circuits in the classical oracle model, assuming the quantum hardness of learning with errors. Given the classical description…
A New Framework for Quantum Oblivious Transfer
Amit Agarwal, James Bartusek, Dakshita Khurana +1
We present a new template for building oblivious transfer from quantum information that we call the "fixed basis" framework. Our framework departs from prior work (eg., Crepeau and…
Cryptography with Certified Deletion
James Bartusek, Dakshita Khurana
We propose a new, unifying framework that yields an array of cryptographic primitives with certified deletion. These primitives enable a party in possession of a quantum ciphertext…
Succinct Classical Verification of Quantum Computation
James Bartusek, Yael Tauman Kalai, Alex Lombardi +5
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in th…
Indistinguishability Obfuscation of Null Quantum Circuits and Applications
James Bartusek, Giulio Malavolta
We study the notion of indistinguishability obfuscation for null quantum circuits (quantum null-iO). We present a construction assuming: - The quantum hardness of learning with err…
One-Way Functions Imply Secure Computation in a Quantum World
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functio…
On The Round Complexity of Secure Quantum Computation
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries.…
Post-Quantum Multi-Party Computation
Amit Agarwal, James Bartusek, Vipul Goyal +2
We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. We observe…