SCN
2008
Springer
14 years 11 days ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...