713 search results - page 66 / 143 » Dispersing Hash Functions |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
ASAP
2010
IEEE
14 years 10 months ago
2010
IEEE
Many applications require protection of secret or sensitive information, from sensor nodes and embedded applications to large distributed systems. The confidentiality of data can b...
ICISC
2007
14 years 11 months ago
2007
The starting point for collision attacks on practical hash functions is a local collision. In this paper, we make a systematic study of local collisions for the SHA-2 family. The p...
CRYPTO
2010
Springer
14 years 7 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
APWEB
2005
Springer
15 years 3 months ago
2005
Springer
Recently, the issues of how to define functional dependencies (XFDs) and multivalued dependencies (XMVDs) in XML have been investigated. In this paper we consider the problem of ...