208 search results - page 8 / 42 » Variationally universal hashing |
101
click to vote
INDOCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
102
click to vote
ESORICS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Identity fraud (IDF) may be defined as unauthorized exploitation of credential information through the use of false identity. We propose CROO, a universal (i.e. generic) ...
92
Voted
STOC
2003
ACM
16 years 9 hour ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
SPDP
1993
IEEE
15 years 3 months ago
1993
IEEE
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
CTRSA
2006
Springer
15 years 3 months ago
2006
Springer
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...