Results 21 to 30 of about 77,066 (262)
Fast and simple constant-time hashing to the BLS12-381 elliptic curve
Pairing-friendly elliptic curves in the Barreto-Lynn-Scott family are seeing a resurgence in popularity because of the recent result of Kim and Barbulescu that improves attacks against other pairing-friendly curve families.
Riad S. Wahby, Dan Boneh
doaj +1 more source
Blockchain Technology in Advertising Campaigns
The article is devoted to the peculiarities of blockchain technology in terms of its application in the economy. The emphasis is on the impact of this technology on the advertising market.
A. A. Efremov +2 more
doaj +1 more source
Unsupervised Deep Hashing for Large-scale Visual Search [PDF]
Learning based hashing plays a pivotal role in large-scale visual search. However, most existing hashing algorithms tend to learn shallow models that do not seek representative binary codes.
Feng, Xiaoyi +3 more
core +2 more sources
HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS
A new hashing algorithm based on dynamic chaos is proposed. Owing to the use of chaotic mappings, this algorithm is irreversible and a search for two messages with identical hash-values becomes computationally difficult.
A. V. Sidorenko, I. V. Shakinko
doaj +1 more source
Data privacy regulations like the EU GDPR allow the use of hashing techniques to anonymize data that may contain personal information. However, cryptographic hashing is well-known to destroy any possibility of performing analytics.
Abdelrahman Almahmoud +2 more
doaj +1 more source
Secure Medical Blockchain Model
The Internet of Medical Things (IoMT) uses wireless networks to help patients to communicate with healthcare professionals. Therefore, IoMT devices suffer from a lack of security controls, just like many Internet of Things (IoT) gadgets.
Ibrahim Shawky Farahat +4 more
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
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
Image Hashing for Tamper Detection with Multiview Embedding and Perceptual Saliency
Perceptual hashing technique for tamper detection has been intensively investigated owing to the speed and memory efficiency. Recent researches have shown that leveraging supervised information could lead to learn a high-quality hashing code.
Ling Du, Zhen Chen, Yongzhen Ke
doaj +1 more source
Image hashing-based authentication methods have been widely studied with continuous advancements owing to the speed and memory efficiency. However, reference hash generation and threshold setting, which are used for similarity measures between original ...
Ling Du +4 more
doaj +1 more source

