70 search results - page 1 / 14 » An Improved Security Bound for HCTR |
FSE
2008
Springer
13 years 6 months ago
2008
Springer
HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the au...
FSE
2006
Springer
13 years 8 months ago
2006
Springer
We present PEP, which is a new construction of a tweakable strong pseudo-random permutation. PEP uses a hash-encrypt-hash approach which has recently been used in the construction...
ACSAC
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper we describe a new class of tools for protecting computer systems from security attacks. Their distinguished feature is the principle they are based on. Host or netwo...
RFIDSEC
2010
13 years 3 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
TIT
2008
13 years 4 months ago
2008
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...