Results 31 to 40 of about 302 (149)
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT
Transactions on Cryptographic Hardware and Embedded Systems, 2018 In this work, we consider the ring- and module- variants of the LWE problem and investigate cold boot attacks on cryptographic schemes based on these problems, wherein an attacker is faced with the problem of recovering a scheme’s secret key from a noisy
Martin R. Albrecht +2 more
doaj +1 more source
Obfuscating Conjunctions under Entropic Ring LWE [PDF]
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016 We show how to securely obfuscate conjunctions, which are functions f(x1,...,xn) = ∧i∈I yi where I ⊆ [n] and each literal yi is either just xi or ¬ xi e.g., f(xi,...,x_n) = xi ⊆ ¬ x3 ⊆ ¬ x7 ... ⊆ x{n-1. Whereas prior work of Brakerski and Rothblum (CRYPTO 2013) showed how to achieve this using a non-standard object called cryptographic multilinear maps,
Brakerski, Zvika +3 more
openaire +4 more sources
Discretisation and Product Distributions in Ring-LWE
Journal of Mathematical Cryptology, 2020 A statistical framework applicable to Ring-LWE was outlined by Murphy and Player (IACR eprint 2019/452). Its applicability was demonstrated with an analysis of the decryption failure probability for degree-1 and degree-2 ciphertexts in the homomorphic ...
Murphy Sean, Player Rachel
doaj +1 more source
Provably Weak Instances of Ring-LWE Revisited [PDF]
, 2016 In CRYPTO 2015, Elias, Lauter, Ozman and Stange described an attack on the non-dual decision version of the ring learning with errors problem RLWE for two special families of defining polynomials, whose construction depends on the modulusq that is being used.
Castryck, Wouter +2 more
openaire +2 more sources
On Advances of Lattice-Based Cryptographic Schemes and Their Implementations
Cryptography, 2022 Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying ...
Harshana Bandara +3 more
doaj +1 more source
Efficient Software Implementation of Ring-LWE Encryption [PDF]
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015, 2015 © 2015 EDAA. Present-day public-key cryptosystems such as RSA and Elliptic Curve Cryptography (ECC) will become insecure when quantum computers become a reality. This paper presents the new state of the art in efficient software implementations of a post-quantum secure public-key encryption scheme based on the ring-LWE problem.
De Clercq, Ruan +3 more
openaire +2 more sources
Efficient Batch Fully Homomorphic Encryption with a Shorter Key from Ring-LWE
Applied Sciences, 2022 Fully homomorphic encryption allows users to use the computing resources of cloud servers for the computation of encrypted data without worrying about data leakage.
Yuyue Chen, Ruwei Huang, Bo Yang
doaj +1 more source
Consortium Blockchain Data Sharing Scheme Using Lattice Ciphertext Policy Attribute-Based Encryption [PDF]
Jisuanji gongcheng, 2023 In the process of data sharing, problems of data leakage and trust crisis can arise, and with the emergence of quantum computers, the threat to traditional encryption algorithms is greater.
Lingyun ZHANG, Yuling CHEN
doaj +1 more source
Ring-LWE Cryptography for the Number Theorist [PDF]
, 2016 20 ...
Elias, Y. +3 more
openaire +3 more sources
Efficient Fully homomorphic encryption scheme using Ring-LWE [PDF]
Journal of Physics: Conference Series, 2021 Abstract Data can be stored and processed in an encrypted format using fully homomorphic encryption, which makes cloud computing provider can process data well without even knowing data information. However, most existing homomorphic encryption schemes based on ring learning with errors, focus on the special classes of rings, such as ...
Dan Xin +4 more
openaire +1 more source