713 search results - page 80 / 143 » Dispersing Hash Functions |
FSE
2005
Springer
15 years 3 months ago
2005
Springer
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
ACSC
2001
IEEE
15 years 1 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
FSE
2008
Springer
14 years 11 months ago
2008
Springer
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and...