380 search results - page 7 / 76 » Intrusion-Resilient Secret Sharing |
102
click to vote
CORR
2010
Springer
15 years 12 days ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
110
click to vote
IJNSEC
2006
15 years 1 months ago
2006
The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restri...
115
Voted
SCN
2008
Springer
15 years 1 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...
IJISEC
2002
15 years 1 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
135
Voted
ICISC
2008
15 years 3 months ago
2008
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing ...