scientific article; zbMATH DE number 503241
From MaRDI portal
Publication:4279563
Cited in
(20)- Complexity of protein folding
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
- A simple voting protocol on quantum blockchain
- Game theoretic security of quantum bit commitment
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- Implementation of an E-payment security evaluation system based on quantum blind computing
- Cheat sensitive quantum bit commitment via pre- and post-selected quantum states
- Experimental quantum cryptography.
- Practical and provably-secure commitment schemes from collision-free hashing
- On the impossibility of non-static quantum bit commitment between two parties
- Quantum cryptography and security analysis
- Susceptible Two-Party Quantum Computations
- Preface
- Preface
- General properties of quantum bit commitments (extended abstract)
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Probabilistic versions of quantum private queries
- A quantum game designed for property partitioning with implementation on superconducting quantum processors
- Quantum cryptography beyond quantum key distribution
- Quantum cryptography
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279563)
