Hard quantum extrapolations in quantum cryptography

DOI10.1007/978-3-031-91098-2_3MaRDI QIDQ6891198zbMATH OpenFDO

Authors Luowen Qian, Justin Raizes, Mark Zhandry

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91098-2_3

zbMATH Keywords

hard quantum extrapolationsminimal primitiveuniversal extrapolation

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• \(\mathsf{stateQIP} = \mathsf{stateSPACE}\)
• A computational separation between quantum no-cloning and no-telegraphing
• A note on computational indistinguishability
• A Pseudorandom Generator from any One-way Function
• Adiabatic Quantum State Generation
• Advances in Cryptology - EUROCRYPT 2004
• Cryptography from pseudorandom quantum states
• General properties of quantum bit commitments (extended abstract)
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 7701522 (Why is no real title available?)
• On quasiequivalence of locally normal states
• On the computational hardness needed for quantum cryptography
• One-wayness in quantum cryptography
• Quantum commitments and signatures without one-way functions
• Quantum computation and quantum information. 10th anniversary edition
• Quantum cryptography in Algorithmica
• Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
• Robust quantum public-key encryption with applications to quantum key distribution

This page was built for publication: Hard quantum extrapolations in quantum cryptography

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