Results 61 to 70 of about 442,051 (179)
Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications
Recently, many efficient cryptographic hash function design strategies have been explored, not least because of the SHA-3 competition. These designs are, almost exclusively, geared towards high performance on long inputs.
Stefan Kölbl +3 more
doaj +1 more source
Applying postquantum cryptography to the smart city network to provide protection against the future quantum computer threats. ABSTRACT Smart cities are built on a vast interconnected network of Internet of things (IoT), edge and cloud systems to optimise urban services and enhance the quality of life for the residents.
Ahmed Alrowaili +3 more
wiley +1 more source
On stabilizers in finite permutation groups
Abstract Let G$G$ be a permutation group on the finite set Ω$\Omega$. We prove various results about partitions of Ω$\Omega$ whose stabilizers have good properties. In particular, in every solvable permutation group there is a set‐stabilizer whose orbits have length at most 6, which is best possible and answers two questions of Babai.
Luca Sabatini
wiley +1 more source
Clinical Judgment to Recognize Acute Brain Ischemia in the Emergency Department
Background Despite the development of scale‐based stroke recognition tools, the accuracy of clinical judgment to detect acute ischemic stroke (AIS) and transient ischemic attack (TIA) is unknown. This study evaluated the real‐world accuracy of stroke physicians′ assessment in AIS/TIA detection before imaging compared with Recognition of Stroke in the ...
Max Bieder +10 more
wiley +1 more source
On the security risk of pre-image attack on cancelable biometrics
Over the years, a number of biometric template protection schemes, often based on the notion of “cancelable biometrics”, have been proposed. An ideal cancelable biometric algorithm complies with four criteria: irreversibility, revocability, unlinkability,
Xingbo Dong +5 more
doaj +1 more source
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
We provide a survey about generic attacks on cryptographic hash constructions including hash-based message authentication codes and hash combiners. We look into attacks involving iteratively evaluating identical mappings many times.
Zhenzhen Bao, Jian Guo, Lei Wang
doaj +1 more source
Vehicular ad hoc networks (VANETs) enable secure vehicle‐to‐vehicle (V2V) and vehicle‐to‐infrastructure (V2I) communications but still rely heavily on centralized trusted authorities, creating scalability limitations, single‐point failures, and increased authentication latency.
Adi El-Dalahmeh +3 more
wiley +1 more source
The rapid expansion of the Industrial Internet of Things (IIoT) presents pressing challenges for secure, efficient, and privacy‐preserving communication among users, sensors, and cloud infrastructures. Existing lightweight authentication schemes, primarily based on classical cryptographic assumptions, are increasingly vulnerable to the emerging threat ...
Tinashe Magara +2 more
wiley +1 more source
The sharing of personal health records (PHRs) benefits healthcare by improving disease diagnosis, treatment, and early outbreak detection. However, outsourcing PHRs for storage exposes data to risks such as tampering and unauthorized access. Ensuring the security of PHRs is crucial, especially when shared via third‐party servers. A secure sharing model
Eric Affum +3 more
wiley +1 more source
Preimage Attack on Hashing with Polynomials proposed at ICISC\u2706 [PDF]
In this paper, we suggest a preimage attack on Hashing with Polynomials \cite{Shpilrain06b}. The algorithm has $n$-bit hash output and $n$-bit intermediate state. (for example, $n=163$).
Donghoon Chang
core +1 more source

