Results 51 to 60 of about 2,165 (141)
Corruption‐Correctable MACs via Combinatorial Group Testing and Erasure Correcting Codes
We have developed a corruption‐correctable message authentication code (CCMAC) that enables data integrity to be verified and corruptions of data to be corrected up to a certain threshold. As in a previous technique for identifying corrupted points, called corruption detectable MAC (CDMAC), the proposed scheme utilizes a system model composed of two ...
Isamu Furuya +3 more
wiley +1 more source
Analysis and improvement of an identity-based signature scheme from lattices
Liu et al proposed an identity-based signature from lattices in 2013,and proved that it can achieve strong un-forgeability in the standard model.Through analysis,the security proof of this scheme has some defect,and then show that the scheme cannot prove
ANGChun-li Y +4 more
doaj +2 more sources
MPC‐Facilitated Adaptive Security Framework for BFT Protocols
The growing use of blockchain and distributed systems requires Byzantine fault tolerant (BFT) protocols that remain secure under dynamic adversaries. However, existing BFT protocols often rely on static assumptions and lack clear mechanisms to detect and remove malicious or denial‐of‐service (DoS) nodes during execution.
Jie Niu, Baocang Wang, Qichun Wang
wiley +1 more source
This paper addresses the limitations of existing conditional privacy‐preserving authentication (CPPA) schemes in vehicular ad hoc networks (VANETs), which are either computationally heavy or vulnerable to quantum attacks. It proposes a multi‐aggregator lattice‐based CPPA (MA‐LCPPA) framework that distributes verification across multiple roadside units ...
Adi El‐Dalahmeh, Jie Li
wiley +1 more source
Strong Existential Unforgeability and BUFF Securities of MPC-in-the-Head Signatures [PDF]
NIST started the standardization of additional post-quantum signatures in 2022. Among 40 candidates, a few showed stronger security than existential unforgeability, strong existential unforgeability, and BUFF (beyond unforgeability features) securities ...
Keita Xagawa, Mukul Kulkarni
core +1 more source
Stern–Brocot-Based Non-Repudiation Dynamic Provable Data Possession
With the widespread popularity of cloud storage, cloud storage security issues have also received much attention. A provable data possession (PDP) scheme can effectively help users to verify the integrity of data stored remotely in the cloud.
Junfeng Tian, Guo Ruifang, Xuan Jing
doaj +1 more source
Our study demonstrates rapid nasal breathing‐evoked EEG signals enable high‐accuracy (98.3%) biometric authentication via a hybrid ResNet‐Swin Transformer model. This noninvasive approach eliminates external stimuli, offering secure patient identification for critical respiratory care settings, such as ventilator access and continuous monitoring ...
Cai Chen +8 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
Certificateless strong designated verifier multi-signature
In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless ...
Hong-zhen DU, Qiao-yan WEN
doaj
ID-based server-aided verification signature scheme with strong unforgeability
Most identity-based signature schemes in the standard model are existentially unforgeable,which cannot prevent adversaries from forging valid signatures on messages that have previously been signed.However,signature verification algorithms of ID-based ...
Xiao-dong YANG +5 more
doaj +2 more sources

