Secret sharing schemes based on graphical codes

DOI10.1007/s12095-013-0092-zzbMath1294.94103OpenAlexW2129096874MaRDI QIDQ2016393

Ying Gao, Romar B. dela Cruz

Publication date: 20 June 2014

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-013-0092-z

zbMATH Keywords

graphlinear codematroidsecret sharing

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the classification of ideal secret sharing schemes
• An explication of secret sharing schemes
• E ₁₁ and M theory
• Secret-Sharing Schemes: A Survey
• How to share a secret
• Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
• On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
• Strongly Multiplicative Hierarchical Threshold Secret Sharing
• Graphical codes revisited
• Minimal vectors in linear codes
• Universally ideal secret-sharing schemes
• Communication in key distribution schemes
• Representing Small Identically Self‐Dual Matroids by Self‐Dual Codes
• Graph theoretic error-correcting codes
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields

This page was built for publication: Secret sharing schemes based on graphical codes