Classical access structures of ramp secret sharing based on quantum stabilizer codes
From MaRDI portal
Publication:2677549
DOI10.1007/s11128-019-2503-3OpenAlexW2901141524WikidataQ126663577 ScholiaQ126663577MaRDI QIDQ2677549
Publication date: 5 January 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.05217
Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62) Quantum coding (general) (81P70)
Related Items (2)
Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ Quantum implementation and resource estimates for rectangle and knot
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coset bounds for algebraic geometric codes
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
- How to share a secret
- Multiple-particle interference and quantum error correction
- Some New Characters on the Wire-Tap Channel of Type II
- Nonbinary Stabilizer Codes Over Finite Fields
- Quantum Error Correction and Orthogonal Geometry
- Nonbinary quantum stabilizer codes
- Quantum error correction via codes over GF(4)
- Lower bound for the quantum capacity of a discrete memoryless quantum channel
- Graph states for quantum secret sharing
- Quantum secret sharing
- Secure Computation from Random Error Correcting Codes
- Elements of Information Theory
This page was built for publication: Classical access structures of ramp secret sharing based on quantum stabilizer codes
