On asymptotically good ramp secret sharing schemes

Abstract : Asymptotically good sequences of ramp secret sharing schemes have been intensively studied by Cramer et al. in [1,2,3,4,5,6,7,8]. In those works the focus is on full privacy and full reconstruction. We propose an alternative definition of asymptotically good sequences of ramp secret sharing schemes where a small amount of information leakage is allowed (and possibly also non-full recovery). By a non-constructive proof we demonstrate the existence of sequences that – following our definition of goodness – have parameters arbitrary close to the optimal ones. Moreover – still using our definition – we demonstrate how to concretely construct asymptotically good sequences of schemes from sequences of algebraic geometric codes related to a tower of function fields. Our study involves a detailed treatment of the relative generalized Hamming weights of the involved codes.
Type de document :
Communication dans un congrès
Pascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France. 2016, Proceedings of the 9th International Workshop on Coding and Cryptography 2015 WCC2015
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01275753
Contributeur : Jean-Pierre Tillich <>
Soumis le : jeudi 18 février 2016 - 10:03:47
Dernière modification le : mardi 24 avril 2018 - 16:16:02
Document(s) archivé(s) le : samedi 12 novembre 2016 - 23:14:50

Fichier

wcc15-mo3-3.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01275753, version 1

Collections

Citation

Olav Geil, Stefano Martin, Umberto Martínez-Peñas, Ryutaroh Matsumoto, Diego Ruano. On asymptotically good ramp secret sharing schemes. Pascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France. 2016, Proceedings of the 9th International Workshop on Coding and Cryptography 2015 WCC2015. 〈hal-01275753〉

Partager

Métriques

Consultations de la notice

28

Téléchargements de fichiers

39