Results 71 to 80 of about 1,355 (213)
On the composable security of weak coin flipping [PDF]
QuantumWeak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed from noiseless
Jiawei Wu +3 more
doaj +1 more source
A Novel DNA Techniques to Strengthen Cryptographic Permutation Tables in Encryption Algorithm
IEEE AccessCryptography has long safeguarded sensitive data within information security. Recently, integrating traditional cryptographic methods with Deoxyribonucleic Acid (DNA) technologies sparked interest, giving rise to DNA cryptography.
Nik Azura Nik Abdullah +4 more
doaj +1 more source
Design and Analysis of a True Random Number Generator Based on GSR Signals for Body Sensor Networks
Sensors, 2019 Today, medical equipment or general-purpose devices such as smart-watches or smart-textiles can acquire a person’s vital signs. Regardless of the type of device and its purpose, they are all equipped with one or more sensors and often have wireless
Carmen Camara +3 more
doaj +1 more source
Quantum Security of Cryptographic Primitives
, 2017 We call quantum security the area of IT security dealing with scenarios where one or more parties have access to quantum hardware. This encompasses both the fields of post-quantum cryptography (that is, traditional cryptography engineered to be resistant against quantum adversaries), and quantum cryptography (that is, security protocols designed to be ...
openaire +3 more sources
Energy-efficient cryptographic primitives
Facta universitatis - series: Electronics and Energetics, 2018 Our society greatly depends on services and applications provided by mobile communication networks. As billions of people and devices become connected, it becomes increasingly important to guarantee security of interactions of all players. In this talk we address several aspects of this important, many-folded problem.
openaire +2 more sources
Cybersecurity, 2019 Dual receiver encryption (DRE) is an important cryptographic primitive introduced by Diament et al. at CCS’04, which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.
Yanyan Liu, Daode Zhang, Yi Deng, Bao Li
doaj +1 more source
A measure of dependence for cryptographic primitives relative to ideal functions [PDF]
, 2015 Daniel Smith-Tone, Cristina Tone
openalex +1 more source
Efficient CCA2 Secure Flexible and Publicly-Verifiable Fine-Grained Access Control in Fog Computing
IEEE Access, 2019 Fog computing enables computation, storage, applications, and network services between the Internet of Things and the cloud servers by extending the Cloud Computing paradigm to the edge of the network.
Dawei Li +3 more
doaj +1 more source
MATRIX ALGORITHMS OF ENCRYPTIC PROTECTION OF INFORMATION AND EXCHANGE OF ENCRYPTION KEY
Ìнформаційні технології в освіті, 2010 The algorithms of the exchange of encryption keys between users of computer networks and cryptographic protection of information transmitted over open communications channels. The algorithm is based a modified asymmetric protocol Diffie-Hellman (DH). The
A. Beletsky, D. Stecenko
doaj
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