Title
Secret sharing schemes with three or four minimal qualified subsets
Abstract
In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.
Year
DOI
Venue
2005
10.1007/s10623-003-4192-1
IACR Cryptology ePrint Archive
Keywords
DocType
Volume
minimal qualified subsets,ideal case,secret sharing scheme,access structure,non-ideal case,optimal information rate,cryptography,information rate
Journal
34
Issue
ISSN
Citations 
1
0925-1022
22
PageRank 
References 
Authors
0.96
14
2
Name
Order
Citations
PageRank
Jaume Martí-Farré1867.39
Carles Padró249032.23