Craterlake: a hardware accelerator for efficient unbounded computation on encrypted data
Fully Homomorphic Encryption (FHE) enables offloading computation to untrusted servers
with cryptographic privacy. Despite its attractive security, FHE is not yet widely adopted due …
with cryptographic privacy. Despite its attractive security, FHE is not yet widely adopted due …
Secure outsourced matrix computation and application to neural networks
Homomorphic Encryption (HE) is a powerful cryptographic primitive to address privacy and
security issues in outsourcing computation on sensitive data to an untrusted computation …
security issues in outsourcing computation on sensitive data to an untrusted computation …
Programmable bootstrapping enables efficient homomorphic inference of deep neural networks
I Chillotti, M Joye, P Paillier - … Symposium, CSCML 2021, Be'er Sheva …, 2021 - Springer
In many cases, machine learning and privacy are perceived to be at odds. Privacy concerns
are especially relevant when the involved data are sensitive. This paper deals with the …
are especially relevant when the involved data are sensitive. This paper deals with the …
SoK: Fully homomorphic encryption compilers
Fully Homomorphic Encryption (FHE) allows a third party to perform arbitrary computations
on encrypted data, learning neither the inputs nor the computation results. Hence, it provides …
on encrypted data, learning neither the inputs nor the computation results. Hence, it provides …
Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference
Homomorphic Encryption (HE) is a cryptosystem which supports computation on encrypted
data. Ló pez-Alt et al.(STOC 2012) proposed a generalized notion of HE, called Multi-Key …
data. Ló pez-Alt et al.(STOC 2012) proposed a generalized notion of HE, called Multi-Key …
Better bootstrapping for approximate homomorphic encryption
K Han, D Ki - Cryptographers' Track at the RSA Conference, 2020 - Springer
Abstract After Cheon et al.(Asiacrypt'17) proposed an approximate homomorphic encryption
scheme, HEAAN, for operations between encrypted real (or complex) numbers, the scheme …
scheme, HEAAN, for operations between encrypted real (or complex) numbers, the scheme …
Efficient homomorphic comparison methods with optimal complexity
Abstract Comparison of two numbers is one of the most frequently used operations, but it
has been a challenging task to efficiently compute the comparison function in homomorphic …
has been a challenging task to efficiently compute the comparison function in homomorphic …
Revisiting homomorphic encryption schemes for finite fields
Abstract The Brakerski-Gentry-Vaikuntanathan (BGV) and Brakerski/Fan-Vercauteren (BFV)
schemes are the two main homomorphic encryption (HE) schemes to perform exact …
schemes are the two main homomorphic encryption (HE) schemes to perform exact …
High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
Abstract The Cheon-Kim-Kim-Song (CKKS) scheme (Asiacrypt'17) is one of the most
promising homomorphic encryption (HE) schemes as it enables privacy-preserving …
promising homomorphic encryption (HE) schemes as it enables privacy-preserving …
Approximate homomorphic encryption with reduced approximation error
Abstract The Cheon-Kim-Kim-Song (CKKS) homomorphic encryption scheme is currently
the most efficient method to perform approximate homomorphic computations over real and …
the most efficient method to perform approximate homomorphic computations over real and …