Results 171 to 180 of about 2,659 (196)

Ring-LWE Ciphertext Compression and Error Correction

Proceedings of the 3rd ACM International Workshop on IoT Privacy, Trust, and Security, 2017
Some 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

2020
An 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, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza   +4 more
openaire   +2 more sources

Ring-LWE on 8-Bit AVR Embedded Processor

2020
Fast 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, Hyeokdong Kwon, Yongbeen Kwon, Kyungho Kim, Seungju Choi, Hyunjun Kim, Kyoungbae Jang   +6 more
openaire   +1 more source

Private Equality Test Using Ring-LWE Somewhat Homomorphic Encryption

2016 3rd Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE), 2016
We propose two secure protocols namely private equality test (PET) for single comparison and private batch equality test (PriBET) for batch comparisons of l-bit integers. We ensure the security of these secure protocols using somewhat homomorphic encryption (SwHE) based on ring learning with errors (ring-LWE) problem in the semi-honest model.
Tushar Kanti Saha, Takeshi Koshiba
openaire   +1 more source

How (Not) to Instantiate Ring-LWE

2016
The learning with errors over rings Ring-LWE problem--or more accurately, family of problems--has emerged as a promising foundation for cryptography due to its practical efficiency, conjectured quantum resistance, and provable worst-case hardness: breaking certain instantiations of Ring-LWE is at least as hard as quantumly approximating the Shortest ...
openaire   +1 more source

A New Secure Matrix Multiplication from Ring-LWE

2018
Matrix multiplication is one of the most basic and useful operations in statistical calculations and machine learning. When the matrices contain sensitive information and the computation has to be carried out in an insecure environment, such as a cloud server, secure matrix multiplication computation (MMC) is required, so that the computation can be ...
Lihua Wang, Yoshinori Aono, Le Trieu Phong   +2 more
openaire   +1 more source

Integer Version of Ring-LWE and Its Applications

2019
In this work, we introduce an integer version of ring-LWE (I-RLWE) over the polynomial rings and present a public key encryption based on I-RLWE. The security of our scheme relies on the computational hardness assumption of the I-RLWE problem.
openaire   +1 more source

Error Detection Architectures for Ring Polynomial Multiplication and Modular Reduction of Ring-LWE in $\boldsymbol{\frac{\mathbb{Z}/p\mathbb{Z}[x]}{x^{n}+1}}$ Benchmarked on ASIC

IEEE Transactions on Reliability, 2021
Ausmita Sarker, Mehran Mozaffari-Kermani, Reza Azarderakhsh   +2 more
exaly  

AxRLWE: A Multilevel Approximate Ring-LWE Co-Processor for Lightweight IoT Applications

IEEE Internet of Things Journal, 2022
Maire O'Neill, Ayesha Khalid, Song Bian
exaly  

Cryptography with the Ring-LWE (Learning With Errors) Algorithm

Jurnal Teknik Indonesia
Ring-LWE (Ring Learning With Errors) is a post-quantum cryptography algorithm based on mathematical problems in number theory and algebra. It is an extension of LWE (Learning With Errors) first introduced by Oded Regev and is used for secure data encryption from quantum computer attacks.
null Hesty Sitohang, null Roy Untung Pratama Saing, null Agnes Selaras Osabela Sarahono, null Joy Sofater Purba, null Petrus Tebai, null Paskah Marto Hasugian   +5 more
openaire   +1 more source