On the computational hardness needed for quantum cryptography

DOI10.4230/LIPICS.ITCS.2023.24MaRDI QIDQ6610287zbMATH OpenFDO

Authors Zvika Brakerski, Ran Canetti, Luowen Qian

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.24

zbMATH Keywords

commitment schemeEFIoblivious transferquantum cryptographysecure multiparty computationzero knowledge

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(18)

• Quantum advantage from one-way functions
• Unconditionally secure quantum commitments with preprocessing
• Unconditionally secure commitments with quantum auxiliary inputs
• Quantum public-key encryption with tamper-resilient public keys from one-way functions
• Quantum cryptography and meta-complexity
• Quantum state group actions
• Pseudorandomness in the (inverseless) Haar random oracle model
• The power of a single Haar random state: constructing and separating quantum pseudorandomness
• Hard quantum extrapolations in quantum cryptography
• A new world in the depths of Microcrypt: separating OWSGs and quantum money from QEFID
• Robust combiners and universal constructions for quantum cryptography
• Cryptography in the common Haar state model: feasibility results and separations
• Real-valued somewhat-pseudorandom unitaries
• Quantum unpredictability
• On the limitations of pseudorandom unitaries. Or: cryptographic applications of LOCC indistinguishability of identical versus independent Haar unitaries
• Pseudorandom function-like states from common Haar unitary
• Analysis of quantum primitives for quantum utility
• A note on the minimality of one-way functions in post-quantum cryptography

This page was built for publication: On the computational hardness needed for quantum cryptography

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