A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
From MaRDI portal
Publication:2309688
DOI10.1016/j.laa.2020.03.010zbMath1444.94126OpenAlexW3012143871MaRDI QIDQ2309688
Juan Carlos Ku-Cauich, Guillermo Morales Luna
Publication date: 1 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.03.010
Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Boolean functions (06E30) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in information and computer security. 9th international workshop on security, IWSEC 2014, Hirosaki, Japan, August 27--29, 2014. Proceedings
- Analysis and design of stream ciphers
- Detection of cheaters in vector space secret sharing schemes
- Construction of t-Resilient Functions over a Finite Alphabet
- 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
- Privacy Amplification by Public Discussion
- Cryptographically resilient functions
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field
- Secure Computation from Random Error Correcting Codes
This page was built for publication: A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme