Paper 2024/082 , University of California, Berkeley , Weizmann Institute of Science , Massachusetts Institute of Technology 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 feasibility of quantum obfuscation even in the classical oracle model, where one is given for free the ability to obfuscate any classical circuit.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by James Bartusek
Weakening Assumptions for Publicly-Verifiable Deletion
Paper 2023/559 Weakening Assumptions for Publicly-Verifiable Deletion , University of California, Berkeley , University of Illinois Urbana-Champaign , Max Planck Institute for Security and Privacy , California Institute of Technology , Ruhr-Universität Bochum Abstract We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems.
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge)
Paper 2023/564 Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge) , University of California, Berkeley , University of Illinois Urbana-Champaign , Tata Institute of Fundamental Research Abstract 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 computation that only makes (black-box) use of symmetric-key primitives?
Publicly-Verifiable Deletion via Target-Collapsing Functions
Paper 2023/370 Publicly-Verifiable Deletion via Target-Collapsing Functions , University of California, Berkeley , University of Illinois Urbana-Champaign , California Institute of Technology Abstract We build quantum cryptosystems that support publicly-verifiable deletion from standard cryptographic assumptions.
Obfuscation and Outsourced Computation with Certified Deletion
Paper 2023/265 Obfuscation and Outsourced Computation with Certified Deletion , UC Berkeley , UC Berkeley, NTT Research , CMU, NTT Research , UIUC , Max Planck Institute for Security and Privacy , CMU , UC Berkeley Abstract Can we outsource computation on encrypted data, while ensuring that the data is certifiably, information-theoretically deleted by the server after computation?
Obfuscation of Pseudo-Deterministic Quantum Circuits
Paper 2023/252 Obfuscation of Pseudo-Deterministic Quantum Circuits , UC Berkeley , NTT Social Informatics Laboratories , NTT Social Informatics Laboratories , NTT Social Informatics Laboratories Abstract We show how to obfuscate pseudo-deterministic quantum circuits, assuming the quantum hardness of learning with errors (QLWE) and post-quantum virtual black-box (VBB) obfuscation for classical circuits.
Secure Quantum Computation with Classical Communication
Paper 2021/964 Secure Quantum Computation with Classical Communication , UC Berkeley Abstract The study of secure multi-party computation (MPC) has thus far been limited to the following two settings: every party is fully classical, or every party has quantum capabilities. This paper studies a notion of MPC that allows some classical and some quantum parties to securely compute a quantum functionality over their joint private inputs.
A New Framework for Quantum Oblivious Transfer
Paper 2022/1191 A New Framework for Quantum Oblivious Transfer , University of Illinois Urbana-Champaign , University of California, Berkeley , University of Illinois Urbana-Champaign Abstract We present a new template for building oblivious transfer from quantum information that we call the ``fixed basis'' framework.
Cryptography with Certified Deletion
Paper 2022/1178 Cryptography with Certified Deletion , University of California, Berkeley , University of Illinois Urbana-Champaign Abstract We propose a new, unifying framework that yields an array of cryptographic primitives with {\em certified deletion}.
Succinct Classical Verification of Quantum Computation
Paper 2022/857 Succinct Classical Verification of Quantum Computation , University of California, Berkeley , Microsoft Research, Massachusetts Institute of Technology , Massachusetts Institute of Technology , University of California, Berkeley, Simons Institute , Max Planck Institute for Security and Privacy , Massachusetts Institute of Technology , California Institute of Technology , Massachusetts Institute of Technology Abstract We construct a classically verifiable succinct interactive...
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with James
Contact James, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack