One-wayness in quantum cryptography

DOI10.4230/LIPICS.TQC.2024.4MaRDI QIDQ6859969zbMATH OpenFDO

Authors Tomoyuki Morimae, Takashi Yamakawa

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2024.4

zbMATH Keywords

efficiently generatable statesone-way functionsone-way state generators

Mathematics Subject Classification ID

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

Cites work

• A note on computational indistinguishability
• Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Computationally binding quantum commitments
• Foundations of Cryptography
• scientific article; zbMATH DE number 7701522 (Why is no real title available?)
• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• Pseudorandom quantum states
• Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• Quantum cryptography in Algorithmica
• Quantum encryption and generalized Shannon impossibility
• Quantum money from hidden subspaces
• Shadow tomography of quantum states

Cited in

(6)

• Quantum cryptography and meta-complexity
• Translating between the common Haar random state model and the unitary model
• Hard quantum extrapolations in quantum cryptography
• A new world in the depths of Microcrypt: separating OWSGs and quantum money from QEFID
• Signatures from pseudorandom states via -PRFs
• A note on output length of one-way state generators and EFIs

This page was built for publication: One-wayness in quantum cryptography

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