The accessibility of an access structure

Francesc Carreras; Antonio Magaña; Carlo Munuera

RAIRO - Theoretical Informatics and Applications (2006)

  • Volume: 40, Issue: 4, page 559-567
  • ISSN: 0988-3754

Abstract

top
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.

How to cite

top

Carreras, Francesc, Magaña, Antonio, and Munuera, Carlo. "The accessibility of an access structure." RAIRO - Theoretical Informatics and Applications 40.4 (2006): 559-567. <http://eudml.org/doc/249621>.

@article{Carreras2006,
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. },
author = {Carreras, Francesc, Magaña, Antonio, Munuera, Carlo},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Cryptography; secret sharing schemes; access structures.; cryptography; access structures},
language = {eng},
month = {11},
number = {4},
pages = {559-567},
publisher = {EDP Sciences},
title = {The accessibility of an access structure},
url = {http://eudml.org/doc/249621},
volume = {40},
year = {2006},
}

TY - JOUR
AU - Carreras, Francesc
AU - Magaña, Antonio
AU - Munuera, Carlo
TI - The accessibility of an access structure
JO - RAIRO - Theoretical Informatics and Applications
DA - 2006/11//
PB - EDP Sciences
VL - 40
IS - 4
SP - 559
EP - 567
AB - 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.
LA - eng
KW - Cryptography; secret sharing schemes; access structures.; cryptography; access structures
UR - http://eudml.org/doc/249621
ER -

References

top
  1. G. Ateniese, C. Blundo, A. De Santis and D. Stinson, Extended Capabilities for visual cryptography. Theoretical Comput. Sci.250 (2001) 143–162.  
  2. G.R. Blakley, Safeguarding cryptographic keys. AFIPS Conference Proceedings48 (1979) 313–317.  
  3. A. Shamir, How to share a secret. Commun. ACM, 22 (1979) 612–613.  
  4. D.R. Stinson, Cryptography: Theory and Practice. CRC Press (1995).  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.