Obfuscation of pseudo-deterministic quantum circuits

Cites Work

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Quantum cryptography: public key distribution and coin tossing
New directions in cryptography
Universal Blind Quantum Computation
The random oracle methodology, revisited.
Lower bounds on the maximum cross correlation of signals (Corresp.)
Secure assisted quantum computation
Candidate indistinguishability obfuscation and functional encryption for all circuits
Secure multi-party quantum computation
The complexity of approximating a nonlinear program
Constructions for quantum indistinguishability obfuscation
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
On the (im)possibility of obfuscating programs
Circuit obfuscation using braids
Quantum FHE (almost) as secure as classical
GGH15 beyond permutation branching programs: proofs, attacks, and candidates
Non-interactive classical verification of quantum computation
Succinct randomized encodings and their applications
Classical verification of quantum computations
Succinct classical verification of quantum computation
Return of GGH15: provable security against zeroizing attacks
One-shot signatures and applications to hybrid quantum/classical authentication
Secure quantum computation with classical communication
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
Security of the Fiat-Shamir transformation in the quantum random-oracle model
Watermarking cryptographic capabilities
Impossibility of quantum virtual black-box obfuscation of classical circuits
New approaches for quantum copy-protection
Hidden cosets and applications to unclonable cryptography
Indistinguishability obfuscation from circular security
Watermarking PRFs against quantum adversaries
Constant-round blind classical verification of quantum sampling
Unclonable encryption, revisited
Succinct LWE sampling, random polynomials, and obfuscation
Classical homomorphic encryption for quantum circuits
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Verifying quantum computations at scale: a cryptographic leash on quantum devices
How to use indistinguishability obfuscation: deniable encryption, and more
Functional encryption with secure key leasing
On the feasibility of unclonable encryption, and more

This page was built for publication: Obfuscation of pseudo-deterministic quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499322)