arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.26409cs.CRcs.ITmath.IT
收藏

基于环上线性码的PIR方案的密码分析

Cryptanalysis of a PIR Scheme based on Linear Codes over Rings

Institute of Communications and Navigation, German Aerospace Center (DLR)(德国航空航天中心通信与导航研究所);Technical University of Munich, Germany(慕尼黑工业大学)

Luana Kurmann, Svenja Lage, Violetta Weger

AI总结:

本文提出一种针对基于环上线性码的PIR方案的攻击方法,通过利用有限环上随机码的自由性质及查询矩阵行空间维度变化特性,实现高概率多项式时间内获取目标文件索引。

摘要:

在本文中,我们提出了一种针对最近提出的基于码的私有信息检索(PIR)方案的攻击方法。实际上,服务器可以以高概率在多项式时间内检索到所需文件的索引。该攻击依赖于随机码在有限环上以高概率自由以及当移除对应目标索引的行时,查询矩阵的行空间维度减小的性质。

英文摘要:

In this paper we present an attack on a recently proposed code-based Private Information Retrieval (PIR) scheme. Indeed, the server can retrieve the index of the desired file with high probability in polynomial time. The attack relies on the fact that random codes over finite rings are free with high probability and that the dimension of the rowspan of the query matrix decreases when the rows corresponding to the desired index are removed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑