658 search results - page 31 / 132 » The Grindahl Hash Functions |
153
click to vote
TCC
2012
Springer
13 years 8 months ago
2012
Springer
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
108
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
109
click to vote
CCS
2008
ACM
15 years 2 months ago
2008
ACM
We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal...
95
Voted
SOFSEM
2009
Springer
15 years 9 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
107
Voted
DCC
2007
IEEE
16 years 7 days ago
2007
IEEE
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...