Results 31 to 40 of about 1,678 (176)
Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes
The first identity-based fully homomorphic encryption (IBFHE) scheme was constructed from identity-based encryption (IBE) and lattice-based cryptography by Gentry, Sahai, and Waters in CRYPTO 2013. Their IBFHE scheme is improved in this paper, exploiting
Tongchen Shen +4 more
doaj +1 more source
Revisiting Fully Homomorphic Encryption Schemes
A quick summary of Fully Homomorphic Encryption Schemes along with their background, concepts, applications and open-source ...
Jain, Nimish, Cherukuri, Aswani Kumar
openaire +2 more sources
An Integer Fully Homomorphic Encryption Scheme with Shorter Public Key Size [PDF]
Aiming at the problem that the efficiency of the integer Fully Homomorphic Encryption(FHE) scheme is low and the public key is long,Coron’s public key compression technique is used to encryption algorithm with a quadratic form,a partial homomorphic ...
SUN Nigang,ZHU Haoran,CHEN Xuanren
doaj +1 more source
This paper presents an integrated AI‐driven cardiovascular platform unifying multimodal data, predictive analytics, and real‐time monitoring. It demonstrates how artificial intelligence—from deep learning to federated learning—enables early diagnosis, precision treatment, and personalized rehabilitation across the full disease lifecycle, promoting a ...
Mowei Kong +4 more
wiley +1 more source
ABSTRACT The rapid evolution of the Internet of Things (IoT) has significantly advanced the field of electrocardiogram (ECG) monitoring, enabling real‐time, remote, and patient‐centric cardiac care. This paper presents a comprehensive survey of AI assisted IoT‐based ECG monitoring systems, focusing on the integration of emerging technologies such as ...
Amrita Choudhury +2 more
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
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption
For the feature selection problem, we propose an efficient privacy-preserving algorithm. Let D, F, and C be data, feature, and class sets, respectively, where the feature value x(Fi) and the class label x(C) are given for each x∈D and Fi∈F. For a triple (
Shinji Ono +5 more
doaj +1 more source
On Constructing a Fully Homomorphic Encryption
Suggested a new construction for full homomorphic encryption which doesn’t use an extra information on secret key.
A. V. Shokurov, K. V. Sergeev
doaj +1 more source
Secure Outsourced Computation of Matrix Determinant Based on Fully Homomorphic Encryption
Fully homomorphic encryption enables to perform arbitrary computation over encrypted data, providing a powerful tool for secure outsourced computation on an untrusted environment.
Haoran Zong, Hai Huang, Shufang Wang
doaj +1 more source
ABSTRACT In privacy protection of control systems, a trade‐off between control performance and privacy level is often pointed out. Our goal in this paper is to improve this trade‐off by shaping the frequency of noise added for privacy protection when the control objective is to track a reference signal, which is taken as a piece of information whose ...
Rintaro Watanabe +3 more
wiley +1 more source

