Quantum cryptography and meta-complexity
From MaRDI portal
Cites work
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- A duality between one-way functions and average-case symmetry of information
- A formal theory of inductive inference. Part I
- A Pseudorandom Generator from any One-way Function
- Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
- An introduction to Kolmogorov complexity and its applications
- BQP and the polynomial hierarchy
- Capturing one-way functions via NP-hardness of meta-complexity
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Complexity-theoretic foundations of quantum supremacy experiments
- Cryptographic group actions and applications
- Cryptography from pseudorandom quantum states
- General linear group action on tensors: a candidate for post-quantum cryptography
- General properties of quantum bit commitments (extended abstract)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Learning in Pessiland via inductive inference
- New directions in cryptography
- Oblivious transfer is in MiniQCrypt
- On central primitives for quantum cryptography with classical communication
- On one-way functions and Kolmogorov complexity
- On the computational hardness needed for quantum cryptography
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
- One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
- One-way functions imply secure computation in a quantum world
- One-wayness in quantum cryptography
- Probabilistic encryption
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Quantum advantage from one-way functions
- Quantum commitments and signatures without one-way functions
- Quantum cryptography in Algorithmica
- Quantum depth in the random oracle model
- The computational complexity of linear optics
- Three approaches to the quantitative definition of information*
- Verifiable quantum advantage without structure
This page was built for publication: Quantum cryptography and meta-complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863951)
