On secret sharing schemes, matroids and polymatroids
Visualitza/Obre
JMC.2010.pdf (398,5Kb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/11444
Tipus de documentArticle
Data publicació2010-10
Condicions d'accésAccés restringit per política de l'editorial
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem
in secret sharing. We explore in this paper the connections of this open problem with
matroids and polymatroids.
Matroid ports were introduced by Lehman in 1964. A forbidden minor characterization
of matroid ports was given by Seymour in 1976. These results precede the invention of
secret sharing by Shamir in 1979. Important connections between ideal secret sharing
schemes and matroids were discovered by Brickell and Davenport in 1991. Their results
can be restated as follows: every ideal secret sharing scheme defines a matroid, and its access structure is a port of that matroid.
Our main result is a lower bound on the optimal complexity of access structures that
are not matroid ports. Namely, by using the aforementioned characterization of matroid
ports by Seymour, we generalize the result by Brickell and Davenport by proving that,
if the length of every share in a secret sharing scheme is less than 3/2 times the length of the secret, then its access structure is a matroid port. This generalizes and explains a phenomenon that was observed in several families of access structures.
In addition, we introduce a new parameter to represent the best lower bound on the
optimal complexity that can be obtained by taking into account that the joint Shannon
entropies of a set of random variables define a polymatroid. We prove that every bound that is obtained by this technique for an access structure applies to its dual as well.
Finally, we present a construction of linear secret sharing schemes for the ports of the
Vamos and the non-Desargues matroids. In this way new upper bounds on their optimal
complexity are obtained, which are a contribution on the search of access structures whose optimal complexity lies between 1 and 3/2.
CitacióMartí-Farré, J.; Padró, C. On secret sharing schemes, matroids and polymatroids. "Journal of mathematical cryptology", Octubre 2010, vol. 4, núm. 2, p. 95-120.
ISSN1862-2976
Versió de l'editorhttp://www.reference-global.com/doi/abs/10.1515/JMC.2010.004
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
JMC.2010.pdf | 398,5Kb | Accés restringit |