Results 11 to 20 of about 243,777 (279)
Non-commutative Ring Learning with Errors from Cyclic Algebras
AbstractThe Learning with Errors (LWE) problem is the fundamental backbone of modern lattice-based cryptography, allowing one to establish cryptography on the hardness of well-studied computational problems. However, schemes based on LWE are often impractical, so Ring LWE was introduced as a form of ‘structured’ LWE, trading off a hard to quantify loss
Grover, Charles +3 more
exaly +6 more sources
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over a public channel. Shor’s algorithm is a big threat to existing authenticated key exchange protocols.
Dharminder Chaudhary +2 more
doaj +3 more sources
CIDER: Cyber‐Security in Industrial IoT Using Deep Learning and Ring Learning with Errors
Traditional security measures such as access control and authentication need to be more effective against ever‐evolving threats. Moreover, security concerns increase as more industries shift towards adopting the industrial Internet of things (IIoT ...
Siu Ting Tsoi, Anish Jindal
doaj +2 more sources
Multiparty Homomorphic Encryption from Ring-Learning-with-Errors [PDF]
Abstract We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE). To support our solution, we introduce a multiparty version of the Brakerski-Fan-Vercauteren homomorphic cryptosystem and implement it in an open-source ...
Christian Mouchet +3 more
openaire +1 more source
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors [PDF]
Oblivious linear evaluation (OLE) is a fundamental building block in multi-party computation protocols. In OLE, a sender holds a description of an affine function $f_α,β (z)=α z+β$, the receiver holds an input x, and gets α x+β$ (where all computations are done over some field, or more generally, a ring). Vector OLE (VOLE) is a generalization where the
de Castro, Leo +2 more
openaire +1 more source
Ring Signature With Unconditional Anonymity in the Plain Model
Ring signature allows a user to sign messages as a member of a set of users, which is called the ring. In addition to an unforgeability, ring signature ensures that nobody can detect which member in the ring signs the message.
Keisuke Hara, Keisuke Tanaka
doaj +1 more source
Highly Efficient Architecture of NewHope-NIST on FPGA using Low-Complexity NTT/INTT
NewHope-NIST is a promising ring learning with errors (RLWE)-based postquantum cryptography (PQC) for key encapsulation mechanisms. The performance on the field-programmable gate array (FPGA) affects the applicability of NewHope-NIST.
Neng Zhang +5 more
doaj +1 more source
Ring-LWE Cryptography for the Number Theorist [PDF]
In this paper, we survey the status of attacks on the ring and polynomial learning with errors problems (RLWE and PLWE). Recent work on the security of these problems [Eisentr\"ager-Hallgren-Lauter, Elias-Lauter-Ozman-Stange] gives rise to interesting ...
Elias, Yara +3 more
core +2 more sources
ARTMAP: Supervised Real-Time Learning and Classification of Nonstationary Data by a Self-Organizing Neural Network [PDF]
This article introduces a new neural network architecture, called ARTMAP, that autonomously learns to classify arbitrarily many, arbitrarily ordered vectors into recognition categories based on predictive success. This supervised learning system is built
Carpenter, Gail A. +2 more
core +2 more sources
Security considerations for Galois non-dual RLWE families [PDF]
We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additional assumptions, construct a new family of vulnerable Galois number fields ...
D Micciancio +13 more
core +2 more sources

