Sequential quantum secret sharing in noisy environments
From MaRDI portal
Abstract: Sequential Quantum Secret Sharing schemes (QSS) do not use entangled states for secret sharing, rather they rely on sequential operations of the players on a single state which is circulated between the players. In order to check the viability of these schemes under imperfect operations and noise in the channels, we consider one such scheme in detail and show that under moderate conditions it is still possible to extract viable secure shared keys in this scheme. Although we specifically consider only one type of sequential scheme and three different noise models, our method is fairly general to be applied to other QSS schemes and noise models as well.
Recommendations
- Efficient fault-tolerant quantum secret sharing over two collective-noise channels
- Verifiable threshold quantum secret sharing with sequential communication
- Quantum secret sharing scheme in noise environment based on weak measurement
- The general theory of three-party quantum secret sharing protocols over phase-damping channels
- Secret sharing of a known arbitrary quantum state with noisy environment
Cites work
- scientific article; zbMATH DE number 5666681 (Why is no real title available?)
- An efficient quantum secret sharing scheme with Einstein-Podolsky-Rosen pairs
- Graph states for quantum secret sharing
- Multi-partite quantum cryptographic protocols with noisy GHZ states
- Multiparty quantum secret sharing
- Probabilistic secret sharing through noisy quantum channel
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography: public key distribution and coin tossing
- Quantum secret sharing
- Quantum secret sharing with continuous variable graph state
Cited in
(7)- Secret sharing of a known arbitrary quantum state with noisy environment
- Quantum secret sharing affected by vacuum fluctuation
- Fault-tolerant quantum secret sharing against collective noise
- Quantum secret sharing scheme in noise environment based on weak measurement
- Continuous variable quantum secret sharing with Chinese remainder theorem
- Efficient verifiable quantum secret sharing schemes via eight-quantum-entangled states
- Quantum multi-secret sharing scheme with access structures and cheat identification
This page was built for publication: Sequential quantum secret sharing in noisy environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669815)