Results 11 to 20 of about 18,513 (227)
Towards GPU Accelerated FHE Computations [PDF]
2024 IEEE International Conference on Cyber Security and Resilience (CSR)Fully homomorphic encryption (FHE) enables processing encrypted data without revealing sensitive information, making it applicable in fields like healthcare, finance, and legal. Despite its benefits, FHE has high computational complexity and performance overhead.
Papadakis, Orion +6 more
core +17 more sources
Maliciously Circuit-Private FHE [PDF]
, 2014 We present a framework for transforming FHE (fully homomorphic encryption) schemes with no circuit privacy requirements into maliciously circuit-private FHE. That is, even if both maliciously formed public key and ciphertext are used, encrypted outputs only reveal the evaluation of the circuit on some well-formed input x*.
Rafail Ostrovsky +2 more
core +6 more sources
Sanitization of FHE Ciphertexts [PDF]
, 2016 By definition, fully homomorphic encryption FHE schemes support homomorphic decryption, and all known FHE constructions are bootstrapped from a Somewhat Homomorphic Encryption SHE scheme via this technique. Additionally, when a public key is provided, ciphertexts are also re-randomizable, e.g., by adding to them fresh encryptions ofi¾?0. From those two
Léo Ducas, Damien Stehlé
openaire +6 more sources
CCA1 secure FHE from PIO, revisited
Cybersecurity, 2018 Fully data using only public information. So far, most FHE schemes are CPA secure. In PKC 2017, Canetti et al. extended the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE ...
Biao Wang, Xueqing Wang, Rui Xue
doaj +2 more sources
Dynamic Model Selection in a Hybrid Ensemble Framework for Robust Photovoltaic Power Forecasting [PDF]
SensorsAs global electricity demand increases and concerns over fossil fuel usage intensify, renewable energy sources have gained significant attention. Solar energy stands out due to its low installation costs and suitability for deployment.
Nakhun Song +3 more
doaj +2 more sources
FHE Over the Integers and Modular Arithmetic Circuits [PDF]
Lecture Notes in Computer Science, 2016 Fully homomorphic encryption (FHE) over the integers, as proposed by van Dijk et al . in 2010 and developed in a number of papers afterwards, originally supported the evaluation of Boolean circuits (i.e. mod‐2 arithmetic circuits) only.
Mehdi Tibouchi
exaly +3 more sources
FINAL: Faster FHE instantiated with NTRU and LWE
IACR Cryptology ePrint Archive, 2022 sponsorship: We would like to thank Leo Ducas for helpful discussions about the security of the NTRU problem. This work has been supported in part by ERC Advanced Grant ERC-2015-AdG-IMPaCT, by the Research Foundation -Flanders (FWO) under an Odysseus project GOH9718N and a Junior Postdoctoral Fellowship, by CyberSecurity Research Flanders with ...
Charlotte Bonte +4 more
semanticscholar +3 more sources
DARTPHROG: A Superscalar Homomorphic Accelerator [PDF]
SensorsFully Homomorphic Encryption (FHE) allows a client to share their data with an external server without ever exposing their data. FHE serves as a potential solution for data breaches and the marketing of users’ private data.
Alexander Magyari, Yuhua Chen
doaj +2 more sources
Quantum FHE (Almost) As Secure As Classical [PDF]
, 2018 Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without decrypting it first. In Quantum FHE (QFHE) we may want to apply an arbitrary quantumly efficient computation to (classical or quantum) encrypted data.
Zvika Brakerski
core +4 more sources
How to Construct Quantum FHE, Generically
IACR Cryptology ePrint ArchiveWe construct a (compact) quantum fully homomorphic encryption (QFHE) scheme starting from (compact) classical fully homomorphic encryption scheme with decryption in $\mathsf{NC}^{1}$, together with a dual-mode trapdoor function family.
A. Gupte, Vinod Vaikuntanathan
semanticscholar +6 more sources