Hostname: page-component-848d4c4894-4rdrl Total loading time: 0 Render date: 2024-06-25T14:49:19.985Z Has data issue: false hasContentIssue false

The accessibility of an access structure

Published online by Cambridge University Press:  08 November 2006

Francesc Carreras
Affiliation:
Polytechnic University of Catalonia, Dept. of Applied Mathematics II, School of Industrial Engineering of Terrassa, C. Colón 11, 08222 Terrassa, Barcelona, Spain; francesc.carreras@upc.edu; antonio.magana@upc.edu
Antonio Magaña
Affiliation:
Polytechnic University of Catalonia, Dept. of Applied Mathematics II, School of Industrial Engineering of Terrassa, C. Colón 11, 08222 Terrassa, Barcelona, Spain; francesc.carreras@upc.edu; antonio.magana@upc.edu
Carlo Munuera
Affiliation:
University of Valladolid, Dept. of Applied Mathematics, Avda Salamanca SN, 47014 Valladolid, Castilla, Spain; cmunuera@modulor.arq.uva.es
Get access

Abstract

In secret sharing, different access structures have different difficulty degrees for acceding to the secret. We give a numerical measure of how easy or how difficult is to recover the secret, depending only on the structure itself and not on the particular scheme used for realizing it. We derive some consequences.

Type
Research Article
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ateniese, G., Blundo, C., De Santis, A. and Stinson, D., Extended Capabilities for visual cryptography. Theoretical Comput. Sci. 250 (2001) 143162. CrossRef
Blakley, G.R., Safeguarding cryptographic keys. AFIPS Conference Proceedings 48 (1979) 313317.
A. Shamir, How to share a secret. Commun. ACM, 22 (1979) 612–613.
D.R. Stinson, Cryptography: Theory and Practice. CRC Press (1995).