Results 71 to 80 of about 380,993 (266)

Oblivious Transfer based on Key Exchange

, 2007
Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this paper we present a protocol for mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to Diffie-Hellman protocol using the ...
Abhishek Parakh, Blum M., Fiat A., Naor M.   +3 more
core   +1 more source

Memristive crypto primitive for building highly secure physical unclonable functions

Scientific Reports, 2015
Physical unclonable functions (PUFs) exploit the intrinsic complexity and irreproducibility of physical systems to generate secret information. The advantage is that PUFs have the potential to provide fundamentally higher security than traditional ...
Yansong Gao, D. Ranasinghe, S. Al-Sarawi, O. Kavehei, D. Abbott   +4 more
semanticscholar   +1 more source

Brain‐Inspired Polymer Dendrite Networks for Morphology‐Dependent Computing Hardware

Advanced Science, Volume 12, Issue 33, September 4, 2025.
Although process variability is often perceived as a drawback in electronics, this work harnesses the stochastic nature of electropolymerization as a powerful ally for computation. The resulting conductive polymer dendrites exhibit unique structure‐property relationships and support in memory computing, paving the way for the development of a new class
Corentin Scholaert, Yannick Coffinier, Sébastien Pecqueur, Fabien Alibart   +3 more
wiley   +1 more source

High-level Cryptographic Abstractions

, 2019
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, Kane, Christopher, Lin, Bo, Liu, Yanhong A., Stoller, Scott D.   +4 more
core   +1 more source

The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.

Ìнформаційні технології в освіті, 2009
An iterative algorithm used with variable block size of public key encryption, multiple 32-m bits. Encrypt text runs in steps. As cryptographic primitives are used: stochastic scrolling block, bi-directional sliding coding, nonlinear and stochastic ...
A. Beletsky, A. Beletsky
doaj  

Quantum Computing in Industrial Internet of Things (IIoT) Forensics: Framework, Implications, Opportunities, and Future Directions

WIREs Forensic Science, Volume 7, Issue 3, September 2025.
Generic Quantum‐Safe IIoT Forensics Framework (QS‐IIoT‐F) ABSTRACT The continuous evolution of quantum computing has shown novel and transformative possibilities and critical implications for the Industrial Internet of Things (IIoT) forensic processes.
Victor R. Kebande
wiley   +1 more source

Multikey Verifiable Homomorphic Encryption

IEEE Access, 2022
A homomorphic encryption (HE) scheme is an advanced encryption technology which allows any user receiving ciphertexts to perform computations over them in a public manner. An important application of an HE scheme is a private delegating computation where
Yi Lu, Keisuke Hara, Keisuke Tanaka
doaj   +1 more source

Secure Single-Server Aggregation with (Poly)Logarithmic Overhead

IACR Cryptology ePrint Archive, 2020
Secure aggregation is a cryptographic primitive that enables a server to learn the sum of the vector inputs of many clients. Bonawitz et al. (CCS 2017) presented a construction that incurs computation and communication for each client linear in the ...
James Bell, Kallista A. Bonawitz, Adrià Gascón, Tancrède Lepoint, Mariana Raykova   +4 more
semanticscholar   +1 more source

Hardware Security in the Connected World

WIREs Data Mining and Knowledge Discovery, Volume 15, Issue 3, September 2025.
Depicts the components covered in the article. ABSTRACT The rapid proliferation of the Internet of Things (IoT) has integrated billions of smart devices into our daily lives, generating and exchanging vast amounts of critical data. While this connectivity offers significant benefits, it also introduces numerous security vulnerabilities.
Durba Chatterjee, Shuvodip Maitra, Nimish Mishra, Shubhi Shukla, Debdeep Mukhopadhyay   +4 more
wiley   +1 more source

OPTIMIZED REPRESENTATIONS IN CRYPTOGRAPHIC PRIMITIVES

, 2022
This work focuses on optimization of cryptographic primitives both in theory and in applications. From a theoretical point of view, it addresses the problem of speeding up the polynomial multiplication used in Post-Quantum cryptosystems such as NTRU and McEliece. In particular, the latter extensively uses Galois fields whose elements can be represented
openaire   +2 more sources