12 search results - page 2 / 3 » Leakage-Resilient Cryptography |
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
A fundamental question in leakage-resilient cryptography is: can leakage resilience always be amplified by parallel repetition? It is natural to expect that if we have a leakage-r...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
A weak pseudorandom function (wPRF) is a cryptographic primitive similar to ? but weaker than ? a pseudorandom function: for wPRFs one only requires that the output is pseudorandom...
CHES
2010
Springer
13 years 6 months ago
2010
Springer
The power of side-channel leakage attacks on cryptographic implementations is evident. Today's practical defenses are typically attack-specific countermeasures against certain...
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...
TCC
2010
Springer
14 years 2 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 â€...