On asymptotically good ramp secret sharing schemes
arXiv:1502.05507 · doi:10.1587/transfun.E100.A.2699
Abstract
Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by Cramer et al. in terms of sequences of pairs of nested algebraic geometric codes. In those works the focus is on full privacy and full reconstruction. In this paper we analyze additional parameters describing the asymptotic behavior of partial information leakage and possibly also partial reconstruction giving a more complete picture of the access structure for sequences of linear ramp secret sharing schemes. Our study involves a detailed treatment of the (relative) generalized Hamming weights of the considered codes.
References in corpus (5)
- Squares of Random Linear Codes
- Relative generalized Hamming weights of one-point algebraic geometric codes
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
- New Asymptotic Metrics for Relative Generalized Hamming Weight
- Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of and