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