Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
From MaRDI portal
Publication:2200519
DOI10.1007/S10623-020-00751-WzbMATH Open1453.94136arXiv1904.11114OpenAlexW3106492076MaRDI QIDQ2200519FDOQ2200519
Publication date: 22 September 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1904.11114
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
Quantum coding (general) (81P70) Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Multiple-particle interference and quantum error correction
- Quantum strongly secure ramp secret sharing
- How to share a secret
- Title not available (Why is that?)
- Nonbinary Stabilizer Codes Over Finite Fields
- Title not available (Why is that?)
- Quantum Error Correction and Orthogonal Geometry
- Title not available (Why is that?)
- Nonbinary quantum stabilizer codes
- Quantum error correction via codes over GF(4)
- Graph states for quantum secret sharing
- Quantum secret sharing
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
- Some New Characters on the Wire-Tap Channel of Type II
- Secure Computation from Random Error Correcting Codes
- Title not available (Why is that?)
- Security of Ramp Schemes
- On the dealer's randomness required in secret sharing schemes
- On secret sharing schemes
- Randomness in distribution protocols
- Coset bounds for algebraic geometric codes
- Title not available (Why is that?)
- Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing
- Lower bound for the quantum capacity of a discrete memoryless quantum channel
- Secure Multiparty Computation and Secret Sharing
- Strongly secure ramp secret sharing schemes for general access structures
- Classical access structures of ramp secret sharing based on quantum stabilizer codes
- Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
- Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels
- Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes
Cited In (2)
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)
