On Ideal Lattices and Learning with Errors over Rings

2010/01/01 by Vadim Lyubashevsky, Chris Peikert, Oded Regev · 6 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Cryptography and Data Security #Rings, Modules, and Algebras

paper · doi:10.1007/978-3-642-13190-5_1

crossref issued 2010/01/01 · crossref published 2010/01/01 · crossref published-print 2010/01/01 · openalex publication_date 2010/01/01 · crossref created 2010/05/19 · crossref deposited 2021/04/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04 · crossref indexed 2026/08/04

Citations

• On lattices, learning with errors, random linear codes, and cryptography

Cited by

• Truly Privacy-Preserving Federated Analytics for Precision Medicine with Multiparty Homomorphic Encryption
• (Leveled) fully homomorphic encryption without bootstrapping
• The Learning with Errors Problem (Invited Survey)
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
• Ideal lattice [wikipedia]