406 search results - page 31 / 82 » Pseudorandomness and Combinatorial Constructions |
97
Voted
DCC
2008
IEEE
16 years 6 days ago
2008
IEEE
Let k, v, t be integers such that k v t 2. A perfect hash family PHF(N; k, v, t) can be defined as an N ? k array with entries from a set of v symbols such that every N ?t suba...
100
click to vote
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
103
click to vote
ITP
2010
15 years 4 months ago
2010
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
88
Voted
IEEEARES
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider a network of remote agent platforms that are tested by roaming spy agents in order to identify those that are malicious, based on the outcome of each agent. It is show...
107
Voted
COMBINATORICS
2004
15 years 14 days ago
2004
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...