45 research outputs found
Improved Robustness and Versatility of Lattice-Based Cryptography
Current public key cryptosystems that are based on the hardness of integer factorization and discrete logarithm are insecure in the presence of large-scale quantum computers. Much effort has been devoted to replacing the quantum-insecure cryptosystems with newly developed "post-quantum" cryptosystem candidates, conjectured to be secure against quantum attack. Lattice-based cryptography has been widely recognized as a prominent candidate for practical post-quantum security.This dissertation improves the robustness and versatility of lattice-based cryptography through the following three contributions:
1. Chapter 3 introduces a constant-round protocol for unauthenticated group key exchange (i.e., with security against a passive eavesdropper). Group key exchange protocols allow a set of N parties to agree on a shared, secret key by communicating over a public network. Our protocol is based on the hardness of a lattice problem, which hence yields (plausible) post-quantum security.
2. In Chapter 4, we propose a framework for cryptanalysis of lattice-based schemes when certain types of information about the secret are leaked. Our framework generalizes the primal lattice reduction attack. The generalization allows for integrating the leaked information progressively before running a final lattice reduction step. Our framework can estimate the amount of security loss caused by the leaked information, and perform lattice reduction attacks with leaked
information when computationally feasible.
3. Chapter 5 introduces an approach towards a ring analogue of the Leftover Hash Lemma (LHL). The LHL is a mathematical tool often used in the analysis of various lattice-based cryptosystems, as well as their leakage-resilient
counterparts. However, it does not hold in the ring setting, which is typical for efficient cryptosystems. Lyubashevsky et al. (Eurocrypt '13) proved a "regularity lemma," which is used in the ring setting instead of the LHL; however, this applies only for centered, spherical Gaussian inputs, while the LHL applies when the input is drawn from any high min-entropy distribution. Our approach generalizes the "regularity lemma" of Lyubashevsky et al. to certain conditional distributions. A number of Ring-Learning with Errors based cryptosystems can achieve certain leakage resilience properties using our results
BKW Meets Fourier: New Algorithms for LPN with Sparse Parities
We consider the Learning Parity with Noise (LPN) problem with sparse secret, where the secret vector of dimension has Hamming weight at most . We are interested in algorithms with asymptotic improvement in the beyond the state of the art. Prior work in this setting presented algorithms with runtime for constant , obtaining a constant factor improvement over brute force search, which runs in time . We obtain the following results:
- We first consider the error rate setting, and in this case present a new algorithm that leverages a subroutine from the acclaimed BKW algorithm [Blum, Kalai, Wasserman, J.~ACM \u2703] as well as techniques from Fourier analysis for -biased distributions. Our algorithm achieves asymptotic improvement in the exponent compared to prior work, when the sparsity , where and . The runtime and sample complexity of this algorithm are approximately the same.
- We next consider the setting, where the error is subconstant. We present a new algorithm in this setting that requires only a number of samples and achieves asymptotic improvement in the exponent compared to prior work, when the sparsity and noise rate of and , for . To obtain the improvement in sample complexity, we create subsets of samples using the of Nisan and Wigderson [J.~Comput.~Syst.~Sci. \u2794], so that any two subsets have a small intersection, while the number of subsets is large. Each of these subsets is used to generate a single -biased sample for the Fourier analysis step. We then show that this allows us to bound the covariance of pairs of samples, which is sufficient for the Fourier analysis.
- Finally, we show that our first algorithm extends to the setting where the noise rate is very high , and in this case can be used as a subroutine to obtain new algorithms for learning DNFs and Juntas. Our algorithms achieve asymptotic improvement in the exponent for certain regimes. For DNFs of size with approximation factor this regime is when , and , for . For Juntas of the regime is when , and , for
Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience
We initiate the study of partial key exposure in ring-LWE-based cryptosystems.
Specifically, we
- Introduce the search and decision Leaky-RLWE assumptions (Leaky-SRLWE, Leaky-DRLWE), to formalize the hardness of search/decision RLWE under leakage of some fraction of coordinates of the NTT transform of the RLWE secret and/or error.
- Present and implement an efficient key exposure attack that, given certain -fraction of the coordinates of the NTT transform of the RLWE secret, along with RLWE instances,
recovers the full RLWE secret for standard parameter settings.
- Present a search-to-decision reduction for Leaky-RLWE for certain types of key exposure.
- Analyze the security of NewHope key exchange under partial key exposure of -fraction of the secrets and error.
We show that, assuming that Leaky-DRLWE is hard for these parameters, the shared key (which is then hashed using a random oracle) is computationally indistinguishable from a random variable with average min-entropy , conditioned on transcript and leakage, whereas without leakage the min-entropy is
On the Leakage Resilience of Ring-LWE Based Public Key Encryption
We consider the leakage resilience of the Ring-LWE analogue of the Dual-Regev encryption scheme (R-Dual-Regev for short), originally presented by Lyubashevsky et al.~(Eurocrypt \u2713). Specifically, we would like to determine whether the R-Dual-Regev encryption scheme remains IND-CPA secure, even in the case where an attacker leaks information about the secret key.
We consider the setting where is the ring of integers of the -th cyclotomic number field, for which is a power-of-two, and the Ring-LWE modulus is set to . This is the common setting used in practice and is desirable in terms of the efficiency and simplicity of the scheme. Unfortunately, in this setting is very far from being a field so standard techniques for proving leakage resilience in the general lattice setting, which rely on the leftover hash lemma, do not apply. Therefore, new techniques must be developed.
In this work, we put forth a high-level approach for proving the leakage resilience of the R-Dual-Regev scheme, by generalizing the original proof of Lyubashevsky et al.~(Eurocrypt \u2713). We then give three instantiations of our approach, proving that the R-Dual-Regev remains IND-CPA secure in the presence of three natural, non-adaptive leakage classes
Revisiting Security Estimation for LWE with Hints from a Geometric Perspective
The Distorted Bounded Distance Decoding Problem (DBDD) was introduced by Dachman-Soled et al. [Crypto â20] as an intermediate problem between LWE and unique-SVP (uSVP). They presented an approach that reduces an LWE instance to a DBDD instance, integrates side information (or âhintsâ) into the DBDD instance, and finally reduces it to a uSVP instance, which can be solved via lattice reduction. They showed that this principled approach can lead to algorithms for side-channel attacks that perform better than ad-hoc algorithms that do not rely on lattice reduction.
The current work focuses on new methods for integrating hints into a DBDD instance. We view hints from a geometric perspective, as opposed to the distributional perspective from the prior work. Our approach provides the rigorous promise that, as hints are integrated into the DBDD
instance, the correct solution remains a lattice point contained in the specified ellipsoid.
We instantiate our approach with two new types of hints: (1) Inequality hints, corresponding to the region of intersection of an ellipsoid and a halfspace; (2) Combined hints, corresponding to the region of intersection of two ellipsoids. Since the regions in (1) and (2) are not necessarily
ellipsoids, we replace them with ellipsoidal approximations that circumscribe the region of intersection. Perfect hints are reconsidered as the region of intersection of an ellipsoid and a hyperplane, which is itself an ellipsoid. The compatibility of âapproximate,â âmodular,â and âshort
vectorâ hints from the prior work is examined.
We apply our techniques to the decryption failure and side-channel attack settings. We show that âinequality hintsâ can be used to model decryption failures, and that our new approach yields a geometric analogue of the âfailure boostingâ technique of Dâanvers et al. [ePrint, â18]. We
also show that âcombined hintsâ can be used to fuse information from a decryption failure and a side-channel attack, and provide rigorous guarantees despite the data being non-Gaussian. We provide experimental data for both applications. The code that we have developed to implement the integration of hints and hardness estimates extends the Toolkit from prior work and has been released publicly
LWE with Side Information: Attacks and Concrete Security Estimation
We propose a framework for cryptanalysis of lattice-based schemes, when side information---in the form of ``hints\u27\u27--- about the secret and/or error is available.
Our framework generalizes the so-called primal lattice reduction attack, and allows the progressive integration of hints before running a final lattice reduction step.
Our techniques for integrating hints include sparsifying the lattice, projecting onto and intersecting with hyperplanes, and/or altering the distribution of the secret vector. Our main contribution is to propose a toolbox and a methodology to integrate such hints into lattice reduction attacks and to predict the performance of those lattice attacks with side information.
While initially designed for side-channel information, our framework can also be used in other cases: exploiting decryption failures, or simply exploiting constraints imposed by certain schemes (LAC, Round5, NTRU).
We implement a Sage 9.0 toolkit to actually mount such attacks with hints when computationally feasible, and to predict their performances on larger instances.
We provide several end-to-end application examples, such as an improvement of a single trace attack on Frodo by Bos et al (SAC 2018).
In particular, our work can estimates security loss even given very little side information, leading to a smooth measurement/computation trade-off for side-channel attacks
Recommended from our members
The Chinese version of obsessive compulsive drug use scale: validation in outpatient methadone maintenance treatment program
Funder: Guangci Professorship Program of Ruijin Hospital and Shanghai Jiao Tong University School of Medicine 2018 International and Hong Kong, Macao and Taiwan Regional Research Cooperation ProjectAbstract: Background: The Obsessive Compulsive Drug Use Scale (OCDUS) measures the overall craving level within a period from a multidimensional perspective. However, no studies have addressed the validity of the new OCDUS factor structure, presented in 2016, in China. Additionally, there is lack of evidence on the interaction among risk factors for relapse. We aimed to assess the psychometric properties of the scores of the Chinese version of the OCDUS in patients with heroin dependence receiving methadone maintenance treatment (MMT). Further, we aimed to assess the correlations of the OCDUS scores with withdrawal symptoms, depression, anxiety, and nicotine dependence. Methods: We enrolled 113 adults (age 32â64 years) and administered them with the OCDUS, Subjective Opioid Withdrawal Scale (SOWS), Beck Depression Inventory-II (BDI-II), State-Trait Anxiety Inventory (STAI), and Fagerstrom Test for Nicotine Dependence (FTND). Results: Exploratory factor analysis identified a 3-dimensional component that included âFrequency of craving,â âInference of heroin,â and âControl of heroin.â These factors showed acceptable internal consistency, adequate item-total correlations, and significant item-subscale correlations. There was no correlation between the OCUDS scores and age, education, duration of receiving MMT, and MMT dosages. However, there was a significant correlation between the OCDUS total scores and the SOWS, STAI, BDI-II, and FTND scores. The scores of all the subscales were associated with the SOWS scores; further, the scores of the first two subscales were associated with BDI-II scores while only the scores of the first subscale were associated with the FTND scores. Conclusions: Our findings support the reliability and structure validity of the OCDUS scores. Heroin craving, withdrawal symptoms, negative emotions, and nicotine dependence, which are considered as risk factors for heroin relapse, might interact with each other. There is a need for further studies on the underlying mechanism of these clinical phenomena
High-precision RNS-CKKS on fixed but smaller word-size architectures: theory and application
A prevalent issue in the residue number system (RNS) variant of the Cheon-Kim-Kim-Song (CKKS) homomorphic encryption (HE) scheme is the challenge of efficiently achieving high precision on hardware architectures with a fixed, yet smaller, word-size of bit-length , especially when the scaling factor satisfies .
In this work, we introduce an efficient solution termed composite scaling. In this approach, we group multiple RNS primes as such that for , and use each composite in the rescaling procedure as . Here, the number of primes, denoted by , is termed the composition degree. This strategy contrasts the traditional rescaling method in RNS-CKKS, where each is chosen as a single -bit prime, a method we designate as single scaling.
To achieve higher precision in single scaling, where , one would either need a novel hardware architecture with word size or would have to resort to relatively inefficient solutions rooted in multi-precision arithmetic. This problem, however, doesn\u27t arise in composite scaling. In the composite scaling approach, the larger the composition degree , the greater the precision attainable with RNS-CKKS across an extensive range of secure parameters tailored for workload deployment.
We have integrated composite scaling RNS-CKKS into both OpenFHE and Lattigo libraries. This integration was achieved via a concrete implementation of the method and its application to the most up-to-date workloads, specifically, logistic regression training and convolutional neural network inference. Our experiments demonstrate that single and composite scaling approaches are functionally equivalent, both theoretically and practically
Security Guidelines for Implementing Homomorphic Encryption
Fully Homomorphic Encryption (FHE) is a cryptographic primitive that allows performing arbitrary operations on encrypted data. Since the conception of the idea in [RAD78], it was considered a holy grail of cryptography. After the first construction in 2009 [Gen09], it has evolved to become a practical primitive with strong security guarantees. Most modern constructions are based on well-known lattice problems such as Learning with Errors (LWE). Besides its academic appeal, in recent years FHE has also attracted significant attention from industry, thanks to its applicability to a considerable number of real-world use-cases. An upcoming standardization effort by ISO/IEC aims to support the wider adoption of these techniques. However, one of the main challenges that standards bodies, developers, and end users usually encounter is establishing parameters. This is particularly hard in the case of FHE because the parameters are not only related to the security level of the system, but also to the type of operations that the system is able to handle. In this paper, we provide examples of parameter sets for LWE targeting particular security levels that can be used in the context of FHE constructions. We also give examples of complete FHE parameter sets, including the parameters relevant for correctness and performance, alongside those relevant for security. As an additional contribution, we survey the parameter selection support offered in open-source FHE libraries
(In)Security of Ring-LWE Under Partial Key Exposure
We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under leakage of some fraction of coordinates of the NTT transform of the RLWE secret. (2) Present and implement an efficient key exposure attack that, given certain 1/4-fraction of the coordinates of the NTT transform of the RLWE secret, along with samples from the RLWE distribution, recovers the full RLWE secret for standard parameter settings. (3) Present a search-to-decision reduction for Leaky R-LWE for certain types of key exposure. (4) Propose applications to the security analysis of RLWE-based cryptosystems under partial key exposure