Results 21 to 30 of about 2,626,008 (101)
A NEW ROBUST HOMOMORPHIC ENCRYPTION SCHEME BASED ON PAILLIER, RESIDUE NUMBER SYSTEM AND EL-GAMAL
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGYThe new focus of cryptographic research is on encryption schemes that can withstand cyber-attacks, with the arrival of cloud computing. The widely used public key encryption system designed by Taher El Gamal based on the discrete logarithm problem has
P. Agbedemnab +2 more
semanticscholar +1 more source
DR.SGX: Hardening SGX Enclaves against Cache Attacks with Data Location Randomization
, 2017 Recent research has demonstrated that Intel's SGX is vulnerable to various software-based side-channel attacks. In particular, attacks that monitor CPU caches shared between the victim enclave and untrusted software enable accurate leakage of secret ...
Aline Souza (4218802) +10 more
core +3 more sources
PQC: R-Propping a Chaotic Cellular Automata [PDF]
, 2021 Post-quantum cryptography (PQC) has a well-deserved NIST status. Our approach (R-Propping) replaces all numeric field arithmetic with GF(2^8) field operations. This method yields both classical and quantum secure protocols.
Pedro Hecht
core
Post-Quantum Cryptography: S [PDF]
, 2017 Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor's polynomial time algorithm for numerical field problems like integer ...
Hecht, P. (P)
core
Privacy-aware Decentralized and Scalable Access Control Management for IoT Environment
Journal of King Abdulaziz University-Computing and Information Technology Sciences, 2019 In recent years, the Internet of Things (IoT) plays a vital role in our daily activities .Owing to the increased number of vulnerabilities on the IoT devices, security becomes critical in the untrustworthy IoT environment.
Abrar O. Alkhamisi and Fathy Alboraei Abrar O. Alkhamisi Alboraei
semanticscholar +1 more source
Towards quantum-based privacy and voting
, 2005 The privacy of communicating participants is often of paramount importance, but in some situations it is an essential condition. A typical example is a fair (secret) voting.
Chaum +13 more
core +1 more source
Probability theory and public-key cryptography [PDF]
arXiv, 2020 In this short note, we address a common misconception at the interface of probability theory and public-key cryptography.
arxiv
Dynamics of neural cryptography
, 2007 Synchronization of neural networks has been used for novel public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive ...
A. Engel +9 more
core +1 more source
Cryptanalysis of an Encryption Scheme Based on Blind Source Separation [PDF]
, 2006 Recently Lin et al. proposed a method of using the underdetermined BSS (blind source separation) problem to realize image and speech encryption. In this paper, we give a cryptanalysis of this BSS-based encryption and point out that it is not secure ...
Chen, Guanrong +3 more
core +2 more sources
On an authentication scheme based on the Root Problem in the braid group [PDF]
, 2009 Lal and Chaturvedi proposed two authentication schemes based on the difficulty of the Root Problem in the braid group. We point out that the first scheme is not really as secure as the Root Problem, and describe an efficient way to crack it.
Tsaban, Boaz
core