A Meta-complexity Characterization of Quantum Cryptography
- 28 April 2025
- book chapter
- Published by Springer Nature
- p. 82-107
Abstract
No abstract availableKeywords
All Related Versions
This publication has 37 references indexed in Scilit:
- On Central Primitives for Quantum Cryptography with Classical Communication2024
- Quantum Advantage from One-Way Functions2024
- One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions2023
- Cryptography from Pseudorandom Quantum States2022
- Quantum Commitments and Signatures Without One-Way Functions2022
- General Properties of Quantum Bit Commitments (Extended Abstract)2022
- An Introduction to Kolmogorov Complexity and Its Applications2019
- Quantum Kolmogorov ComplexityJournal of Computer and System Sciences, 2001
- Complexity Limitations on Quantum ComputationJournal of Computer and System Sciences, 1999
- Cryptographic Primitives Based on Hard Learning Problems1994