Results 131 to 140 of about 302 (149)
Some of the next articles are maybe not open access.
Lossiness and Entropic Hardness for Ring-LWE
2020The hardness of the Ring Learning with Errors problem (RLWE) is a central building block for efficiency-oriented lattice-based cryptography. Many applications use an “entropic” variant of the problem where the so-called “secret” is not distributed uniformly as prescribed but instead comes from some distribution with sufficient min-entropy. However, the
Brakerski, Zvika, Döttling, Nico
openaire +1 more source
Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts
2021In the past few years, significant progress on homomorphic encryption (HE) has been made toward both theory and practice. The most promising HE schemes are based on the hardness of the Learning With Errors (LWE) problem or its ring variant (RLWE). In this work, we present new conversion algorithms that switch between different (R)LWE-based HE schemes ...
Hao Chen +3 more
openaire +1 more source
FFT Program Generation for Ring LWE-Based Cryptography
2021Fast Fourier Transform (FFT) enables an efficient implementation of polynomial multiplication, which is at the core of any cryptographic constructions based on the hardness of the Ring learning with errors (RLWE) problem. Existing implementations of FFT for RLWE-based cryptography rely on hand-written assembly code for performance, making it difficult ...
Masahiro Masuda, Yukiyoshi Kameyama
openaire +1 more source
Zero Knowledge Proofs from Ring-LWE
2013Zero-Knowledge proof is a very basic and important primitive, which allows a prover to prove some statement without revealing anything else. Very recently, Jain et al. proposed very efficient zero-knowledge proofs to prove any polynomial relations on bits, based on the Learning Parity with Noise (LPN) problem (Asiacrypt'12).
Xiang Xie, Rui Xue, Minqian Wang
openaire +1 more source
Ring-LWE Public Key Encryption Processor
2019In this chapter we analyze the \(\mathtt {LPR}\) ring-LWE public key encryption scheme of Sect. 2.4.1 and design a compact hardware architecture of the encryption processor. From Fig. 2.4 of Sect. 2.4.1, we see that the \(\mathtt {LPR}\) encryption scheme is composed of a discrete Gaussian sampler, a polynomial arithmetic (addition/multiplication) unit,
Sujoy Sinha Roy, Ingrid Verbauwhede
openaire +1 more source
2023
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire +1 more source
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire +1 more source
Large Modulus Ring-LWE $$\ge $$ Module-LWE
2017We present a reduction from the module learning with errors problem (MLWE) in dimension \(d\) and with modulus \(q\) to the ring learning with errors problem (RLWE) with modulus \(q^{d}\). Our reduction increases the LWE error rate \(\alpha \) by a quadratic factor in the ring dimension \(n\) and a square root in the module rank \(d\) for power-of-two ...
Martin R. Albrecht, Amit Deo
openaire +1 more source
Ring-LWE Ciphertext Compression and Error Correction
Proceedings of the 3rd ACM International Workshop on IoT Privacy, Trust, and Security, 2017Some lattice-based public key cryptosystems allow one to transform ciphertext from one lattice or ring representation to another efficiently and without knowledge of public and private keys. In this work we explore this lattice transformation property from cryptographic engineering viewpoint.
openaire +1 more source
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE
2020An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function \(f(x) = ax + b\), where a sender inputs the field elements a, b, and a receiver inputs x and learns f(x). OLE can be used to build secret-shared multiplication, and is an essential component of many secure computation applications including general ...
Carsten Baum +4 more
openaire +2 more sources
Ring-LWE on 8-Bit AVR Embedded Processor
2020Fast implementation of Ring-LWE is a challenge for the low-end embedded processors. One of the most expensive operation for Ring-LWE is Number Theoretic Transform (NTT). Many works have investigated the optimized implementation for the NTT operation. In this paper, we further optimized the NTT operation on the low-end 8-bit AVR microcontrollers.
Hwajeong Seo +6 more
openaire +1 more source