Sciweavers

1089 search results - page 118 / 218
» Randomness and Reducibility
Sort
View
ECCC
2011
207views ECommerce» more  ECCC 2011»
13 years 5 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
EUROCRYPT
2009
Springer
14 years 10 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
GLOBECOM
2008
IEEE
14 years 4 months ago
A Dynamic Load-Balanced Hashing Scheme for Networking Applications
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
N. Sertac Artan, Haowei Yuan, H. Jonathan Chao
ICDCS
2008
IEEE
14 years 4 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
ICHIT
2009
Springer
14 years 4 months ago
An improved camera identification method based on the texture complexity and the image restoration
The identification of source camera is useful to improve the capability of evidence in the digital image such as distinguish the photographer taking illegal images and adopting di...
Kazuya Matsushita, Hitoshi Kitazawa