On central primitives for quantum cryptography with classical communication

DOI10.1007/978-3-031-68394-7_8MaRDI QIDQ6653009zbMATH OpenFDO

Authors Kai-Min Chung, Eli Goldin, Matthew J. Gray

Publication date 13 December 2024

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 7701522 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A note on computational indistinguishability
• Bit commitment using pseudorandomness
• Black-box separations for non-interactive classical commitments in a quantum world
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Cryptography from pseudorandom quantum states
• Efficiency improvements in constructing pseudorandom generators from one-way functions
• On Robust Combiners for Oblivious Transfer and Other Primitives
• On the impossibility of key agreements from quantum random oracles
• One way functions and pseudorandom generators
• Quantum commitments and signatures without one-way functions
• Quantum search-to-decision reductions and the state synthesis problem

This page was built for publication: On central primitives for quantum cryptography with classical communication

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