Results 141 to 150 of about 357 (170)
Some of the next articles are maybe not open access.
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 0001, Minqian Wang
openaire +1 more source
A lattice-based digital signature from the Ring-LWE
2012 3rd IEEE International Conference on Network Infrastructure and Digital Content, 2012We propose a variant version of ring learning with errors (R-LWE) assumption. Under the modified slightly assumption which is reducible to the worst-case problems on ideal lattice, we present a construction of digital signatures. So the scheme is provably secure based on the hardness of lattice problems (such as approximating the length of the shortest
Yanfang Wu +3 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 +2 more sources
Integer Version of Ring-LWE and Its Applications
2019In 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 +3 more sources
Trapdoor function based on the Ring-LWE and applications in communications
Journal of Ambient Intelligence and Humanized Computing, 2018The “strong trapdoor function for lattice” has been constructed by Daniele Micciancio and Chris Peikert in EUROCRYPT 2012, which is simple, efficient, and easy to implement. In this paper, we present a new trapdoor function based on “ring learning with errors” problem (Ring-LWE) on lattice, and simultaneously the corresponding efficient inverse ...
Chengli Zhang +2 more
openaire +1 more source
A New Secure Matrix Multiplication from Ring-LWE
2018Matrix 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 0001 +2 more
openaire +1 more source
Order-LWE and the Hardness of Ring-LWE with Entropic Secrets
2019We propose a generalization of the celebrated Ring Learning with Errors (RLWE) problem (Lyubashevsky, Peikert and Regev, Eurocrypt 2010, Eurocrypt 2013), wherein the ambient ring is not the ring of integers of a number field, but rather an order (a full rank subring).
Bolboceanu, Madalina +3 more
openaire +1 more source
LWE From Non-Commutative Group Rings
Designs, Codes, and Cryptography, 2022Jincheng Zhuang, Qi Cheng
exaly
A Trace Map Attack Against Special Ring-LWE Samples
Lecture Notes in Computer Science, 2021Masaya Yasuda, Yasuhiko Ikematsu
exaly