JOURNAL ARTICLE

Single server private information retrieval protocols with codes over rings.

  • Published In: Journal of Algebra & Its Applications, 2025, v. 24, n. 13/14. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Bodur, Şeyma; Martínez-Moro, Edgar; Ruano, Diego 3 of 3

Abstract

A Private Information Retrieval (PIR) protocol based on coding theory for a single server is proposed. It provides computational security against linear algebra attacks, addressing the main drawback of previous PIR proposals based on coding theory. The approach involves two types of codes each one over a different ring, an inner nonfree linear code that will be used as a distinguisher of some elements added to the query matrix, and an outer code that will be used for generating the query matrix. Moreover, it only uses modular arithmetic at the server level and the recovering stage if the base ring chosen for the inner code is ℤ m . [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Journal of Algebra & Its Applications. 2025/11, Vol. 24, Issue 13/14, p1
  • Document Type:Article
  • Subject Area:Computer Science
  • Publication Date:2025
  • ISSN:0219-4988
  • DOI:10.1142/S0219498825410129
  • Accession Number:189646239
  • Copyright Statement:Copyright of Journal of Algebra & Its Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.