Oblivious message retrieval

DOI10.1007/978-3-031-15802-5_26MaRDI QIDQ6097269zbMATH OpenOpenAlexFDO

Authors Zeyu Liu, Eran Tromer

Publication date 12 June 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15802-5_26

zbMATH Keywords

anonymous message delivery systemsfully homomorphic encryptionhomomorphically-encoded sparse random linear codesuntrusted servers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• OnionPIR: effective protection of sensitive metadata in online communication networks
• scientific article; zbMATH DE number 1893214
• Information Security
• An airdrop that preserves recipient privacy
• Conditional Oblivious Transfer and Timed-Release Encryption

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A Framework for Efficient and Composable Oblivious Transfer
• FHEW: bootstrapping homomorphic encryption in less than a second
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Private Searching on Streaming Data
• Private stream search at almost the same communication cost as a regular search
• TFHE: fast fully homomorphic encryption over the torus

Cited in

(10)

• An airdrop that preserves recipient privacy
• The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees?
• How to compress encrypted data
• Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
• Somewhat homomorphic encryption from linear homomorphism and sparse LPN
• Lattice-based multi-message multi-recipient KEM/PKE with malicious security
• Multi-server doubly efficient PIR in the classical model and beyond
• Invertible Bloom lookup tables with less memory and randomness
• HERDS: multi-key fully homomorphic encryption with sublinear bootstrapping
• Oblivious ciphertext compression via linear codes

This page was built for publication: Oblivious message retrieval

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