Sciweavers

4438 search results - page 11 / 888
» On the Distribution of Keys by Hashing
Sort
View
JOC
1998
135views more  JOC 1998»
14 years 11 months ago
Attacks on Fast Double Block Length Hash Functions
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
Lars R. Knudsen, Xuejia Lai, Bart Preneel
ADHOCNETS
2009
Springer
15 years 6 months ago
DHT-Based Detection of Node Clone in Wireless Sensor Networks
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
Zhijun Li, Guang Gong
IPL
2006
110views more  IPL 2006»
14 years 11 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
MOBIHOC
2005
ACM
15 years 11 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 2 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...