Sciweavers

14824 search results - page 2958 / 2965
» Security - Introduction
Sort
View
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
ASIACRYPT
2011
Springer
13 years 10 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
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...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
ASIACRYPT
2011
Springer
13 years 10 months ago
Functional Encryption for Inner Product Predicates from Learning with Errors
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...
Shweta Agrawal, David Mandell Freeman, Vinod Vaiku...
DOCENG
2011
ACM
13 years 10 months ago
Contributions to the study of SMS spam filtering: new collection and results
The growth of mobile phone users has lead to a dramatic increasing of SMS spam messages. In practice, fighting mobile phone spam is difficult by several factors, including the lo...
Tiago A. Almeida, José María G&oacut...
IACR
2011
88views more  IACR 2011»
13 years 10 months ago
Storing Secrets on Continually Leaky Devices
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...
Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Da...
« Prev « First page 2958 / 2965 Last » Next »