Sciweavers

380 search results - page 7 / 76
» Intrusion-Resilient Secret Sharing
Sort
View
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 8 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— 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 ...
Sirin Nitinawarat, Prakash Narayan
IJNSEC
2006
111views more  IJNSEC 2006»
14 years 9 months ago
Ideal Secret Sharing Schemes from Permutations
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...
Josef Pieprzyk, Xian-Mo Zhang
SCN
2008
Springer
128views Communications» more  SCN 2008»
14 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 partie...
Amos Beimel, Anat Paskin
IJISEC
2002
58views more  IJISEC 2002»
14 years 9 months ago
A complete characterization of a family of key exchange protocols
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...
Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
ICISC
2008
88views Cryptology» more  ICISC 2008»
14 years 11 months ago
Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images
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 ...
Miyuki Uno, Mikio Kano