Results 61 to 70 of about 37,139 (180)

A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM [PDF]

open access: yes, 2017
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation.
Barreto, Paulo S. L. M.   +4 more
core   +1 more source

Assessment of Practical Satellite Quantum Key Distribution Architectures for Current and Near‐Future Missions

open access: yesInternational Journal of Satellite Communications and Networking, Volume 43, Issue 3, Page 164-192, May/June 2025.
ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci   +7 more
wiley   +1 more source

Analysis of the RSA-cryptosystem in abstract number rings

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2020
Quantum computers can be a real threat to some modern cryptosystems (such as the RSA-cryptosystem). The analogue of the RSA-cryptosystem in abstract number rings is not affected by this threat, as there are currently no factorization algorithms using ...
Nikita V. Kondratyonok
doaj   +1 more source

NTRU Lattice–Based Blockchain Consensus–Assisted Vehicle‐to‐Vehicle Authenticated Message Delivery in Internet of Vehicles

open access: yesInternational Journal of Communication Systems, Volume 38, Issue 8, 25 May 2025.
Overview of blockchain supported multisignature algorithm for IoV. ABSTRACT The Internet of Vehicles (IoV) has emerged as a promising application capable of enhancing transportation efficiency and providing a variety of mobile services to drivers. This IoV enables real‐time data sharing among vehicles and infrastructure, allowing for better traffic ...
Dushyant Kumar Yadav   +3 more
wiley   +1 more source

On the security of compressed encryption with partial unitary sensing matrices embedding a secret keystream

open access: yesEURASIP Journal on Advances in Signal Processing, 2017
The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix ...
Nam Yul Yu
doaj   +1 more source

A Privacy‐Preserving System for Confidential Carpooling Services Using Homomorphic Encryption

open access: yesAdvanced Intelligent Systems, Volume 7, Issue 5, May 2025.
This research presents a homomorphic encryption‐based solution to enhance privacy in carpooling without compromising functionality. Rigorous experiments confirm its robustness, accuracy, and efficiency in securely matching users while preserving confidentiality.
David Palma   +3 more
wiley   +1 more source

Securing the Road Ahead: A Survey on Internet of Vehicles Security Powered by a Conceptual Blockchain‐Based Intrusion Detection System for Smart Cities

open access: yesTransactions on Emerging Telecommunications Technologies, Volume 36, Issue 4, April 2025.
Security is a crucial factor for information systems and other vital infrastructures. Ensuring robust security measures is imperative due to the substantial volume of network traffic. On the other side, many network components are susceptible to cyber threats and attacks owing to their inherent properties.
Fatima Al‐Quayed   +5 more
wiley   +1 more source

A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes

open access: yes, 2012
Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main idea is to replace its permutation matrix by adding to it a rank 1 matrix.
Gauthier, Valérie   +2 more
core   +1 more source

Homomorphic public-key cryptosystems and encrypting boolean circuits

open access: yes, 2003
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over an ...
Grigoriev, Dima, Ponomarenko, Ilia
core   +1 more source

Home - About - Disclaimer - Privacy