Sciweavers

268 search results - page 17 / 54
» An Analysis of Bitstate Hashing
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
FGCN
2007
IEEE
113views Communications» more  FGCN 2007»
14 years 2 months ago
Improving Disk Sector Integrity Using 3-dimension Hashing Scheme
To keep the evidence that a stored hard disk does not modify its content, the intuitive scheme is to calculate a hash value of the data in all the sectors in a specific order. Ho...
Zoe L. Jiang, Lucas Chi Kwong Hui, K. P. Chow, Siu...
EUROCRYPT
2008
Springer
13 years 9 months ago
Security/Efficiency Tradeoffs for Permutation-Based Hashing
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
Phillip Rogaway, John P. Steinberger
MEDIAFORENSICS
2010
13 years 9 months ago
Forensic hash for multimedia information
Digital multimedia such as images and videos are prevalent on today's internet and cause significant social impact, which can be evidenced by the proliferation of social netw...
Wenjun Lu, Avinash L. Varna, Min Wu
ISCC
2006
IEEE
104views Communications» more  ISCC 2006»
14 years 1 months ago
Stable High-Capacity One-Hop Distributed Hash Tables
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
John Risson, Aaron Harwood, Tim Moors