-
Article
Open AccessHarnessing the potential of shared data in a secure, inclusive, and resilient manner via multi-key homomorphic encryption
In this manuscript, we develop a multi-party framework tailored for multiple data contributors seeking machine learning insights from combined data sources. Grounded in statistical learning principles, we intr...
-
Article
Open AccessOn the Concrete Security of LWE With Small Secret
Lattice-based cryptography is currently under consideration for standardization in the ongoing NIST PQC Post-Quantum Cryptography competition, and is used as the basis for Homomorphic Encryption schemes world-...
-
Chapter and Conference Paper
Towards Practical Multi-key TFHE: Parallelizable, Key-Compatible, Quasi-linear Complexity
Multi-key homomorphic encryption is a generalized notion of homomorphic encryption supporting arbitrary computation on ciphertexts, possibly encrypted under different keys. In this paper, we revisit the work o...
-
Chapter and Conference Paper
A General Framework of Homomorphic Encryption for Multiple Parties with Non-interactive Key-Aggregation
Homomorphic Encryption (HE) is a useful primitive for secure computation, but it is not generally applicable when multiple parties are involved, as the authority is solely concentrated in a single party, the s...
-
Chapter and Conference Paper
Accelerating HE Operations from Key Decomposition Technique
Lattice-based homomorphic encryption (HE) schemes are based on the noisy encryption technique, where plaintexts are masked with some random noise for security. Recent advanced HE schemes rely on a decompositio...
-
Chapter and Conference Paper
Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE
In the last decade, zero-knowledge proof of knowledge protocols have been extensively studied to achieve active security of various cryptographic protocols. However, the existing solutions simply seek zero-kno...
-
Chapter
Correction to: Introduction to Homomorphic Encryption and Schemes
The original version of this book has been revised because it was inadvertently published with the following errors which have now been updated.
-
Chapter and Conference Paper
Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts
In the past few years, significant progress on homomorphic encryption (HE) has been made toward both theory and practice. The most promising HE schemes are based on the hardness of the Learning With Errors (LW...
-
Chapter and Conference Paper
Lattice-Based Secure Biometric Authentication for Hamming Distance
Biometric authentication is a protocol which verifies a user’s authority by comparing her biometric with the pre-enrolled biometric template stored in the server. Biometric authentication is convenient and rel...
-
Chapter
Introduction to Homomorphic Encryption and Schemes
Homomorphic encryption (HE) enables processing encrypted data without decrypting it. This technology can be used, for example, to allow a public cloud to operate on secret data without the cloud learning anyth...
-
Article
Open AccessSemi-Parallel logistic regression for GWAS on encrypted data
The sharing of biomedical data is crucial to enable scientific discoveries across institutions and improve health care. For example, genome-wide association studies (GWAS) based on a large number of samples ca...
-
Chapter and Conference Paper
Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning
Computing on data in a manner that preserve the privacy is of growing importance. Multi-Party Computation (MPC) and Homomorphic Encryption (HE) are two cryptographic techniques for privacy-preserving computati...
-
Chapter and Conference Paper
Multi-Key Homomorphic Encryption from TFHE
In this paper, we propose a Multi-Key Homomorphic Encryption (MKHE) scheme by generalizing the low-latency homomorphic encryption by Chillotti et al. (ASIACRYPT 2016). Our scheme can evaluate a binary gate on ...
-
Chapter and Conference Paper
A Full RNS Variant of Approximate Homomorphic Encryption
The technology of Homomorphic Encryption (HE) has improved rapidly in a few years. The newest HE libraries are efficient enough to use in practical applications. For example, Cheon et al. (ASIACRYPT’17) propos...
-
Chapter and Conference Paper
Improved Bootstrap** for Approximate Homomorphic Encryption
Since Cheon et al. introduced a homomorphic encryption scheme for approximate arithmetic (Asiacrypt ’17), it has been recognized as suitable for important real-life usecases of homomorphic encryption, includin...
-
Chapter and Conference Paper
Approximate Homomorphic Encryption over the Conjugate-Invariant Ring
The Ring Learning with Errors (RLWE) problem over a cyclotomic ring has been the most widely used hardness assumption for the construction of practical homomorphic encryption schemes. However, this restricted ...
-
Article
Open AccessLogistic regression model training based on the approximate homomorphic encryption
Security concerns have been raised since big data became a prominent tool in data analysis. For instance, many machine learning algorithms aim to generate prediction models using training data which contain se...
-
Chapter and Conference Paper
Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR
The LWE problem has been widely used in many constructions for post-quantum cryptography due to its reduction from the worst-case of lattice hard problems and the lightweight operations for generating its inst...
-
Chapter and Conference Paper
Bootstrap** for Approximate Homomorphic Encryption
This paper extends the leveled homomorphic encryption scheme for an approximate arithmetic of Cheon et al. (ASIACRYPT 2017) to a fully homomorphic encryption, i.e., we propose a new technique to refresh low-le...
-
Article
Open AccessSecure searching of biomarkers through hybrid homomorphic encryption scheme
As genome sequencing technology develops rapidly, there has lately been an increasing need to keep genomic data secure even when stored in the cloud and still used for research. We are interested in designing ...
