Results 111 to 120 of about 380,993 (266)

Security Guidelines for Implementing Homomorphic Encryption

IACR Cryptology ePrint Archive
Fully Homomorphic Encryption (FHE) is a cryptographic primitive that allows performing arbitrary operations on encrypted data. Since the conception of the idea in [RAD78], it has been considered a holy grail of cryptography.
Jean-Philippe Bossuat, Ro Cammarota, Jung Hee Cheon, Ilaria Chillotti, Benjamin R. Curtis, Wei Dai, Huijing Gong, Erin Hales, Duhyeong Kim, Bryan Kumara, Changmin Lee, Xianhui Lu, Carsten Maple, A. Pedrouzo-Ulloa, Rachel Player, Luis Antonio Ruiz Lopez, Yongsoo Song, Donggeon Yhee, Bahattin Yildiz   +18 more
semanticscholar   +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   +2 more sources

Security Amplification for Interactive Cryptographic Primitives [PDF]

, 2009
Security amplification is an important problem in Cryptography: starting with a "weakly secure" variant of some cryptographic primitive, the goal is to build a "strongly secure" variant of the same primitive. This question has been successfully studied for a variety of important cryptographic primitives, such as one-way functions, collision-resistant ...
Valentine Kabanets, Yevgeniy Dodis, Ragesh Jaiswal, Russell Impagliazzo   +3 more
openaire   +2 more sources

Pseudo-free families and cryptographic primitives

Journal of Mathematical Cryptology, 2022
Abstract In this article, we study the connections between pseudo-free families of computational Ω \Omega -algebras (in appropriate varieties of
openaire   +2 more sources

(Identity-based) dual receiver encryption from lattice-based programmable hash functions with high min-entropy

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

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems [PDF]

, 2009
Benny Applebaum, David M. Cash, Chris Peikert, Amit Sahai   +3 more
openalex   +1 more source

A note on some algebraic trapdoors for block ciphers

, 2018
We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al.
Calderini, Marco
core  

Cryptanalysis of Selected ARX-Based Block Ciphers

Vietnam Journal of Computer Science
The security of digital communication and information systems is mostly dependent on block ciphers. ARX-based ciphers are widely used due to their simplicity and efficiency.
Praveen Kumar Gundaram
doaj   +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, Jianwei Liu, Qianhong Wu, Zhenyu Guan   +3 more
doaj   +1 more source

On Formal Verification of Arithmetic-Based Cryptographic Primitives [PDF]

, 2009
Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to computationally hard problems. Those reductions can be subtle and tedious, and thus not easily checkable.
openaire   +3 more sources