Post-Quantum Cryptography
13th International Workshop, PQCrypto 2022, Virtual Event, September 28–30, 2022, Proceedings
Page
%P
-
Chapter and Conference Paper
Bootstrap** Bits with CKKS
The Cheon–Kim–Kim–Song (CKKS) fully homomorphic encryption scheme is designed to efficiently perform computations on real numbers in an encrypted state. Recently, Drucker et al [J. Cryptol.] proposed an efficient...
-
Chapter and Conference Paper
SMAUG: Pushing Lattice-Based Key Encapsulation Mechanisms to the Limits
Recently, NIST has announced Kyber, a lattice-based key encapsulation mechanism (KEM), as a post-quantum standard. However, it is not the most efficient scheme among the NIST’s KEM finalists. Saber enjoys more...
-
Chapter and Conference Paper
HERMES: Efficient Ring Packing Using MLWE Ciphertexts and Application to Transciphering
Most of the current fully homomorphic encryption (FHE) schemes are based on either the learning-with-errors (LWE) problem or on its ring variant (RLWE) for storing plaintexts. During the homomorphic computatio...
-
Article
Efficient verifiable computation over quotient polynomial rings
In a situation where computation and data are delegated to the third party, e.g., in cloud computing services, securing both data privacy and computation integrity simultaneously has been a challenging problem...
-
Article
Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
A weak pseudorandom function (weak PRF) is one of the most important cryptographic primitives for its efficiency although it has lower security than a standard PRF. Recently, Boneh et al. (in: Theory of crypto...
-
Article
Open AccessSecure tumor classification by shallow neural network using homomorphic encryption
Disclosure of patients’ genetic information in the process of applying machine learning techniques for tumor classification hinders the privacy of personal information. Homomorphic Encryption (HE), which suppo...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Limits of Polynomial Packings for \(\mathbb {Z}_{p^k}\) and \(\mathbb {F}_{p^k}\)
We formally define polynomial packing methods and initiate a unified study of related concepts in various contexts of cryptography. This includes homomorphic encryption (HE) packing and reverse multiplication-...
-
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
MHz2k: MPC from HE over \(\mathbb {Z}_{2^k}\) with New Packing, Simpler Reshare, and Better ZKP
We propose a multi-party computation (MPC) protocol over \(\mathbb {Z}_{2^k}\) ...
-
Chapter and Conference Paper
Adventures in Crypto Dark Matter: Attacks and Fixes for Weak Pseudorandom Functions
A weak pseudorandom function (weak PRF) is one of the most important cryptographic primitives for its efficiency although it has lower security than a standard PRF.
-
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...
-
Book and Conference Proceedings
Post-Quantum Cryptography
12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20–22, 2021, Proceedings
-
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 AccessPrivacy-preserving approximate GWAS computation based on homomorphic encryption
One of three tasks in a secure genome analysis competition called iDASH 2018 was to develop a solution for privacy-preserving GWAS computation based on homomorphic encryption. The scenario is that a data holde...
-
Chapter and Conference Paper
Efficient Homomorphic Comparison Methods with Optimal Complexity
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 encryption (HE) which basically support...
-
Chapter and Conference Paper
Efficient Identity-Based Encryption from LWR
The Learning with Rounding (LWR) problem is a deterministic variant of the classical Learning with Errors (LWE) problem, for which sampling an instance does not involve discrete Gaussian sampling. We propose t...
-
Chapter and Conference Paper
Faster Bootstrap** of FHE over the Integers
In FHE over the integers, decryption function is simplified by sparse subset subset sum problem (SSSP) assumption, which is introduced by Dijk et al. (Eurocrypt 2010), so that bootstrap** can be achieved suc...
-
Chapter and Conference Paper
Towards a Practical Cluster Analysis over Encrypted Data
Cluster analysis is one of the most significant unsupervised machine learning methods, and it is being utilized in various fields associated with privacy issues including bioinformatics, finance and image proc...
-
Article
Open AccessA secure SNP panel scheme using homomorphically encrypted K-mers without SNP calling on the user side
Single Nucleotide Polymorphism (SNP) in the genome has become crucial information for clinical use. For example, the targeted cancer therapy is primarily based on the information which clinically important SNP...
