397 search results - page 42 / 80 » Pseudorandom Functions and Lattices |
106
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
142
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
149
click to vote
ASIACRYPT
2011
Springer
14 years 1 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...
113
click to vote
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
103
click to vote
IJNSEC
2008
15 years 1 months ago
2008
In this paper, we investigate the issues in the analysis and design of provably secure message authentication codes (MACs) Nested MAC (NMAC) and Hash based MAC (HMAC) proposed by ...