Secret Sharing in the Rank Metric
arXiv:2504.18294 · doi:10.1109/ISIT63088.2025.11195478
Abstract
The connection between secret sharing and matroid theory is well established. In this paper, we generalize the concepts of secret sharing and matroid ports to -polymatroids. Specifically, we introduce the notion of an access structure on a vector space, and consider properties related to duality, minors, and the relationship to -polymatroids. Finally, we show how rank-metric codes give rise to secret sharing schemes within this framework.
References in corpus (6)
- A Rank-Metric Approach to Error Control in Random Network Coding
- Private Information Retrieval from Coded Databases with Colluding Servers
- Universal Secure Network Coding via Rank-Metric Codes
- Rank-Metric Codes and -Polymatroids
- Unifying notions of generalized weights for universal security on wire-tap networks
- Entropic matroids and their representation