On central primitives for quantum cryptography with classical communication
From MaRDI portal
Cites work
- A note on computational indistinguishability
- A Pseudorandom Generator from any One-way Function
- 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
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- 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
Cited in
(9)- Quantum cryptography and meta-complexity
- A meta-complexity characterization of quantum cryptography
- A new world in the depths of Microcrypt: separating OWSGs and quantum money from QEFID
- Oracle separation between quantum commitments and quantum one-wayness
- Cryptography in the common Haar state model: feasibility results and separations
- MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
- On the limitations of pseudorandom unitaries. Or: cryptographic applications of LOCC indistinguishability of identical versus independent Haar unitaries
- Analysis of quantum primitives for quantum utility
- Publicly verifiable deletion: general compilers from minimal assumptions
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)
