Results 1 to 10 of about 380,311 (263)
On the concrete hardness of Learning with Errors [PDF]
Journal of Mathematical Cryptology, 2015 The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE.
Albrecht Martin R. +2 more
doaj +5 more sources
Learning From Errors: Exploring the Effectiveness of Enhanced Error Messages in Learning to Program. [PDF]
Front Psychol, 2021 Error messages provided by the programming environments are often cryptic and confusing to learners. This study explored the effectiveness of enhanced programming error messages (EPEMs) in a Python-based introductory programming course. Participants were two groups of middle school students.
Zhou Z, Wang S, Qian Y.
europepmc +5 more sources
An overview of torus fully homomorphic encryption [PDF]
International Journal of Group Theory, 2023 The homomorphic encryption allows us to operate on encrypted data, making any action less vulnerable to hacking. The implementation of a fully homomorphic cryptosystem has long been impracticable. A breakthrough was achieved only in 2009 thanks to Gentry
Maria Ferrara +2 more
doaj +1 more source
Fully Dynamic Multi-Key FHE Without Gaussian Noise
IEEE Access, 2021 Fully dynamic multi-key fully homomorphic encryption (FHE) that allows an unlimited number of homomorphic operations for unconstrained parties. That is to say, it supports performing as many computational procedures on inputs (which are encrypted by an ...
Yu Huang, Kaigui Wu, Ming Chen
doaj +1 more source
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
Leveled Fully Homomorphic Signcryption From Lattices
IEEE Access, 2023 With the continuous and rapid development of Cloud Computing, Big Data and Internet of Things, it is extremely critical to protect data with homomorphism, privacy and integrity. For this, Rezaeibagha et al.
Xiaodan Jin +4 more
doaj +1 more source
Star-Specific Key-Homomorphic PRFs From Learning With Linear Regression
IEEE Access, 2023 We introduce a novel method to derandomize the learning with errors (LWE) problem by generating deterministic yet sufficiently independent LWE instances that are constructed by using linear regression models, which are generated via (wireless ...
Vipin Singh Sehrawat +2 more
doaj +1 more source
Revocable attribute-based proxy re-encryption
Journal of Mathematical Cryptology, 2021 Attribute-based proxy re-encryption (ABPRE), which combines the notions of proxy re-encryption (PRE) and attribute-based encryption (ABE), allows a semi-trusted proxy with re-encryption key to transform a ciphertext under a particular access policy into ...
Luo Fucai, Al-Kuwari Saif
doaj +1 more source
Attribute-Based Verifiable Conditional Proxy Re-Encryption Scheme
Entropy, 2023 There are mostly semi-honest agents in cloud computing, so agents may perform unreliable calculations during the actual execution process. In this paper, an attribute-based verifiable conditional proxy re-encryption (AB-VCPRE) scheme using a homomorphic ...
Yongli Tang +4 more
doaj +1 more source
When Bad News Become Good News
Transactions on Cryptographic Hardware and Embedded Systems, 2022 Hard physical learning problems have been introduced as an alternative option to implement cryptosystems based on hard learning problems. Their high-level idea is to use inexact computing to generate erroneous computations directly, rather than to first
Davide Bellizia +4 more
doaj +3 more sources