132 search results - page 20 / 27 » Some Bounds and a Construction for Secure Broadcast Encrypti... |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
IACR
2011
12 years 8 months ago
2011
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
ISI
2007
Springer
13 years 8 months ago
2007
Springer
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...