Natural Generalizations of Threshold Secret Sharing
| Autor: | Oriol Farràs, An Yang, Chaoping Xing, Carles Padró |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
| Rok vydání: | 2014 |
| Předmět: |
Homomorphic secret sharing
Theoretical computer science integer polymatroids Cryptography Matemàtiques i estadística::Anàlisi matemàtica::Funcions especials [Àrees temàtiques de la UPC] Library and Information Sciences Polynomials Secret sharing Integer Computer Science::Cryptography and Security Mathematics Discrete mathematics 26 Real functions::26C Polynomials rational functions [Classificació AMS] Ideal (set theory) business.industry multipartite secret sharing Computer Science Applications Shamir's Secret Sharing ideal secret sharing schemes secret sharing Secure multi-party computation Polinomis Verifiable secret sharing business Information Systems |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Recercat. Dipósit de la Recerca de Catalunya instname |
| ISSN: | 1557-9654 0018-9448 |
| Popis: | © 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. 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|