{"ID":2895027,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.10730","arxiv_id":"2507.10730","title":"Access Control for Information-Theoretically Secure Key-Document Stores","abstract":"This paper presents a novel key-based access control technique for secure outsourcing key-value stores where values correspond to documents that are indexed and accessed using keys. The proposed approach adopts Shamir's secret-sharing that offers unconditional or information-theoretic security. It supports keyword-based document retrieval while preventing leakage of the data, access rights of users, or the size (\\textit{i}.\\textit{e}., volume of the output that satisfies a query). The proposed approach allows servers to detect (and abort) malicious clients from gaining unauthorized access to data, and prevents malicious servers from altering data undetected while ensuring efficient access -- it takes 231.5ms over 5,000 keywords across 500,000 files.","short_abstract":"This paper presents a novel key-based access control technique for secure outsourcing key-value stores where values correspond to documents that are indexed and accessed using keys. The proposed approach adopts Shamir's secret-sharing that offers unconditional or information-theoretic security. It supports keyword-base...","url_abs":"https://arxiv.org/abs/2507.10730","url_pdf":"https://arxiv.org/pdf/2507.10730v1","authors":"[\"Yin Li\",\"Sharad Mehrota\",\"Shantanu Sharma\",\"Komal Kumari\"]","published":"2025-07-14T18:51:20Z","proceeding":"cs.CR","tasks":"[\"cs.CR\",\"cs.DB\",\"cs.DC\",\"cs.DS\",\"cs.IR\"]","methods":"[]","has_code":false}