Results 31 to 40 of about 19,467 (229)
Double-Hashing Algorithm for Frequency Estimation in Data Streams
Frequency estimation of elements is an important task for summarizing data streams and machine learning applications. The problem is often addressed by using streaming algorithms with sublinear space data structures. These algorithms allow processing of large data while using limited data storage.
Nikita Seleznev+2 more
openalex +4 more sources
Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan+7 more
wiley +1 more source
The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728
This article makes an important contribution to solving the long-standing problem of whether all elliptic curves can be equipped with a hash function (indifferentiable from a random oracle) whose running time amounts to one exponentiation in the basic ...
Koshelev Dmitrii
doaj +1 more source
Fast and Powerful Hashing using Tabulation [PDF]
Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical.
Thorup, Mikkel
core +3 more sources
Assessing Blockchain Consensus and Security Mechanisms against the 51% Attack
The 51% attack is a technique which intends to fork a blockchain in order to conduct double-spending. Adversaries controlling more than half of the total hashing power of a network can perform this attack.
Sarwar Sayeed, Hector Marco-Gisbert
doaj +1 more source
BackgroundOver the past decade, the emergence of several large federated clinical data networks has enabled researchers to access data on millions of patients at dozens of health care organizations.
Yu, Yun William, Weber, Griffin M
doaj +1 more source
Approximately Minwise Independence with Twisted Tabulation [PDF]
A random hash function $h$ is $\varepsilon$-minwise if for any set $S$, $|S|=n$, and element $x\in S$, $\Pr[h(x)=\min h(S)]=(1\pm\varepsilon)/n$. Minwise hash functions with low bias $\varepsilon$ have widespread applications within similarity estimation.
A. Broder+6 more
core +1 more source
Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles [PDF]
PRO (Pseudorandom Oracle) is an important security of hash functions because it ensures that the PRO hash function inherits all properties of a random oracle in single stage games up to the PRO bound (e.g., collision resistant security, preimage resistant security and so on). In this paper, we propose new blockcipher-based double-length hash functions,
Yusuke Naito
openalex +3 more sources
Optimized Entanglement Purification [PDF]
We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is ...
Albert, Victor V.+2 more
core +2 more sources
Palm-Print Pattern Matching Based on Features Using Rabin-Karp for Person Identification
Palm-print based individual identification is regarded as an effectual method for identifying persons with high confidence. Palm-print with larger inner surface of hand contains many features such as principle lines, ridges, minutiae points, singular ...
S. Kanchana, G. Balakrishnan
doaj +1 more source