Sciweavers

76 search results - page 16 / 16
» Confirmer Signature Schemes Secure against Adaptive Adversar...
Sort
View
ASIACRYPT
2011
Springer
12 years 5 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer