Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
From MaRDI portal
Publication:6499251
DOI10.1145/3564246.3585175WikidataQ130956299 ScholiaQ130956299MaRDI QIDQ6499251
Daniel Wichs, Wei-Kai Lin, Ethan Mook
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Can we access a database both locally and privately?
- Towards doubly efficient private information retrieval
- Yes, there is an oblivious RAM lower bound!
- Private information retrieval with sublinear online time
- OptORAMa: optimal oblivious RAM
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Single-server private information retrieval with sublinear amortized time
- Permuted puzzles and cryptographic hardness
- On the plausibility of fully homomorphic encryption for RAMs
- Private anonymous data access
- Worst-case to average-case reductions for module lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Fully Succinct Garbled RAM
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Garbled RAM From One-Way Functions
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fast Polynomial Factorization and Modular Composition
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Generalized Compact Knapsacks Are Collision Resistant
- Relations Among Complexity Measures
- Software protection and simulation on oblivious RAMs
- How to Garble RAM Programs?
- Pseudorandomness of ring-LWE for any ring and modulus
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Garbled RAM Revisited
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- Theory of Cryptography
- Collusion-resistant functional encryption for RAMs
This page was built for publication: Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
