Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
From MaRDI portal
Publication:2200519
DOI10.1007/s10623-020-00751-wzbMath1453.94136arXiv1904.11114OpenAlexW3106492076MaRDI QIDQ2200519
Publication date: 22 September 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.11114
Bounds on codes (94B65) Authentication, digital signatures and secret sharing (94A62) Quantum coding (general) (81P70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On secret sharing schemes
- Coset bounds for algebraic geometric codes
- Randomness in distribution protocols
- Strongly secure ramp secret sharing schemes for general access structures
- On the dealer's randomness required in secret sharing schemes
- Unitary reconstruction of secret for stabilizer-based quantum secret sharing
- Quantum strongly secure ramp secret sharing
- Classical access structures of ramp secret sharing based on quantum stabilizer codes
- Security of Ramp Schemes
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Secure Multiplex Coding With Dependent and Non-Uniform Multiple Messages
- Relative Generalized Rank Weight of Linear Codes and Its 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
- Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
- 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
- Secure Multiplex Coding Attaining Channel Capacity in Wiretap Channels
- Quantum secret sharing
- Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes
- Secure Computation from Random Error Correcting Codes
- Secure Multiparty Computation and Secret Sharing
This page was built for publication: Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets
