Results 11 to 20 of about 20,312 (246)
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
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 +3 more sources
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
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
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
Non-Commutative Ring Learning With Errors From Cyclic Algebras
CoRR, 2020 Full version of a paper previously posted on IACR ...
Charles Grover +2 more
openaire +2 more sources
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT
Transactions on Cryptographic Hardware and Embedded Systems, 2018 In this work, we consider the ring- and module- variants of the LWE problem and investigate cold boot attacks on cryptographic schemes based on these problems, wherein an attacker is faced with the problem of recovering a scheme’s secret key from a noisy
Martin R. Albrecht +2 more
doaj +1 more source
On the condition number of the Vandermonde matrix of the nth cyclotomic polynomial
Journal of Mathematical Cryptology, 2020 Recently, Blanco-Chacón proved the equivalence between the Ring Learning With Errors and Polynomial Learning With Errors problems for some families of cyclotomic number fields by giving some upper bounds for the condition number Cond(Vn) of the ...
Scala Antonio J. Di +2 more
doaj +1 more source
R-LWE-Based Distributed Key Generation and Threshold Decryption
Mathematics, 2022 Ever since the appearance of quantum computers, prime factoring and discrete logarithm-based cryptography have been questioned, giving birth to the so-called post-quantum cryptography.
Ferran Alborch +2 more
doaj +1 more source