Results 31 to 40 of about 2,384,026 (218)
An Efficient Two-Factor Authentication Scheme Based on the Merkle Tree
Sensors, 2020 The Time-based One-Time Password (TOTP) algorithm is commonly used for two-factor authentication. In this algorithm, a shared secret is used to derive a One-Time Password (OTP). However, in TOTP, the client and the server need to agree on a shared secret
Xinming Yin +5 more
doaj +1 more source
CHAIN: Exploring Global-Local Spatio-Temporal Information for Improved Self-Supervised Video Hashing [PDF]
, 2023 Compressing videos into binary codes can improve retrieval speed and reduce storage overhead. However, learning accurate hash codes for video retrieval can be challenging due to high local redundancy and complex global dependencies between video frames, especially in the absence of labels.
arxiv +1 more source
When Are Learned Models Better Than Hash Functions? [PDF]
arXiv, 2021 In this work, we aim to study when learned models are better hash functions, particular for hash-maps. We use lightweight piece-wise linear models to replace the hash functions as they have small inference times and are sufficiently general to capture complex distributions.
arxiv
Reliable, Secure, and Efficient Hardware Implementation of Password Manager System Using SRAM PUF
IEEE Access, 2021 Using Physical Unclonable Functions (PUFs) within the server-side has been recently proposed to address security vulnerabilities of the password (PW) authentication mechanism, including attacks on the database (DB) of user credentials.
Mohammad Mohammadinodoushan +4 more
doaj +1 more source
Data-Tracking in Blockchain Utilizing Hash Chain: A Study of Structured and Adaptive Process
SymmetryThis study presents a series of structured and adaptive processes aimed at tracking and verifying transactions recorded on the blockchain. Permissioned blockchains are employed across diverse enterprises for various purposes, including data recording ...
Sungbeen Kim, Dohoon Kim
semanticscholar +1 more source
, 2016 We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected ...
Knudsen, Mathias Bæk Tejs
core +1 more source
Novel self-renewal hash chain scheme based on (t,n) threshold and division tree
Tongxin xuebao, 2013 The introduction of renewal hash chain overcame resource-constrained defect in traditional hash chains,but the existing renewable schemes had still held unsatisfactory performance especially on security and complexity.The definitions of repetition ...
Hai-ping HUANG +4 more
doaj +2 more sources
Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains
Applied Sciences, 2021 Covert channels enable stealthy communications over innocent appearing carriers. They are increasingly applied in the network context. However, little work is available that exploits cryptographic primitives in the networking context to establish such ...
Jörg Keller, Steffen Wendzel
doaj +1 more source
JaxNet: Scalable Blockchain Network [PDF]
, 2020 Today's world is organized based on merit and value. A single global currency that's decentralized is needed for a global economy. Bitcoin is a partial solution to this need, however it suffers from scalability problems which prevent it from being mass ...
Emelyanenko, Taras +3 more
core +1 more source
ClaimChain: Improving the Security and Privacy of In-band Key Distribution for Messaging [PDF]
, 2018 The social demand for email end-to-end encryption is barely supported by mainstream service providers. Autocrypt is a new community-driven open specification for e-mail encryption that attempts to respond to this demand.
Chor Benny +13 more
core +2 more sources