Skip navigation
Por favor, use este identificador para citar o enlazar este ítem:
Título: On asymptotically good ramp secret sharing schemes
Autor: Geil, Olav
Martin, Stefano
Martínez-Peñas, Umberto
Matsumoto, Ryutaroh
Ruano, Diego
Año del Documento: 2017
Documento Fuente: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. Volume E100-A, Number 12, pages 2699-2708 (2017)
Resumen: 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.
Revisión por Pares: SI
Patrocinador: The Danish Council for Independent Research (DFF-4002-00367), the Spanish MINECO/FEDER (MTM2015-65764-C3-2-P), Japan Society for the Promotion of Science (23246071 and 26289116), the Villum Foundation through their VELUX Visiting Professor Programme 2013-2014, and the "Program for Promoting the Enhancement of Research Universities'' at Tokyo Institute of Technology.
Version del Editor:
Idioma: eng
Derechos: info:eu-repo/semantics/openAccess
Aparece en las colecciones:DEP96 - Artículos de revista

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
IEICE2017eprint.pdf426,42 kBAdobe PDFThumbnail

Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons

Universidad de Valladolid
Powered by MIT's. DSpace software, Version 5.5