Integer-Wise Functional Bootstrapping on TFHE: Applications in Secure Integer Arithmetics
Information (Switzerland), 2021 TFHE is a fast fully homomorphic encryption scheme proposed by Chillotti et al. in Asiacrypt’ 2018. Integer-wise TFHE is a generalized version of TFHE that can encrypt the plaintext of an integer that was implicitly presented by Chillotti et al., and ...
Hiroki Okada
exaly +3 more sources
Efficient TFHE Bootstrapping in the Multiparty Setting
IEEE Access, 2023 TFHE is a practical fully homomorphic encryption scheme (FHE) capable of computing any boolean gate or non-linear function. The scheme was originally designed to work for the single key setting.
Jeongeun Park, Sergi Rovira
exaly +3 more sources
A privacy preserving machine learning framework for medical image analysis using quantized fully connected neural networks with TFHE based inference [PDF]
Scientific ReportsMedical image analysis using deep learning algorithms has become a basis of modern healthcare, enabling early detection, diagnosis, treatment planning, and disease monitoring.
Sadhana Selvakumar, B. Senthilkumar
doaj +2 more sources
Privacy-preserving semi-parallel logistic regression training with fully homomorphic encryption [PDF]
BMC Medical Genomics, 2020 Background Privacy-preserving computations on genomic data, and more generally on medical data, is a critical path technology for innovative, life-saving research to positively and equally impact the global population.
Sergiu Carpov +3 more
doaj +2 more sources
An NVMe-Based Secure Computing Platform With FPGA-Based TFHE Accelerator
IEEE AccessIn this study, we introduce a new approach to secure computing by implementing a platform that utilizes a non-volatile memory express (NVMe)-based system with an FPGA-based Torus fully homomorphic encryption (TFHE) accelerator, solid state drive (SSD ...
Tomoya Sanuki +2 more
exaly +3 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
Revisiting the functional bootstrap in TFHE
Transactions on Cryptographic Hardware and Embedded Systems, 2021 The FHEW cryptosystem introduced the idea that an arbitrary function can be evaluated within the bootstrap procedure as a table lookup. The faster bootstraps of TFHE strengthened this approach, which was later named Functional Bootstrap (Boura et al ...
Antonio Guimarães +2 more
doaj +1 more source
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
Transactions on Cryptographic Hardware and Embedded Systems, 2022 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
Journal of Mathematical Cryptology, 2020 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
Cloud-Assisted Private Set Intersection via Multi-Key Fully Homomorphic Encryption
Mathematics, 2023 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