124 search results - page 3 / 25 » A generalization of weight polynomials to matroids |
FFA
2007
13 years 5 months ago
2007
TCC
2010
Springer
14 years 2 months ago
2010
Springer
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...
TIT
2008
13 years 5 months ago
2008
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...
EUROCRYPT
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
WINE
2009
Springer
14 years 11 days ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...