Results 51 to 60 of about 37,820 (242)
Formal Computational Unlinkability Proofs of RFID Protocols
We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: i) To design (and prove sound) axioms reflecting the properties of
Comon, Hubert, Koutsos, Adrien
core +1 more source
ABSTRACT Global municipal solid waste generation is projected to exceed 3.8 billion tonnes annually by 2050. This makes the need for smart, inclusive, and scalable waste valorization systems more urgent than ever. This review critically explores the shift from conventional waste management to intelligent, technology‐driven solutions aligned with ...
Segun E. Ibitoye +8 more
wiley +1 more source
High-level Cryptographic Abstractions
The interfaces exposed by commonly used cryptographic libraries are clumsy, complicated, and assume an understanding of cryptographic algorithms. The challenge is to design high-level abstractions that require minimum knowledge and effort to use while ...
Chand, Saksham +4 more
core +1 more source
Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]
In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir +6 more
core +2 more sources
HORSIC+: An Efficient Post-Quantum Few-Time Signature Scheme
It is well known that conventional digital signature algorithms such as RSA and ECDSA are vulnerable to quantum computing attacks. Hash-based signature schemes are attractive as post-quantum signature schemes in that it is possible to calculate the ...
Jaeheung Lee, Yongsu Park
doaj +1 more source
SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function
Many commonly used public key cryptosystems will become insecure once a scalable quantum computer is built. New cryptographic schemes that can guarantee protection against attacks with quantum computers, so-called post-quantum algorithms, have emerged in
Anufriev, M. N. +5 more
core +1 more source
Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core +1 more source
A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm
Abstract Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key
Adel Binbusayyis +7 more
wiley +1 more source
Abstract The Internet of Things (IoT) in deploying robotic sprayers for pandemic‐associated disinfection and monitoring has garnered significant attention in recent research. The authors introduce a novel architectural framework designed to interconnect smart monitoring robotic devices within healthcare facilities using narrowband Internet of Things ...
Md Motaharul Islam +9 more
wiley +1 more source
In-Memory Computation Based Mapping of Keccak-f Hash Function
Cryptographic hash functions play a central role in data security for applications such as message authentication, data verification, and detecting malicious or illegal modification of data.
Sandeep Kaur Kingra +2 more
doaj +1 more source

