Secret sharing schemes based on graphical codes
From MaRDI portal
Publication:2016393
Recommendations
- Secret sharing schemes on graphs
- Secret sharing schemes from binary linear codes
- Code based secret sharing schemes. Applied combinatorial coding theory
- On the composition of secret sharing schemes related to codes
- Secret sharing schemes based on the dual of Golay codes
- Graph decompositions and secret sharing schemes
- scientific article; zbMATH DE number 503323
- Secret sharing schemes for graph-based prohibited structures
- Secret sharing based on Cartesian product of graphs
- On secret sharing schemes
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- An explication of secret sharing schemes
- Communication in key distribution schemes
- Cryptography. Theory and practice
- General secure multi-party computation from any linear secret-sharing scheme
- Graph theoretic error-correcting codes
- Graphical codes revisited
- How to share a secret
- Minimal vectors in linear codes
- Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- On the classification of ideal secret sharing schemes
- Representing Small Identically Self‐Dual Matroids by Self‐Dual Codes
- Secret-Sharing Schemes: A Survey
- Strongly multiplicative hierarchical threshold secret sharing
- Universally ideal secret-sharing schemes
- \(E_{11}\) and M theory
Cited in
(4)
This page was built for publication: Secret sharing schemes based on graphical codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016393)