Sciweavers

Share
SCN
2008
Springer

On Linear Secret Sharing for Connectivity in Directed Graphs

11 years 9 months ago
On Linear Secret Sharing for Connectivity in Directed Graphs
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 parties (i.e., edges) can reconstruct the secret if it contains a path from node s to node t. We prove that in every linear secret sharing scheme realizing the st-con function on
Amos Beimel, Anat Paskin
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SCN
Authors Amos Beimel, Anat Paskin
Comments (0)
books