How to compress encrypted data
DOI10.1007/978-3-031-30545-0_19zbMATH Open1530.94029OpenAlexW4365936032MaRDI QIDQ6138101FDOQ6138101
Authors: Nils Fleischhacker, Kasper Green Larsen, Mark Simkin 
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30545-0_19
Information storage and retrieval of data (68P20) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Fully homomorphic encryption using ideal lattices
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- A Framework for Efficient and Composable Oblivious Transfer
- Fully homomorphic SIMD operations
- Noiseless coding of correlated information sources
- Packed ciphertexts in LWE-based homomorphic encryption
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Private computation on encrypted genomic data
- Private information retrieval with sublinear online time
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- On Compression of Data Encrypted With Block Ciphers
- Theory of Cryptography
- Oblivious message retrieval
This page was built for publication: How to compress encrypted data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138101)
