How to compress encrypted data

DOI10.1007/978-3-031-30545-0_19MaRDI QIDQ6138101zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asymptotically optimal compression rateinvertible bloom lookup tablessparse polynomials

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Recommendations

• Compressible FHE with applications to PIR
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• scientific article; zbMATH DE number 6906814
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• Compress multiple ciphertexts using ElGamal encryption schemes

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• Advances in Cryptology - EUROCRYPT 2004
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Compressed sensing
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic SIMD operations
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Noiseless coding of correlated information sources
• Oblivious message retrieval
• On Compression of Data Encrypted With Block Ciphers
• 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
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Theory of Cryptography

Cited in

(2)

• Invertible Bloom lookup tables with less memory and randomness
• Oblivious ciphertext compression via linear codes

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)