Sciweavers

15 search results - page 1 / 3
» asiacrypt 2011
Sort
View
ASIACRYPT
2011
Springer
13 years 10 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
ASIACRYPT
2011
Springer
13 years 10 months ago
Biclique Cryptanalysis of the Full AES
Since Rijndael was chosen as the Advanced Encryption Standard, improving upon 7-round attacks on the 128-bit key variant or upon 8-round attacks on the 192/256-bit key variants has...
Andrey Bogdanov, Dmitry Khovratovich, Christian Re...
ASIACRYPT
2011
Springer
13 years 10 months ago
Noiseless Database Privacy
Differential Privacy (DP) has emerged as a formal, flexible framework for privacy protection, with a guarantee that is agnostic to auxiliary information and that admits simple ru...
Raghav Bhaskar, Abhishek Bhowmick, Vipul Goyal, Sr...
ASIACRYPT
2011
Springer
13 years 10 months ago
Cryptanalysis of ARMADILLO2
ARMADILLO2 is the recommended variant of a multi-purpose cryptographic primitive dedicated to hardware which has been proposed by Badel et al. in [1]. In this paper we propose a me...
Mohamed Ahmed Abdelraheem, Céline Blondeau,...
ASIACRYPT
2011
Springer
13 years 10 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