Paper Info
Title
Complexity of universal access structures
Abstract
An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which there are one or more participants in every possible Boolean combination of the minimal qualified sets. Every access structure is a substructure of the universal structure for the same number of minimal qualified subsets, thus universal access structures have the highest complexity given the number of minimal qualified sets. We show that the complexity of the universal structure with n minimal qualified sets is between n/log"2n and n/2.7182... asymptotically.
Year
DOI
Venue
2012
10.1016/j.ipl.2011.10.022
IACR Cryptology ePrint Archive
Keywords
DocType
Volume
minimal qualified set,highest complexity,universal structure,minimal qualified subsets,important parameter,richest possible structure,n minimal qualified set,universal access structure,possible boolean combination,access structure,secret sharing,complexity,cryptography,harmonic series
Journal
112
Issue
ISSN
Citations 
4
Information Processing Letters, Volume 112 Issue 4, February, 2012, Pages 149-152
0
PageRank 
References 
Authors
0.34
4
1
Name
Order
Citations
PageRank
László Csirmaz116315.86