Feb. 6, 2024, 5:10 a.m. | Neehar Verma Camilla Hollanti

cs.CR updates on arXiv.org arxiv.org

Private information retrieval from a single server is considered, utilizing random linear codes. Presented is a modified version of the first code-based single-server computational PIR scheme proposed by Holzbaur, Hollanti, and Wachter-Zeh in [Holzbaur et al., "Computational Code-Based Single-Server Private Information Retrieval", 2020 IEEE ISIT]. The original scheme was broken in [Bordage et al., "On the privacy of a code-based single-server computational PIR scheme", Cryptogr. Comm., 2021] by an attack arising from highly probable rank differences in sub-matrices of the …

attack code computational cs.cr cs.it ieee information linear math.it private query random server single version

DevSecOps Automation Engineer

@ Peraton | Offutt AFB, NE, United States

Privacy Officer - Engagement & Support

@ Nova Scotia Health Authority | Halifax, NS, CA, B3H 2Y9

Life Sciences Industry Consultant

@ Emerson | ENGLAND, United Kingdom

Consultant, Valuation Services

@ Kroll | Mumbai, India

OT Security Architect

@ Essar Oil (UK) Limited | Cheshire, GB, CH65 4HB

Senior Information Security Advisor (Cloud)

@ Scotiabank | Toronto, ON, CA, M1K5L1