Open AccessPosted Content
A Decade of Lattice Cryptography.
TL;DR: Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems as mentioned in this paper, which is the main feature of lattice cryptography.
read more
Abstract: Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems. Attractive features of lattice cryptography include apparent resistance to quantum attacks (in contrast with most number-theoretic cryptography), high asymptotic efficiency and parallelism, security under worst-case intractability assumptions, and solutions to long-standing open problems in cryptography. This work surveys most of the major developments in lattice cryptography over the past ten years. The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems (and their more efficient ring-based variants), their provable hardness assuming the worst-case intractability of standard lattice problems, and their many cryptographic applications.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
TL;DR: The basics of HE and the details of the well-known Partially Homomorphic Encryption and Somewhat Homomorphic encryption schemes, which are important pillars for achieving FHE, are presented and the implementations and recent improvements in Gentry-type FHE schemes are surveyed.
865
•Posted Content
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
TL;DR: The basics of HE and the details of the well-known Partially Homomorphic Encryption and Somewhat HomomorphicEncryption, which are important pillars of achieving FHE, are presented and the main FHE families, which have become the base for the other follow-up FHE schemes are presented.
765
•Book
Advances in Cryptology - CRYPTO 2006
Cynthia Dwork
- 01 Jan 2006
TL;DR: A new construction for private intersection sum with cardinality is presented that provides malicious security with abort and guarantees that both parties receive the output upon successful completion of the protocol.
400
Securing the Internet of Things in a Quantum World
TL;DR: The impacts of quantum computers on the security of the cryptographic schemes used today are demonstrated, and an overview of the recommendations for cryptographic schemes that can be secure under the attacks of both classical and quantum computers are given.
234
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption
Nikola Samardzic,Axel Feldmann,Aleksandar Krastev,Srinivas Devadas,Ronald G. Dreslinski,Chris Peikert,Daniel Sanchez +6 more
- 18 Oct 2021
TL;DR: F1 as discussed by the authors is the first FHE accelerator that is programmable, i.e., capable of executing full FHE programs, based on an in-depth architectural analysis of the characteristics of FHE computations that reveals acceleration opportunities.
References
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Brent Waters
- 19 Aug 2009
TL;DR: This work presents a new methodology for proving security of encryption systems using what it calls Dual System Encryption, and defines semi-functional keys and ciphertexts, which are the first HIBE system and the first IBE system with short parameters under simple assumptions.
Leveled) Fully Homomorphic Encryption without Bootstrapping
Zvika Brakerski,Craig Gentry,Vinod Vaikuntanathan +2 more
- 01 Jul 2014
TL;DR: A new way of constructing leveled, fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits of a-priori bounded depth), without Gentry’s bootstrapping procedure is presented.
•Posted Content
The Random Oracle Methodology, Revisited
TL;DR: In this paper, the authors take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the schemes that result from implementing the random oracle by so called "cryptographic hash functions".
1K
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
Adriana López-Alt,Eran Tromer,Vinod Vaikuntanathan +2 more
- 19 May 2012
TL;DR: In this article, the authors proposed a new notion of secure multiparty computation aided by a computationally-powerful but untrusted "cloud" server, where each user is involved only when initially uploading his (encrypted) data to the cloud, and in a final output decryption phase when outputs are revealed.
Candidate Multilinear Maps from Ideal Lattices
Sanjam Garg,Craig Gentry,Shai Halevi +2 more
- 26 May 2013
TL;DR: This work describes plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and shows an example application of such multi-linear maps that can be realized using the approximation.