RT info:eu-repo/semantics/article
T1 On asymptotically good ramp secret sharing schemes
A1 Geil, Olav
A1 Martin, Stefano
A1 Martínez Peñas, Umberto
A1 Matsumoto, Ryutaroh
A1 Ruano Benito, Diego
AB 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.
YR 2017
FD 2017
LK http://uvadoc.uva.es/handle/10324/31723
UL http://uvadoc.uva.es/handle/10324/31723
LA eng
NO IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. Volume E100-A, Number 12, pages 2699-2708 (2017)
DS UVaDOC
RD 23-abr-2024