A secret sharing scheme based on exponentiation in Galois fields
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10045/25296
Title: | A secret sharing scheme based on exponentiation in Galois fields |
---|---|
Authors: | Gallardo Calero, Clara M. | Tortosa, Leandro | Vicent, Jose F. | Zamora, Antonio |
Research Group/s: | Criptología y Seguridad Computacional |
Center, Department or Service: | Universidad de Alicante. Departamento de Ciencia de la Computación e Inteligencia Artificial |
Keywords: | Computer security | Cryptography | Public-key cryptography | Threshold schemes | Prepositioned secret sharing |
Knowledge Area: | Ciencia de la Computación e Inteligencia Artificial |
Issue Date: | 2008 |
Publisher: | University Press |
Citation: | GALLARDO, Clara M., et al. "A secret sharing scheme based on exponentiation in Galois fields". International Journal of Applied Mathematics and Informatics. Issue 2, Vol. 2 (2008). ISSN 2074-1278, pp. 57-66 |
Abstract: | To provide more efficient and flexible alternatives for the applications of secret sharing schemes, this paper describes a threshold sharing scheme based on exponentiation of matrices in Galois fields. A significant characteristic of the proposed scheme is that each participant has to keep only one master secret share which can be used to reconstruct different group secrets according to the number of threshold values. |
Sponsor: | This work was partially supported by the Spanish grants GVPRE/2008/363. |
URI: | http://hdl.handle.net/10045/25296 |
ISSN: | 2074-1278 |
Language: | eng |
Type: | info:eu-repo/semantics/article |
Peer Review: | si |
Publisher version: | http://www.universitypress.org.uk/journals/ami/ |
Appears in Collections: | INV - CSC - Artículos de Revistas INV - ANVIDA - Artículos de Revistas |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2008_Gallardo_etal_IJAMI.pdf | Acceso restringido | 427,12 kB | Adobe PDF | Open Request a copy |
Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.