Oblivious ciphertext compression via linear codes

DOI10.1007/978-3-032-25330-9_13MaRDI QIDQ7304146zbMATH OpenFDO

Authors Pascal Giorgi, Bruno Grenet, Mark Simkin

Publication date 24 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25330-9_13

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Distributed Point Functions and Their Applications
• Factoring Polynomials Over Large Finite Fields
• Fast transforms over finite fields of characteristic two
• FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes
• Function secret sharing
• How to compress encrypted data
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 1759771 (Why is no real title available?)
• scientific article; zbMATH DE number 2151179 (Why is no real title available?)
• Introduction to Coding Theory
• Invertible Bloom lookup tables with less memory and randomness
• Modern computer algebra
• Novel polynomial basis and its application to Reed-Solomon erasure codes
• Oblivious message retrieval
• On decoding BCH codes
• On fast multiplication of polynomials over arbitrary algebras
• Polynomial evaluation and interpolation on special sets of points
• Probabilistic Algorithms in Finite Fields

This page was built for publication: Oblivious ciphertext compression via linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304146)