{"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}
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.
期刊介绍:
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.