24 search results - page 3 / 5 » Practical leakage-resilient pseudorandom generators |
CRYPTO
1998
Springer
13 years 11 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
ICITS
2009
13 years 5 months ago
2009
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
IACR
2011
12 years 7 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
CARDIS
2008
Springer
13 years 9 months ago
2008
Springer
The mifare Classic is the most widely used contactless smart card in the market. Its design and implementation details are kept secret by its manufacturer. This paper studies the a...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...