Secret sharing schemes based on the dual of Golay codes
From MaRDI portal
Publication:2121024
DOI10.1007/s12095-021-00531-wzbMath1491.94083OpenAlexW3212190436MaRDI QIDQ2121024
Changlu Lin, Jian Ding, Sihem Mesnager
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00531-w
Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Multiple assignment scheme for sharing secret
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Recent results and problems on constructions of linear codes from cryptographic functions
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- Minimal linear codes from weakly regular plateaued balanced functions
- Some connections between self-dual codes, combinatorial designs and secret sharing schemes
- On Minimal and Quasi-minimal Linear Codes
- How to share a secret
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Secret sharing schemes from three classes of linear codes
- Fundamentals of Error-Correcting Codes
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Minimal Linear Codes in Odd Characteristic
This page was built for publication: Secret sharing schemes based on the dual of Golay codes
