Results 11 to 20 of about 243,777 (273)
Non-commutative Ring Learning with Errors from Cyclic Algebras
Journal of Cryptology, 2022 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
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors [PDF]
Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, 2021 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
Faster Homomorphic Trace-Type Function Evaluation
IEEE Access, 2021 Homomorphic encryption enables computations over encrypted data without decryption, and can be used for outsourcing computations to some untrusted source.
Yu Ishimaki, Hayato Yamana
doaj +1 more source
Post-quantum encryption technology based on BRLWE for internet of things
网络与信息安全学报, 2022 With the development of quantum computers, the classical public key encryption system is not capable enough to guarantee the communication security of internet of things (IoT).Because the mathematical puzzles which post-quantum encryption algorithms are ...
Yitian GAO, Liquan CHEN, Tianyang TU, Yuan GAO, Qianye CHEN
doaj +3 more sources
The polynomial learning with errors problem and the smearing condition
Journal of Mathematical Cryptology, 2022 As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana +4 more
doaj +1 more source
IEEE Access, 2023 The Internet of Vehicles (IoV), with advanced technology in 5G communication, is considered the backbone of a smart city’s intelligent transport system.
Tannu Sharma +4 more
doaj +1 more source
A New Constant-Size Group Signature Scheme From Lattices
IEEE Access, 2020 A lattice-based group signature scheme (LGSS) is an active cryptographic primitive, where each group member can sign messages anonymously in the name of the entire group and each valid signature should be traced to some group member on the lattice.
Qin Luo, Chun-Yang Jiang
doaj +1 more source
Highly Efficient Architecture of NewHope-NIST on FPGA using Low-Complexity NTT/INTT
Transactions on Cryptographic Hardware and Embedded Systems, 2020 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]
, 2015 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
Ring Signature With Unconditional Anonymity in the Plain Model
IEEE Access, 2021 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