Results 191 to 200 of about 6,906 (225)

Fast Verification of Hash Chains with Reduced Storage

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
A hash chain H for a hash function hash(·) is a sequence of hash values , where x0 is a secret value, xi is generated by xi = hash(xi-1) for 1≤ i ≤ n, and xn is a public value. Hash values of H are disclosed gradually from xn-1 to x0. The correctness of a disclosed hash value xi can be verified by checking the equation $x_n \\stackrel{?}{=} \\hash^{n ...
Dea Hyun Yum, Jin Seok Kim, Lee, PJ, Hong, SJ   +3 more
openaire   +3 more sources

Self-Updating Hash Chains and Their Implementations

2006
Hash Chains are widely used in various cryptography applications such as one-time passwords, server-supported signatures and micropayments etc. However, the finite length (‘limited-link') of hash chains limits their applications. Some methods of re-initializing hash chains or infinite hash chains introduced in literatures are inefficient and un-smooth.
Yuefei Zhu, Haojun Zhang
openaire   +2 more sources

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

A New Self-Updating Hash Chain Structure Scheme

2009 International Conference on Computational Intelligence and Security, 2009
Self-Updating Hash Chain can be used extensively in many fields, such as one time password(OTP), signatures and authentication etc. In this paper, we propose a new self-updating hash chain based linear partition-combination algorithm (LPCA), which can share data into m parts and any part can’ t leak any information of data s. At a each exchange process,
Min-Qing Zhang, Xiao-Yuan Yang, Bin Dong
openaire   +2 more sources

Right Transfer Method Based on Double HASH Chain

Applied Mechanics and Materials, 2014
This Paper analyzes security issues during the process of the right transfer, sums up the basic needs during the transfer and the defects of existing rights transfer, and puts forward the right transfer program based on double HASH chain, which achieves the transfer of the digital right under the control of HASH Distance and meta-rights.
Ping Zhu, Mu Yao Lu
openaire   +2 more sources