Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SCN
2008
Springer

favoriteEmaildiscussreport

128views Communications» more SCN 2008»

On Linear Secret Sharing for Connectivity in Directed Graphs

13 years 4 months ago

On Linear Secret Sharing for Connectivity in Directed Graphs

Download www.cs.bgu.ac.il

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

Real-time Traffic

Communications | Complete Directed Graph | Linear Secret Sharing | SCN 2008 | Secret Sharing Scheme |

claim paper

Related Content

» Secret Sharing Schemes for Very Dense Graphs

» On Codes Matroids and Secure Multiparty Computation from Linear Secret Sharing Schemes

» On Codes Matroids and Secure Multiparty Computation From Linear SecretSharing Schemes

» Ideal Hierarchical Secret Sharing Schemes

» Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

» On the complexity of verifiable secret sharing and multiparty computation

» Characterizing Ideal Weighted Threshold Secret Sharing

» Fast and scalable secret key generation exploiting channel phase randomness in wireless ne...

» A Comparison of Cartesian Genetic Programming and Linear Genetic Programming

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SCN
Authors	Amos Beimel, Anat Paskin

Comments (0)