Perfectly concealing quantum bit commitment from any quantum one-way permutation
From MaRDI portal
Publication:3374917
Recommendations
- Quantum bit-commitment for small storage based on quantum one-way permutations
- scientific article; zbMATH DE number 1302858
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- QUANTUM BIT COMMITMENT WITH SECRET PARAMETERS
Cited in
(30)- Quantum identification protocol with technologically bounded parties
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- A short impossibility proof of quantum bit commitment
- One-way functions imply secure computation in a quantum world
- QUANTUM BIT COMMITMENT WITH SECRET PARAMETERS
- Black-box separations for non-interactive classical commitments in a quantum world
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Quantum commitments from complexity assumptions
- Quantum bit-commitment for small storage based on quantum one-way permutations
- Unconditionally secure multi-party quantum commitment scheme
- Mathematical Foundations of Computer Science 2004
- Theory of Cryptography
- Collapse-binding quantum commitments without random oracles
- Deterministic relativistic quantum bit commitment
- Statistical zero knowledge and quantum one-way functions
- Topics in Cryptology – CT-RSA 2004
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Computational indistinguishability between quantum states and its cryptographic application
- Quantum one-way permutation over the finite field of two elements
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Implementation of an E-payment security evaluation system based on quantum blind computing
- Universal test for quantum one-way permutations
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- Unconditionally secure commitments with quantum auxiliary inputs
- A new protocol and lower bounds for quantum coin flipping
- Quantum commitments and signatures without one-way functions
- Classical binding for quantum commitments
- General properties of quantum bit commitments (extended abstract)
- Quantum data hiding
This page was built for publication: Perfectly concealing quantum bit commitment from any quantum one-way permutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374917)
