Mostra el registre d'ítem simple
Natural generalizations of threshold secret sharing
| dc.contributor.author | Farràs Ventura, Oriol |
| dc.contributor.author | Padró Laimon, Carles |
| dc.contributor.author | Xing, Chaoping |
| dc.contributor.author | Yang, An |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
| dc.date.accessioned | 2017-01-25T10:11:40Z |
| dc.date.available | 2017-01-25T10:11:40Z |
| dc.date.issued | 2014-01-14 |
| dc.identifier.citation | Farràs Ventura, O., Padro, C., Xing, C., Yang, A. Natural generalizations of threshold secret sharing. "IEEE transactions on information theory", 14 Gener 2014, vol. 60, núm. 3, p. 1652-1664. |
| dc.identifier.issn | 0018-9448 |
| dc.identifier.uri | http://hdl.handle.net/2117/100003 |
| dc.description | © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| dc.description.abstract | We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit ideal linear secret sharing schemes over every large enough finite field, they can be described by a small number of parameters, and they have useful properties for the applications of secret sharing. The use of integer polymatroids makes it possible to find many new such families and it simplifies in great measure the proofs for the existence of ideal secret sharing schemes for them. |
| dc.format.extent | 13 p. |
| dc.language.iso | eng |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
| dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica::Funcions especials |
| dc.subject.lcsh | Polynomials |
| dc.subject.other | Cryptography |
| dc.subject.other | secret sharing |
| dc.subject.other | ideal secret sharing schemes |
| dc.subject.other | multipartite secret sharing |
| dc.subject.other | integer polymatroids |
| dc.title | Natural generalizations of threshold secret sharing |
| dc.type | Article |
| dc.subject.lemac | Polinomis |
| dc.contributor.group | Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
| dc.identifier.doi | 10.1109/TIT.2014.2300113 |
| dc.description.peerreviewed | Peer Reviewed |
| dc.subject.ams | Classificació AMS::26 Real functions::26C Polynomials, rational functions |
| dc.relation.publisherversion | http://ieeexplore.ieee.org |
| dc.rights.access | Open Access |
| local.identifier.drac | 18546515 |
| dc.description.version | Postprint (author's final draft) |
| local.citation.author | Farràs Ventura, O.; Padro, C.; Xing, C.; Yang, A. |
| local.citation.publicationName | IEEE transactions on information theory |
| local.citation.volume | 60 |
| local.citation.number | 3 |
| local.citation.startingPage | 1652 |
| local.citation.endingPage | 1664 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [48]
-
Articles de revista [3.267]