ProxCode: efficient proximity searchable encryption from error correcting codes

DOI10.1007/978-3-032-22931-1_2MaRDI QIDQ7348981zbMATH OpenFDO

Authors Maryam Rezapour, Benjamin Fuller

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22931-1_2

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Can we access a database both locally and privately?
• Comparison and combination of iris matchers for reliable personal authentication
• Computationally volume-hiding structured encryption
• scientific article; zbMATH DE number 1559561 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• Lower Bounds for Oblivious Near-Neighbor Search
• Multi-key searchable encryption, revisited
• Path ORAM
• Searchable Encryption
• Structured encryption and dynamic leakage suppression
• Structured encryption and leakage suppression

This page was built for publication: ProxCode: efficient proximity searchable encryption from error correcting codes

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