Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
From MaRDI portal
(Redirected from Publication:2200519)
Abstract: We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures. We generalize the Gilbert-Varshamov bound for deterministic encoding to randomized encoding of classical secrets. We also provide an explicit example of a ramp secret sharing scheme with which multiple symbols in its classical secret are revealed to an intermediate set, and justify the necessity of incorporating strong security criterion of conventional secret sharing. Finally, we propose an explicit construction of strongly secure ramp secret sharing scheme by quantum stabilizers, which can support twice as large classical secrets as the McEliece-Sarwate strongly secure ramp secret sharing scheme of the same share size and the access structure.
Recommendations
- Classical access structures of ramp secret sharing based on quantum stabilizer codes
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
- Sharing classical secrets with Calderbank-Shor-Steane codes
- Quantum strongly secure ramp secret sharing
- Quantum ramp secret sharing scheme and quantum operations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3125713 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284414 (Why is no real title available?)
- scientific article; zbMATH DE number 1516803 (Why is no real title available?)
- scientific article; zbMATH DE number 2221909 (Why is no real title available?)
- Classical access structures of ramp secret sharing based on quantum stabilizer codes
- Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes
- Coset bounds for algebraic geometric codes
- Graph states for quantum secret sharing
- How to share a secret
- Lower bound for the quantum capacity of a discrete memoryless quantum channel
- Multiple-particle interference and quantum error correction
- Nonbinary Stabilizer Codes Over Finite Fields
- Nonbinary quantum stabilizer codes
- On secret sharing schemes
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- On the dealer's randomness required in secret sharing schemes
- Quantum Error Correction and Orthogonal Geometry
- Quantum error correction via codes over GF(4)
- Quantum secret sharing
- Quantum strongly secure ramp secret sharing
- Randomness in distribution protocols
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Secure Computation from Random Error Correcting Codes
- Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels
- Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
- Secure multiparty computation and secret sharing
- Security of Ramp Schemes
- Some New Characters on the Wire-Tap Channel of Type II
- Strongly secure ramp secret sharing schemes for general access structures
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing
- Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
Cited in
(4)- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
- Sharing classical secrets with Calderbank-Shor-Steane codes
- Classical access structures of ramp secret sharing based on quantum stabilizer codes
- scientific article; zbMATH DE number 5320319 (Why is no real title available?)
This page was built for publication: Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200519)
