Results 71 to 80 of about 1,818,451 (197)

Fully Homomorphic Encryption over the Integers [PDF]

open access: yes, 2010
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to construct a fully homomorphic scheme from a “bootstrappable” somewhat homomorphic scheme. However, instead of using ideal lattices over a polynomial ring, our bootstrappable encryption scheme merely uses addition and ...
Marten van Dijk   +3 more
openaire   +3 more sources

Applications of Fully Homomorphic Encryption

open access: yes, 2019
Homomorphic encryption has progressed rapidly in both efficiency and versatility since its emergence in 2009. Meanwhile, a multitude of pressing privacy needs --- ranging from cloud computing to healthcare management to the handling of shared databases ...
Cetin, Gizem S.
core   +3 more sources

More Practical Fully Homomorphic Encryption [PDF]

open access: yesInternational Journal of Cloud Computing and Services Science (IJ-CLOSER), 2012
In this paper, we first modify the Smart-Vercauteren’s fully homomorphic encryption scheme [SV10] by applying self-loop bootstrappable technique. The security of the modified scheme only depends on the hardness of the polynomial coset problem, removing the assumption of the sparse subset sum problem in the original paper in [SV10].
openaire   +2 more sources

Machine learning we can trust: tensor algebra and the design of reliable foundation models

open access: yesAI Magazine, Volume 47, Issue 3, Fall 2026.
Abstract When an AI model answers our question, can we interrogate this particular answer and receive solid reasoning? Twenty‐four centuries ago, Socrates judged understanding not by how fluently someone spoke but by whether their claims survived questioning.
Grigorios G. Chrysos
wiley   +1 more source

Attribute-based fully homomorphic encryption scheme over rings

open access: yesTongxin xuebao, 2017
The fully homomorphic encryption has important applications in the area of data security and privacy security of cloud computing,but the size of secret keys and ciphertext in most of current homomorphic encryption schemes were too large,which restricted ...
Yong-hui ZHENG   +3 more
doaj   +2 more sources

A Lightweight and Erudite Automated BiLSTM‐Based Multi‐Cycle GAN for Retinal Blood Vessel and Optic Disc Segmentation in Fundus Images

open access: yesEngineering Reports, Volume 8, Issue 8, August 2026.
This graphical abstract presents a lightweight and automated BiLSTM‐based Multi‐Cycle GAN framework for retinal blood vessel and optic disc segmentation in fundus images. Initially, fundus images undergo preprocessing, including green channel extraction, denoising, resizing, and dataset splitting.
Rasmita Kumari Mohanty   +7 more
wiley   +1 more source

Shift-Type Homomorphic Encryption and Its Application to Fully Homomorphic Encryption

open access: yes, 2012
This work addresses the characterization of homomorphic encryption schemes both in terms of security and design. In particular, we are interested in currently existing fully homomorphic encryption (FHE) schemes and their common structures and security.
Armknecht, Frederik   +2 more
openaire   +4 more sources

Overflow-Detectable Floating-Point Fully Homomorphic Encryption

open access: yesIEEE Access
A floating-point fully homomorphic encryption (FPFHE) is proposed, which is based on torus fully homomorphic encryption equipped with programmable bootstrapping.
Seunghwan Lee, Dong-Joon Shin
doaj   +1 more source

FPGA-Based Hardware Accelerator for Leveled Ring-LWE Fully Homomorphic Encryption

open access: yesIEEE Access, 2020
Fully homomorphic encryption (FHE) allows arbitrary computation on encrypted data and has great potential in privacy-preserving cloud computing and securely outsource computational tasks.
Yang Su   +3 more
doaj   +1 more source

Maximal subgroups of free projection‐ and idempotent‐generated semigroups with applications to partition monoids

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract This paper investigates the maximal subgroups of a free projection‐generated regular ∗$*$‐semigroup PG(P)${{\textsf {PG}}}(P)$ over a projection algebra P$P$, and their relationship to the maximal subgroups of the free idempotent‐generated semigroup IG(E)${{\textsf {IG}}}(E)$ over the corresponding biordered set E=E(P)$E = {{\textsf {E}}}(P)$.
James East   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy