36 search results - page 1 / 8 » Secret Sharing Schemes for Very Dense Graphs |
CRYPTO
2012
Springer
11 years 6 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
SCN
2008
Springer
13 years 4 months 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...
JDCTA
2010
12 years 11 months ago
2010
In visual cryptography, the secret can be any written text, graphical representation, or picture. This technique, some time called visual secret sharing (VSS), allows visual infor...
ASIACRYPT
1992
Springer
13 years 8 months ago
1992
Springer
: Nonperfect secret sharing schemes NSSs have an advantage such that the size of shares can be shorter than that of perfect secret sharing schemes. This paper shows some basic prop...
CORR
2002
Springer
13 years 4 months ago
2002
Springer