Obfuscation of pseudo-deterministic quantum circuits
From MaRDI portal
Publication:6499322
DOI10.1145/3564246.3585179WikidataQ130877476 ScholiaQ130877476MaRDI QIDQ6499322
James Bartusek, Takashi Yamakawa, Fuyuki Kitagawa, Ryo Nishimaki
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Quantum FHE (almost) as secure as classical
- Return of GGH15: provable security against zeroizing attacks
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- The complexity of approximating a nonlinear program
- Secure software leasing
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Two-round oblivious transfer from CDH or LPN
- Non-interactive classical verification of quantum computation
- Impossibility of quantum virtual black-box obfuscation of classical circuits
- New approaches for quantum copy-protection
- Hidden cosets and applications to unclonable cryptography
- Constructions for quantum indistinguishability obfuscation
- Watermarking PRFs against quantum adversaries
- Constant-round blind classical verification of quantum sampling
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Secure quantum computation with classical communication
- Unclonable encryption, revisited
- Succinct LWE sampling, random polynomials, and obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Succinct Randomized Encodings and their Applications
- The random oracle methodology, revisited
- Quantum money from hidden subspaces
- Classical Homomorphic Encryption for Quantum Circuits
- Secure multi-party quantum computation
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- New directions in cryptography
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Watermarking Cryptographic Capabilities
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Classical Verification of Quantum Computations
- One-shot signatures and applications to hybrid quantum/classical authentication
- Universal Blind Quantum Computation
- Verifying quantum computations at scale: A cryptographic leash on quantum devices
- On the (im)possibility of obfuscating programs
- Indistinguishability obfuscation from circular security
- Succinct classical verification of quantum computation
- On the feasibility of unclonable encryption, and more
- Functional encryption with secure key leasing
This page was built for publication: Obfuscation of pseudo-deterministic quantum circuits