对 "高斯 MAC 上的私人信息检索 "的更正

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Or Elimelech;Ori Shmuel;Asaf Cohen
{"title":"对 \"高斯 MAC 上的私人信息检索 \"的更正","authors":"Or Elimelech;Ori Shmuel;Asaf Cohen","doi":"10.1109/TIT.2024.3440476","DOIUrl":null,"url":null,"abstract":"In the above article \n<xref>[1]</xref>\n, the authors introduced a PIR scheme for the Additive White Gaussian Noise (AWGN) Multiple Access Channel (MAC), both with and without fading. The authors utilized the additive nature of the channel and leveraged the linear properties and structure of lattice codes to retrieve the desired message without the servers acquiring any knowledge about the retrieved message’s index. Theorems 3 and 4 in \n<xref>[1]</xref>\n contain an error arising from the incorrect usage of the modulo operator. Moreover, the proofs assume a one-to-one mapping function, \n<inline-formula> <tex-math>$\\phi (\\cdot)$ </tex-math></inline-formula>\n, between a message \n<inline-formula> <tex-math>$W_{j}\\in \\mathbb {F}_{p}^{L}$ </tex-math></inline-formula>\n and the elements of \n<inline-formula> <tex-math>$\\mathcal { C}$ </tex-math></inline-formula>\n, mistakenly suggesting that the user possesses all the required information in advance. To deal with that, we defined \n<inline-formula> <tex-math>$\\phi (\\cdot)$ </tex-math></inline-formula>\n as a one-to-one mapping function between a vector of \n<italic>l</i>\n information bits and a lattice point \n<inline-formula> <tex-math>$\\lambda \\in {\\mathcal { C}}$ </tex-math></inline-formula>\n. Herein, we present the corrected versions of these theorems.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 10","pages":"7521-7524"},"PeriodicalIF":2.2000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Corrections to “Private Information Retrieval Over Gaussian MAC”\",\"authors\":\"Or Elimelech;Ori Shmuel;Asaf Cohen\",\"doi\":\"10.1109/TIT.2024.3440476\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the above article \\n<xref>[1]</xref>\\n, the authors introduced a PIR scheme for the Additive White Gaussian Noise (AWGN) Multiple Access Channel (MAC), both with and without fading. The authors utilized the additive nature of the channel and leveraged the linear properties and structure of lattice codes to retrieve the desired message without the servers acquiring any knowledge about the retrieved message’s index. Theorems 3 and 4 in \\n<xref>[1]</xref>\\n contain an error arising from the incorrect usage of the modulo operator. Moreover, the proofs assume a one-to-one mapping function, \\n<inline-formula> <tex-math>$\\\\phi (\\\\cdot)$ </tex-math></inline-formula>\\n, between a message \\n<inline-formula> <tex-math>$W_{j}\\\\in \\\\mathbb {F}_{p}^{L}$ </tex-math></inline-formula>\\n and the elements of \\n<inline-formula> <tex-math>$\\\\mathcal { C}$ </tex-math></inline-formula>\\n, mistakenly suggesting that the user possesses all the required information in advance. To deal with that, we defined \\n<inline-formula> <tex-math>$\\\\phi (\\\\cdot)$ </tex-math></inline-formula>\\n as a one-to-one mapping function between a vector of \\n<italic>l</i>\\n information bits and a lattice point \\n<inline-formula> <tex-math>$\\\\lambda \\\\in {\\\\mathcal { C}}$ </tex-math></inline-formula>\\n. Herein, we present the corrected versions of these theorems.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"70 10\",\"pages\":\"7521-7524\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10630803/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10630803/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在上述文章[1]中,作者针对有衰落和无衰落的加性白高斯噪声(AWGN)多路访问信道(MAC)提出了一种 PIR 方案。作者利用信道的可加性和网格编码的线性特性和结构,在服务器不知道检索信息索引的情况下检索所需的信息。文献[1]中的定理 3 和 4 包含一个错误,该错误源于对 modulo 运算符的错误使用。此外,证明还假定在 \mathbb {F}_{p}^{L}$ 中的 $W_{j}\ 与 $\mathcal { C}$ 中的元素之间存在一个一一对应的映射函数 $\phi (\cdot)$ ,误以为用户事先掌握了所有需要的信息。为了解决这个问题,我们将 $\phi (\cdot)$ 定义为一个包含 l 个信息比特的向量与 {\mathcal { C}}$ 中的一个晶格点 $\lambda \ 之间的一一映射函数。 在此,我们提出了这些定理的修正版。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Corrections to “Private Information Retrieval Over Gaussian MAC”
In the above article [1] , the authors introduced a PIR scheme for the Additive White Gaussian Noise (AWGN) Multiple Access Channel (MAC), both with and without fading. The authors utilized the additive nature of the channel and leveraged the linear properties and structure of lattice codes to retrieve the desired message without the servers acquiring any knowledge about the retrieved message’s index. Theorems 3 and 4 in [1] contain an error arising from the incorrect usage of the modulo operator. Moreover, the proofs assume a one-to-one mapping function, $\phi (\cdot)$ , between a message $W_{j}\in \mathbb {F}_{p}^{L}$ and the elements of $\mathcal { C}$ , mistakenly suggesting that the user possesses all the required information in advance. To deal with that, we defined $\phi (\cdot)$ as a one-to-one mapping function between a vector of l information bits and a lattice point $\lambda \in {\mathcal { C}}$ . Herein, we present the corrected versions of these theorems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信