Compressible FHE with applications to PIR
From MaRDI portal
Publication:2175949
DOI10.1007/978-3-030-36033-7_17zbMath1455.94158OpenAlexW2989911901MaRDI QIDQ2175949
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_17
Related Items (18)
Deniable fully homomorphic encryption from learning with errors ⋮ Asymptotically quasi-optimal cryptography ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Batch-OT with optimal rate ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Algebraic restriction codes and their applications ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ A framework for statistically sender private OT with optimal rate ⋮ Error correction and ciphertext quantization in lattice cryptography ⋮ Multi-client oblivious RAM with poly-logarithmic communication ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Trapdoor hash functions and their applications
- Fully homomorphic SIMD operations
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice-based FHE as secure as PKE
- On Compression of Data Encrypted With Block Ciphers
- New Algorithms for Learning in Presence of Errors
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Fully Homomorphic Encryption over the Integers
- A Framework for Efficient and Composable Oblivious Transfer
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Homomorphic Encryption
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- A Simpler Rate-Optimal CPIR Protocol
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Compressible FHE with applications to PIR