2 citations · 2 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2019
Complexity of universal access structures
Laszlo Csirmaz
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, name…
cs.CR2013
Optimal information rate of secret sharing schemes on trees
L. Csirmaz, G. Tardos
The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is 1/(…