Accès chercheur

EEDIS Laboratory

Evolutionary Engineering


Distributed Information Systems

Réseaux et Communication

Sécurité et Multimédia

Ingénierie des Connaissances

Data Mining & Web Intelligent

Interopérabilité des Systèmes d’information
& Bases de données

Développement Orienté Service

A novel verifiable and unconditionally secure (m, t, n)-threshold multi-secret sharing scheme using overdetermined systems of linear equations over finite Galois fields

Auteurs: » FARAOUN Kamel Mohamed
Type : Revue Internationale
Nom du journal : International Journal of Information and Computer Security ISSN:
Volume : 11 Issue: 1 Pages: 61-82
Lien : »
Publié le : 01-01-2019

Threshold multi-secrets sharing schemes allow sharing a set of m secrets among n participants, while secrets can be revealed only if t or more participants collude. Although many multi-secret sharing schemes have been proposed, several improvements remain essential in order to cope with actual effectiveness and security requirements, including computational performances and compliance for large-scale data. In this paper, we present a novel multi-secrets (m, t, n)-threshold scheme using overdetermined systems of linear equations defined over finite Galois fields. The scheme provides unconditional security, linear sharing/reconstructing complexities and holds secure verifiability and t-consistence. By considering both secrets and shares as elements over finite Galois fields GF(2r), optimal and space-efficient representation is ensured compared to recent sharing schemes. In addition, the scheme provides â€¦

Tous droits réservés - © 2019 EEDIS Laboratory