Results 21 to 30 of about 5,430 (195)
Homomorphic encryption (HE) is notable for enabling computation on encrypted data as well as guaranteeing high‐level security based on the hardness of the lattice problem. In this sense, the advantage of HE has facilitated research that can perform data analysis in an encrypted state as a purpose of achieving security and privacy for both clients and ...
Joon Soo Yoo, Ji Won Yoon, Junggab Son
wiley +1 more source
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
First posed as a challenge in 1978 by Rivest et al., fully homomorphic encryption—the ability to evaluate any function over encrypted data—was only solved in 2009 in a breakthrough result by Gentry (Commun. ACM, 2010). After a decade of intense research,
Marc Joye
doaj +3 more sources
CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes
This paper proposes a practical hybrid solution for combining and switching between three popular Ring-LWE-based FHE schemes: TFHE, B/FV and HEAAN. This is achieved by first mapping the different plaintext spaces to a common algebraic structure and then ...
Boura Christina +3 more
doaj +1 more source
Deep Neural Networks for Encrypted Inference with TFHE
Fully homomorphic encryption (FHE) is an encryption method that allows to perform computation on encrypted data, without decryption. FHE preserves the privacy of the users of online services that handle sensitive data, such as health data, biometrics, credit scores and other personal information.
Stoian, Andrei +5 more
openaire +2 more sources
Cloud-Assisted Private Set Intersection via Multi-Key Fully Homomorphic Encryption
With the development of cloud computing and big data, secure multi-party computation, which can collaborate with multiple parties to deal with a large number of transactions, plays an important role in protecting privacy.
Cunqun Fan +6 more
doaj +1 more source
Non-Interactive Decision Trees and Applications with Multi-Bit TFHE
Machine learning classification algorithms, such as decision trees and random forests, are commonly used in many applications. Clients who want to classify their data send them to a server that performs their inference using a trained model.
Jestine Paul +3 more
doaj +1 more source
TFHE: Fast Fully Homomorphic Encryption Over the Torus [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chillotti, Ilaria +3 more
openaire +3 more sources
Stress and the ecology of urban experience: Migrant mental lives in central Shanghai
Responding to claims in urban studies and epidemiology that modern urban living negatively affects the mental health of the poor and newcomers to the city, this paper offers a different account based on an ethnography of a neighbourhood in central Shanghai, where precarious rural migrant lives unfold. Drawing on the concept of “ecologies of experience”
Ash Amin, Lisa Richaud
wiley +1 more source
An Efficient Encrypted Floating‐Point Representation Using HEAAN and TFHE
As a method of privacy‐preserving data analysis (PPDA), a fully homomorphic encryption (FHE) has been in the spotlight recently. Unfortunately, because many data analysis methods assume that the type of data is of real type, the FHE‐based PPDA methods could not support the enough level of accuracy due to the nature of FHE that fixed‐point real‐number ...
Subin Moon +2 more
wiley +1 more source
To help smartphone users protect their phone, fingerprint‐based authentication systems (e.g., Apple’s Touch ID) have increasingly become popular in smartphones. In web applications, however, fingerprint‐based authentication is still rarely used. One of the most serious concerns is the lack of technology for securely storing fingerprint data used for ...
Taeyun Kim +3 more
wiley +1 more source

