Sciweavers

406 search results - page 31 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
DCC
2008
IEEE
14 years 10 months ago
Explicit constructions for perfect hash families
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...
Sosina Martirosyan, Tran van Trung
EUROCRYPT
2009
Springer
14 years 11 months ago
Order-Preserving Symmetric Encryption
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...
Alexandra Boldyreva, Nathan Chenette, Younho Lee, ...
ITP
2010
159views Mathematics» more  ITP 2010»
14 years 2 months ago
Programming Language Techniques for Cryptographic Proofs
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 ...
Gilles Barthe, Benjamin Grégoire, Santiago ...
IEEEARES
2008
IEEE
14 years 5 months ago
Using Non-adaptive Group Testing to Construct Spy Agent Routes
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...
Georgios Kalogridis, Chris J. Mitchell
COMBINATORICS
2004
76views more  COMBINATORICS 2004»
13 years 11 months ago
Geometrically Constructed Bases for Homology of Partition Lattices
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...
Anders Björner, Michelle L. Wachs