Results 11 to 20 of about 175 (163)
Efficient Lattice-Based Ring Signature Scheme without Trapdoors for Machine Learning. [PDF]
Comput Intell Neurosci, 2022 Machine learning (ML) and privacy protection are inseparable. On the one hand, ML can be the target of privacy protection; on the other hand, it can also be used as an attack tool for privacy protection. Ring signature (RS) is an effective way for privacy protection in cryptography. In particular, lattice‐based RS can still protect the privacy of users
Ye Q, Lang Y, Zhao Z, Chen Q, Tang Y.
europepmc +2 more sources
ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS
Barekeng, 2023 NTRU is a lattice-based public-key cryptosystem designed by Hoffstein, Pipher, and Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Fadila Paradise, Kiki Ariyanti Sugeng
doaj +1 more source
NTRU-type fully homomorphic encryption scheme without key switching
网络与信息安全学报, 2017 In order to construct a fully homomorphic encryption scheme based on NTRU cryptosystem from ring learning with errors, noise growth and homomorphic property in the NTRU cryptosystem were analyzed. The con-cept of zero homomorphic encryption was introdced
Xin-xia SONG +2 more
doaj +3 more sources
Post-quantum cryptography-driven security framework for cloud computing
Open Computer Science, 2022 Data security in the cloud has been a major issue since the inception and adoption of cloud computing. Various frameworks have been proposed, and yet data breach prevails.
Ukwuoma Henry Chima +3 more
doaj +1 more source
CQTRU: A Commutative Quaternions Rings Based Public Key Cryptosystem [PDF]
Engineering and Technology Journal, 2016 In this paper, we propose a new version of the NTRU public key cryptosystem called CQTRU. It is a four-dimensional cryptosystem based on the commutative quaternion ring.
Nadia M.G. Alsaidi +2 more
doaj +1 more source
Lattice Attacks on NTRU Revisited
IEEE Access, 2021 NTRU cryptosystem was proposed by J. Hoffstein, J.Pipher and J.H. Silverman in 1996, whose security is related to the hardness of finding sufficient short vectors in NTRU lattice with dimension $2N$ .
Jingguo Bi, Lidong Han
doaj +1 more source
Security Analysis of Hybrid Attack for NTRU-Class Encryption Schemes
IEEE Access, 2023 One of the significant post-quantum cryptographic candidates is the NTRU public key cryptosystem. It operates on polynomial rings, where the parameter largely determines the security of the system.
Alla Levina +2 more
doaj +1 more source
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
IET Information Security, Volume 17, Issue 2, Page 171-209, March 2023., 2023 Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source
Lattice‐based cryptosystems in standardisation processes: A survey
IET Information Security, Volume 17, Issue 2, Page 227-243, March 2023., 2023 Abstract The current widely used public‐key cryptosystems are vulnerable to quantum attacks. To prepare for cybersecurity in the quantum era, some projects have been launched to call for post‐quantum alternatives. Due to solid security and desirable performance, lattice‐based cryptosystems are viewed as promising candidates in the upcoming ...
Anyu Wang, Dianyan Xiao, Yang Yu
wiley +1 more source
Transactions on Cryptographic Hardware and Embedded Systems, 2023 The main protection against side-channel attacks consists in computing every function with multiple shares via the masking countermeasure. While the masking countermeasure was originally developed for securing block-ciphers such as AES, the protection ...
Jean-Sébastien Coron +3 more
doaj +1 more source