Sciweavers

SCN
2008
Springer
128views Communications» more  SCN 2008»
13 years 11 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 partie...
Amos Beimel, Anat Paskin
COCOON
2005
Springer
14 years 4 months ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova