92 search results - page 5 / 19 » Generating Shorter Bases for Hard Random Lattices |
IACR
2011
13 years 9 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...
96
Voted
CTRSA
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. Multi-signatures allow multiple signers to jointly authenticate a message using a single compact signature. Many applications however require the public keys of the signe...
102
click to vote
SIAMCOMP
2012
12 years 12 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
PVLDB
2010
14 years 8 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
73
Voted
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...