Results 201 to 210 of about 24,134 (254)

Two secure authentication protocols for mitigating vulnerabilities in IoD. [PDF]

Sci Rep
Safkhani M, Ghorbani Fard M.
europepmc   +1 more source

BAAR: A framework for blockchain-based anonymous and revocable user authentication scheme. [PDF]

PLoS One
Ahmed M, Ahmad A, Zeshan F, Akram S.
europepmc   +1 more source

Design and evaluation of a resilient IBN architecture: Integrating post-quantum cryptography with adaptive threat detection using machine learning. [PDF]

PLoS One
Roy KS, Singh S, Goswami H, Panchal S, Hassan SM.   +4 more
europepmc   +1 more source

A hybrid hash framework for post quantum secure zero knowledge identification. [PDF]

Sci Rep
Bhadane S, Gupta D, Deshmukh PV, Mishra N.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Pseudochaining in hash tables

Communications of the ACM, 1978
This paper presents pseudochaining as a new collision-resolution method. Pseudochaining is half way between open addressing and chaining. It owes its name to the fact that link fields are present in each cell of the hash table which permits “chaining” of the first overflow items in the table.
Constantine Halatsis, George Philokyprou
openaire   +2 more sources

Load Balancing Hashing in Geographic Hash Tables

IEEE Transactions on Parallel and Distributed Systems, 2012
In this paper, we address the problem of balancing the network traffic load when the data generated in a wireless sensor network is stored on the sensor node themselves, and accessed through querying a geographic hash table. Existing approaches allow balancing network load by changing the georouting protocol used to forward queries in the geographic ...
Renda Elena, Resta Giovanni, Santi Paolo
openaire   +2 more sources

Shifting Hash Table: An Efficient Hash Table with Delicate Summary

2019 IEEE Globecom Workshops (GC Wkshps), 2019
Hash tables have been broadly used in many security applications. These applications require fast query speed and high memory efficiency. However, the query speed degrades when hash collisions happen. The design goal of this paper is to achieve high load factor as well as fast query at the same time.
Jie Jiang 0008, Yibo Yan, Mengyu Zhang, Binchao Yin, Yumeng Jiang, Tong Yang 0003, Xiaoming Li 0001, Tengjiao Wang   +7 more
openaire   +1 more source

Hash in a flash: Hash tables for flash devices

2013 IEEE International Conference on Big Data, 2013
Conservative estimates place the amount of data expected to be created by mankind this year to exceed several thousand exabytes. Given the enormous data deluge, and in spite of recent advances in main memory capacities, there is a clear and present need to move beyond algorithms that assume in-core (main-memory) computation.
Tyler Clemons, S. M. Faisal, Shirish Tatikonda, Charu C. Aggarwal, Srinivasan Parthasarathy 0001   +4 more
openaire   +1 more source

Efficient Ordering of Hash Tables

SIAM Journal on Computing, 1979
We discuss the problem of hashing in a full or nearly full table using open addressing. A scheme for reordering the table as new elements are added is presented. Under the assumption of having a reasonable hash function sequence, it is shown that, even with a full table, only about 2.13 probes will be required, on the average, to access an element ...
Gaston H. Gonnet, J. Ian Munro
openaire   +2 more sources

Dynamic hash tables

Communications of the ACM, 1988
Linear hashing and spiral storage are two dynamic hashing schemes originally designed for external files. This paper shows how to adapt these two methods for hash tables stored in main memory. The necessary data structures and algorithms are described, the expected performance is analyzed mathematically, and actual execution times are obtained and ...
openaire   +1 more source