15 search results - page 2 / 3 » Limits on the Efficiency of One-Way Permutation-Based Hash F... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
IJSNET
2006
14 years 9 months ago
2006
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
156
click to vote
GIS
2009
ACM
15 years 10 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
165
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...