Sciweavers

109 search results - page 20 / 22
» Analysis of All-or-Nothing Hash Functions
Sort
View
CASES
2003
ACM
15 years 2 months ago
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis
Recent research in sensor networks has raised issues of security for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices...
Ramnath Venugopalan, Prasanth Ganesan, Pushkin Ped...
FSE
2003
Springer
134views Cryptology» more  FSE 2003»
15 years 2 months ago
A New Class of Collision Attacks and Its Application to DES
Until now in cryptography the term collision was mainly associated with the surjective mapping of different inputs to an equal output of a hash function. Previous collision attack...
Kai Schramm, Thomas J. Wollinger, Christof Paar
85
Voted
SIGCOMM
2006
ACM
15 years 3 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
INFOCOM
2006
IEEE
15 years 3 months ago
Improving Lookup Performance Over a Widely-Deployed DHT
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
Daniel Stutzbach, Reza Rejaie
MONET
2010
125views more  MONET 2010»
14 years 7 months ago
GTPP: General Truncated Pyramid Peer-to-Peer Architecture over Structured DHT Networks
— Hierarchical Distributed Hash Table (DHT) architectures have been among the most interesting research topics since the birth of flat DHT architecture. However, most of the prev...
Zhonghong Ou, Erkki Harjula, Timo Koskela, Mika Yl...