Results 221 to 230 of about 65,979 (233)

Foundations of security for hash chains in ad hoc networks

23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings., 2004
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have very limited memory. Authentication is a significant challenge in ad hoc networks, even without considering size and power constraints.
Phillip G. Bradford, Olga V. Gavrylyako
openaire   +2 more sources

Hash table collision resolution with direct chaining

Journal of Algorithms, 1989
Abstract The hash table method called direct chaining, wherein chains of items with the same hash function value are kept in a single table without recourse to an index table or a separate overflow area, is described. An explicitly linked free-space list is used which allows arbitrary insertion and deletion sequences to be done indefinitely with no ...
Pilar de la Torre, Gary D. Knott
openaire   +2 more sources

A Novel Self-Renewal Hash Chain and Its Implementation

2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, 2008
Hash chains are widely used for entity authentication or data-origin authentication. However, finite length of a hash chain limits its implementations. A new kind of hash chain, called self-renewable hash chain (SRHC) is proposed, which achieves a hash chain self-renewing or re-initialization smoothly, securely throughout its usage.
Xiaoxue Li, Rui Ren, Haojun Zhang
openaire   +2 more sources

A novel hash chain construction for simple and efficient authentication

2016 14th Annual Conference on Privacy, Security and Trust (PST), 2016
These years Internet of Things (IoT) has been paid much attention to and the importance of lightweight and efficient authentication protocols has been increasing. In this paper, we propose a novel and flexible hash chain construction, hash chain aggregation (HCA), and a scheme to establish a common key for two users using HCA.
Masakazu Soshi, Yuta Kurihara
openaire   +2 more sources

A Study on Hash Chain-Based Hadoop Security Scheme

2015 IEEE 12th Intl Conf on Ubiquitous Intelligence and Computing and 2015 IEEE 12th Intl Conf on Autonomic and Trusted Computing and 2015 IEEE 15th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom), 2015
Hadoop is one of well-known "Big Data" frameworks studied widely and used by major vendors such as Yahoo! and Facebook. However current version of Hadoop Framework has a number of security vulnerabilities in its architecture and also in its implementation.
Si-Jae Woo, Sang-Soo Yeo, Young-Ae Jung
openaire   +1 more source

Improved Scalable Hash Chain Traversal

2003
Yaron Sella recently proposed a scalable version of Jakobsson’s algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and \(b=\sqrt[k]{n}\)), Sella’s algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b-1).
openaire   +2 more sources

Hash chain based strong password authentication scheme

2016 13th International Bhurban Conference on Applied Sciences and Technology (IBCAST), 2016
The constant influence of passwords over all other methods of identity authentication is a key discomfiture to security examiners. Web technologies are gaining more and more fame day by day but the persistent survival and replication of password authentication schemes generate difficulties for end users.
Muhammad Shahzad Jan, Mehreen Afzal
openaire   +2 more sources

Evaluation of Associative Memory Using Parallel Chained Hashing

IEEE Transactions on Computers, 1984
Two parallel hashing algorithms based on open and chained hashing are discussed. The parallel chained hashing algorithm is efficient even in the environment where deletion and insertion frequently occur. The chained hashing memory with fewer memory banks has a performance equivalent to that of the open hashing memory.
Hiraki, Shimada, Nishida
openaire   +2 more sources

Weighted One-Way Hash Chain and Its Applications

2000
An one-way hash chain generated by the iterative use of a one-way hash function on a secret value has recently been widely employed to develop many practical cryptographic solutions, especially electronic micropayment schemes. In this paper, we propose a new concept called a weighted one-way hash chain. We then proceed to use the new concept to improve
Sung-Ming Yen, Yuliang Zheng
openaire   +2 more sources

Scalable Hash Chain Traversal for Mobile Devices

2005
Yaron Sella recently proposed a scalable version of Jakobsson's algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and (b = $\sqrt[k]{n}$)), Sella's algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b–1).
openaire   +2 more sources