2022 IEEE International Symposium on Information Theory (ISIT)最新文献_第2页

Covert Communication in the Presence of an Uninformed, Informed, and Coordinated Jammer 在不知情、知情和协调干扰机存在下的秘密通信

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834682

Hassan ZivariFard, M. Bloch, Aria Nosratinia

{"title":"Covert Communication in the Presence of an Uninformed, Informed, and Coordinated Jammer","authors":"Hassan ZivariFard, M. Bloch, Aria Nosratinia","doi":"10.1109/ISIT50566.2022.9834682","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834682","url":null,"abstract":"This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. This paper investigates covert communication in the presence of a cooperative jammer. Covert communication refers to the inability of an adversary to distinguish data transmission from a so-called innocent symbol at the input. We consider three related problems: (1) a jammer without direct communication or coordination with the transmitter, (2) a jammer that cribs the output of the transmitter, and (3) a jammer that is able to coordinate with the transmitter via a secret key that is also shared with the legitimate receiver. For each model, we derive inner and outer bounds on the capacity region that are tight in some special cases. Unlike prior results in the literature, the jammer in our model does not have access to unlimited local randomness. In fact, uncovering the fundamental interplay between the covert communication rate, local randomness, and secret key rate, is one of the distinctions and contributions of the present work. In the context of a few specific channels, we calculate achievable covert rates to illuminate our results.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

New Family of Cross Z-Complementary Sequences With Large ZCZ Width 具有大ZCZ宽度的交叉z互补序列新家族

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834651

Shibsankar Das, Adrish Banerjee, Zilong Liu

引用次数: 1

Space Time Codes in Multi-Antenna Coded Caching Systems 多天线编码缓存系统中的空时码

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834484

A. Mahesh, B. Rajan

引用次数: 0

Can we break the dependency in distributed detection? 我们能否打破分布式检测中的依赖关系?

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834790

Osama A. Hanna, Xinlin Li, C. Fragouli, S. Diggavi

引用次数: 2

Fully Analog Noise-Resilient Dynamical Systems Storing Binary Sequence 存储二进制序列的全模拟噪声弹性动力系统

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834448

T. Wadayama

引用次数: 1

Analysis of Non-Binary High-Rate Repetition-Parity-Parity Codes Over the BEC BEC上非二进制高速率重复奇偶校验码的分析

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834620

I. Andriyanova, C. Poulliat

引用次数: 0

Strong Data Processing Inequalities via Sums of Squares 通过平方和处理强数据不等式

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834406

Oisin Faust, Hamza Fawzi

引用次数: 2

Gaussian Data Privacy Under Linear Function Recoverability 线性函数可恢复性下的高斯数据隐私

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834525

Ajaykrishnan Nageswaran

引用次数: 0

Information Theoretic Private Inference in Quantized Models 量化模型中的信息论私有推理

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834464

Netanel Raviv, Rawad Bitar, Eitan Yaakobi

{"title":"Information Theoretic Private Inference in Quantized Models","authors":"Netanel Raviv, Rawad Bitar, Eitan Yaakobi","doi":"10.1109/ISIT50566.2022.9834464","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834464","url":null,"abstract":"In a Private Inference scenario, a server holds a model (e.g., a neural network), a user holds data, and the user wishes to apply the model on her data. The privacy of both parties must be protected; the user’s data might contain confidential information, and the server’s model is his intellectual property.Private inference has been studied extensively in recent years, mostly from a cryptographic perspective by incorporating homo-morphic encryption and multiparty computation protocols, which incur high computational overhead and degrade the accuracy of the model. In this work we take a perpendicular approach which draws inspiration from the expansive Private Information Retrieval literature. We view private inference as the task of retrieving an inner product of a parameter vector with the data, a fundamental step in most machine learning models.By combining binary arithmetic with real-valued one, we present a scheme which enables the retrieval of the inner product for models whose weights are either binarized, or given in fixed-point representation; such models gained increased attention recently, due to their ease of implementation and increased robustness. We also present a fundamental trade-off between the privacy of the user and that of the server, and show that our scheme is optimal in this sense. Our scheme is simple, universal to a large family of models, provides clear information-theoretic guarantees to both parties with zero accuracy loss, and in addition, is compatible with continuous data distributions and allows infinite precision.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123909564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Analysis of an Age-Dependent Stochastic Hybrid System 年龄相关随机混合系统的分析

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834502

A. Maatouk, M. Assaad, A. Ephremides

引用次数: 5