General properties of quantum bit commitments (extended abstract)
From MaRDI portal
Publication:6134002
Recommendations
- Perfectly concealing quantum bit commitment from any quantum one-way permutation
- Quantum commitments from complexity assumptions
- scientific article; zbMATH DE number 1302858
- Quantum commitments from complexity assumptions
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1722671 (Why is no real title available?)
- scientific article; zbMATH DE number 1263182 (Why is no real title available?)
- scientific article; zbMATH DE number 503241 (Why is no real title available?)
- scientific article; zbMATH DE number 2086396 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- A note on computational indistinguishability
- Advances in Cryptology – CRYPTO 2004
- Algorithms and Computation
- An Equivalence Between Zero Knowledge and Commitments
- Bit commitment using pseudorandomness
- Classical binding for quantum commitments
- Coding theorem and strong converse for quantum channels
- Collapse-binding quantum commitments without random oracles
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- Computationally binding quantum commitments
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Foundations of Cryptography
- General Properties of Quantum Zero-Knowledge Proofs
- Improving the Security of Quantum Protocols via Commit-and-Open
- Oblivious Transfer Is Symmetric
- Oblivious transfer is in MiniQCrypt
- One-way functions imply secure computation in a quantum world
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Perfect zero-knowledge arguments for NP using any one-way permutation
- 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 commitments and signatures without one-way functions
- Quantum commitments from complexity assumptions
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Quantum cryptography: public key distribution and coin tossing
- Quantum proofs of knowledge
- Sampling in a quantum population, and applications
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- The theory of quantum information
- Theory of Cryptography
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
Cited in
(6)- scientific article; zbMATH DE number 1722671 (Why is no real title available?)
- Black-box separations for non-interactive classical commitments in a quantum world
- Black-hole radiation decoding is quantum cryptography
- Unconditionally secure quantum commitments with preprocessing
- Unconditionally secure commitments with quantum auxiliary inputs
- Exponential quantum one-wayness and EFI pairs
This page was built for publication: General properties of quantum bit commitments (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134002)
