Sciweavers

8 search results - page 1 / 2
» On Secret Sharing Schemes, Matroids and Polymatroids
Sort
View
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
13 years 11 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
TCC
2010
Springer
176views Cryptology» more  TCC 2010»
14 years 1 months ago
Ideal Hierarchical Secret Sharing Schemes
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
Oriol Farràs, Carles Padró
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
13 years 10 months 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 ...
TIT
2008
147views more  TIT 2008»
13 years 4 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 ...
ASIACRYPT
1992
Springer
13 years 9 months ago
Nonperfect Secret Sharing Schemes
: 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...
Wakaha Ogata, Kaoru Kurosawa, Shigeo Tsujii