How to compress encrypted data
From MaRDI portal
Publication:6138101
DOI10.1007/978-3-031-30545-0_19zbMath1530.94029OpenAlexW4365936032MaRDI QIDQ6138101
Kasper Green Larsen, Mark Simkin, Nils Fleischhacker
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
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Private information retrieval with sublinear online time
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- Fully homomorphic SIMD operations
- Private Computation on Encrypted Genomic Data
- On Compression of Data Encrypted With Block Ciphers
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- A Framework for Efficient and Composable Oblivious Transfer
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Advances in Cryptology - EUROCRYPT 2004
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Noiseless coding of correlated information sources
- Compressed sensing
- Theory of Cryptography
- Oblivious message retrieval
This page was built for publication: How to compress encrypted data
