259
click to vote
ASIACRYPT
2011
Springer
14 years 7 months ago
2011
Springer
We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the learning with errors (LWE) problem. This co...
229
click to vote
ASIACRYPT
2011
Springer
14 years 7 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
226
click to vote
ASIACRYPT
2011
Springer
14 years 7 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
341
click to vote
ASIACRYPT
2011
Springer
14 years 7 months ago
2011
Springer
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...
227
click to vote
ASIACRYPT
2011
Springer
14 years 7 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...