Unconditionally secure quantum commitments with preprocessing
From MaRDI portal
Publication:6653000
DOI10.1007/978-3-031-68394-7_2MaRDI QIDQ6653000
Publication date: 13 December 2024
Cites Work
- Title not available (Why is that?)
- Quantum commitments from complexity assumptions
- Bit commitment using pseudorandomness
- A note on computational indistinguishability
- One-way functions imply secure computation in a quantum world
- Simple schemes in the bounded storage model
- How to record quantum queries, and applications to quantum indifferentiability
- Zero-knowledge against quantum attacks
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Sparse pseudorandom distributions
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Cryptography from pseudorandom quantum states
- Quantum commitments and signatures without one-way functions
- General properties of quantum bit commitments (extended abstract)
- Non-uniformity and quantum advice in the quantum random oracle model
- Black-hole radiation decoding is quantum cryptography
- Cryptography with certified deletion
- Quantum cryptography in Algorithmica
- How to base security on the perfect/statistical binding property of quantum bit commitment?
- On the computational hardness needed for quantum cryptography
This page was built for publication: Unconditionally secure quantum commitments with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653000)
