Results 1 to 10 of about 359,176 (216)
Detecting Errors with Zero-Shot Learning
Error detection is a critical step in data cleaning. Most traditional error detection methods are based on rules and external information with high cost, especially when dealing with large-scaled data.
Xiaoyu Wu, Ning Wang
doaj +3 more sources
An overview of torus fully homomorphic encryption [PDF]
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
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
Leveled Fully Homomorphic Signcryption From Lattices
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
The polynomial learning with errors problem and the smearing condition
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
Star-Specific Key-Homomorphic PRFs From Learning With Linear Regression
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
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
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
Classical hardness of learning with errors [PDF]
Preliminary version in STOC ...
Brakerski, Zvika +4 more
openaire +3 more sources
On the Possibility of Classical Client Blind Quantum Computing
Classical client remote state preparation (CC − RSP) is a primitive where a fully classical party (client) can instruct the preparation of a sequence of random quantum states on some distant party (server) in a way that the description is known to the ...
Alexandru Cojocaru +3 more
doaj +1 more source

