Sciweavers

225 search results - page 7 / 45
» Nonperfect Secret Sharing Schemes
Sort
View
DCC
2006
IEEE
14 years 7 months ago
A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes
It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implic...
Mike J. Grannell, Terry S. Griggs, Anne Penfold St...
JCM
2007
82views more  JCM 2007»
13 years 7 months ago
Secret Sharing Schemes With General Access Structure Based On MSPs
— In this paper we introduce two operations of access structure to build large monotone span programs MSPs from small MSPs. Furthermore, we point out a new method of constructing...
Jun Xu, Xiaomin Zha
ICC
2007
IEEE
186views Communications» more  ICC 2007»
14 years 1 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
TIT
2008
147views more  TIT 2008»
13 years 7 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 27 days ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...