6 search results - page 1 / 2 » Vulnerability Bounds and Leakage Resilience of Blinded Crypt... |
CSFW
2010
IEEE
13 years 9 months ago
2010
IEEE
—We establish formal bounds for the number of min-entropy bits that can be extracted in a timing attack against a cryptosystem that is protected by blinding, the state-of-the art...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to â€...
CRYPTO
2010
Springer
13 years 1 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...