发布求助
文献互助 智能选刊 最新文献

2021 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Privacy-Utility Trade-off with the Stratonovich’s Value of Information 信息价值的隐私效用权衡
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611484
Akira Kamatsuka, Takahiro Yoshida, T. Matsushima
{"title":"Privacy-Utility Trade-off with the Stratonovich’s Value of Information","authors":"Akira Kamatsuka, Takahiro Yoshida, T. Matsushima","doi":"10.1109/ITW48936.2021.9611484","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611484","url":null,"abstract":"We consider the problem of publishing data with utility and privacy guarantees in a statistical decision-theoretical framework. In this framework, we introduce a statistical decision-theoretic quantity called average gain for measuring not only privacy but also utility. We also show a relationship between the average gain and the $alpha$-leakage, a tunable leakage measure proposed by Liao et at. Moreover, we formulate the privacyutility trade-off (PUT) problem using Stratonovich’s value of information (VoI) and present an analysis of the PUT.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115953547","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}
引用次数: 2
Streaming Codes for Handling a Combination of Burst and Random Erasures 处理突发和随机擦除组合的流代码
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611442
Shobhit Bhatnagar, Biswadip Chakraborti, P. V. Kumar
{"title":"Streaming Codes for Handling a Combination of Burst and Random Erasures","authors":"Shobhit Bhatnagar, Biswadip Chakraborti, P. V. Kumar","doi":"10.1109/ITW48936.2021.9611442","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611442","url":null,"abstract":"Streaming codes may be regarded as packet-level convolutional codes that guarantee recovery from packet erasures under a strict decoding-delay constraint and are hence relevant to the low-latency objective of many modern communication systems. Past study of these codes has focused on performance over a tractable approximation of the Gilbert-Elliott channel model, known as the delay-constrained sliding window (DCSW) channel model. Under the DCSW channel model, within any sliding window of length w there can either be (i) a burst of at most b packet erasures or (ii) at most a random packet erasures. We study here, an extended version of the first constraint which permits e random erasures in addition to a burst of b erasures. We show that the capacity of this extended DCSW channel is strictly less than that of the corresponding DCSW channel in which b is replaced by $b+e$. Cyclic codes are easy to implement and are inherently well-suited to burst-erasure recovery. We identify a necessary and sufficient condition on the parity polynomial of an $[n, k]$ cyclic code that allows the code to recover from any burst of $n-k-s$ erasures along with any $rho$ random erasures, $1 leq rho leq s leq n-k$. We use this result to construct cyclic codes that provide reliable communication over the extended DCSW channel for certain parameters.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122962690","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}
引用次数: 2
Recent Progress in Private Simultaneous Messages Protocols 私有同步消息协议的最新进展
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611477
Akinori Kawachi
{"title":"Recent Progress in Private Simultaneous Messages Protocols","authors":"Akinori Kawachi","doi":"10.1109/ITW48936.2021.9611477","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611477","url":null,"abstract":"The private simultaneous messages (PSM) model is a simple variant of the secure multiparty computation (MPC). In the k-party PSM model, each party $P_{imath}$ has a private input $x_{i}$ for $i=1, ldots, k$. For a function f, each $lt pgt P_{i}$ encrypts $x_{i}$ into a message $m_{i}$ with a random string r shared among $lt pgt P_{1}, ldots, P_{k}$, and sends $m_{i}$ to the referee $R. R$ computes $fleft(x_{1}, ldots, x_{k}right)$ from their respective messages $m_{1}, ldots, m_{k}$. Then, R learns nothing from $m_{1}, ldots, m_{k}$ except for the output value $fleft(x_{1}, ldots, x_{k}right)$. This simple model provides interesting cryptographic applications and is essential for understanding the intrinsic costs (e.g., of communication $left|m_{1}right|+ldots+left|m_{k}right|$ and randomness $|r|$) to achieve MPC. This study surveys recent results associated with the PSM and closely related models.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121190476","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}
引用次数: 2
The Capacity of SWIPT Systems over Rayleigh-Fading Channels with HPA 基于HPA的瑞利衰落信道SWIPT系统容量研究
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611500
Nizar Khalfet, I. Krikidis
{"title":"The Capacity of SWIPT Systems over Rayleigh-Fading Channels with HPA","authors":"Nizar Khalfet, I. Krikidis","doi":"10.1109/ITW48936.2021.9611500","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611500","url":null,"abstract":"In this paper, we study the fundamental limits of simultaneous information and power transfer over a Rayleigh fading channel in the presence of high-power amplifier (HPA) nonlinearity. In particular, a three-party communication system is considered, where a transmitter aims simultaneously conveying information to an information receiver and delivering energy to an energy harvester receiver. We study the information-energy capacity region and the associated input distribution under: i) average-power, peak-power (PP) constraints at the transmitter, b) HPA nonlinearity at the transmitter, and c) nonlinearity of the energy harvesting circuit at the energy receiver. By extending Smith’s mathematical framework [1], we show that the optimal input distribution under those constraints is discrete with a finite number of mass points. Moreover, we derive a closed-form expression of the capacity-achieving distribution for the low PP regime, where there is no trade-off between information and energy transfer. Finally, we show that HPA significantly reduces the information energy capacity region.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126911005","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
Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels 变损耗光信道上相干态接收机的强化学习校准
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611396
Matias Bilkis, M. Rosati, J. Calsamiglia
{"title":"Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels","authors":"Matias Bilkis, M. Rosati, J. Calsamiglia","doi":"10.1109/ITW48936.2021.9611396","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611396","url":null,"abstract":"We study the problem of calibrating a quantum receiver for optical coherent states when transmitted on a quantum optical channel with variable transmissivity, a common model for long-distance optical-fiber and free/deep-space optical communication [1]–[7]. We optimize the error probability of legacy adaptive receivers, such as Kennedy’s and Dolinar’s [8], [9], on average with respect to the channel transmissivity distribution. We then compare our results with the ultimate error probability attainable by a general quantum device, computing the Helstrom bound for mixtures of coherent-state hypotheses, for the first time to our knowledge, and with homodyne measurements. With these tools, we first analyze the simplest case of two different transmissivity values; we find that the strategies adopted by adaptive receivers exhibit strikingly new features as the difference between the two transmissivities increases. Finally, we employ a recently introduced library of shallow reinforcement learning methods [10], demonstrating that an intelligent agent can learn the optimal receiver setup from scratch by training on repeated communication episodes on the channel with variable transmissivity and receiving rewards if the coherent-state message is correctly identified.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056889","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}
引用次数: 2
Secret Key Capacity of Wiretapped Polytree-PIN 窃听Polytree-PIN的秘密密钥容量
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611419
A. Poostindouz, R. Safavi-Naini
{"title":"Secret Key Capacity of Wiretapped Polytree-PIN","authors":"A. Poostindouz, R. Safavi-Naini","doi":"10.1109/ITW48936.2021.9611419","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611419","url":null,"abstract":"In secret key agreement (SKA) in multiterminal channel model, terminals are connected by a noisy discrete memoryless channel (DMC) with multiple input and multiple outputs. Terminals can use the DMC to obtain correlated randomness, and communicate over a noiseless public channel to establish a shared secret key among a designated subset of terminals. We focus on a special class of multiterminal channel models, called wiretapped Polytree-PIN, in which the noisy channel consists of a set of independent point-to-point channels whose underlying undirected connectivity graph forms a tree. We consider a wiretap setting, where the output of each point-to-point channel is partially leaked to a passive wiretapper adversary, Eve, through a second independent noisy channel. A secure SKA protocol generates a group secret key such that Eve has no information about it. In this paper, we derive the wiretap secret key capacity, which is the largest achievable secret key rate, of the wiretapped PolytreePIN model. Our result also implies the key capacity of the non-wiretapped Polytree-PIN model, that is the case when there is no leakage from point-to-point channels to Eve.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121635798","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}
引用次数: 0
Simultaneous Information and Energy Transmission with Finite Constellations 有限星座的同步信息和能量传输
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-05 DOI: 10.1109/ITW48936.2021.9611494
Sadaf ul Zuhra, S. Perlaza, E. Altman
{"title":"Simultaneous Information and Energy Transmission with Finite Constellations","authors":"Sadaf ul Zuhra, S. Perlaza, E. Altman","doi":"10.1109/ITW48936.2021.9611494","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611494","url":null,"abstract":"In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: (a) the channel is memoryless; (b) the number of channel input symbols (constellation size) and block length are finite; and (c) the decoding error probability (DEP) and the energy outage probability (EOP) are bounded away from zero. In particular, it is shown that the limits on the maximum information and energy transmission rates; and the minimum DEP and EOP, are essentially set by the type induced by the code used to perform the transmission. That is, the empirical frequency with which each channel input symbol appears in the codewords. Using this observation, guidelines for optimal constellation design for simultaneous energy and information transmission are presented.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116090722","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
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation 编码矩阵计算中部分离散矩阵与稀疏矩阵的统一处理
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-24 DOI: 10.1109/ITW48936.2021.9611400
A. Das, A. Ramamoorthy
{"title":"A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation","authors":"A. Das, A. Ramamoorthy","doi":"10.1109/ITW48936.2021.9611400","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611400","url":null,"abstract":"The overall execution time of distributed matrix computations is often dominated by slow worker nodes (stragglers) over the clusters. Recently, different coding techniques have been utilized to mitigate the effect of stragglers where worker nodes are assigned the task of processing encoded submatrices of the original matrices. In many machine learning or optimization problems the relevant matrices are often sparse. Several coded computation methods operate with dense linear combinations of the original submatrices; this can significantly increase the worker node computation times and consequently the overall job execution time. Moreover, several existing techniques treat the stragglers as failures (erasures) and discard their computations. In this work, we present a coding approach which operates with limited encoding of the original submatrices and utilizes the partial computations done by the slower workers. Our scheme continues to have the optimal threshold of prior work. Extensive numerical experiments done in AWS (Amazon Web Services) cluster confirm that the proposed approach enhances the speed of the worker computations (and thus the whole process) significantly.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114713852","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}
引用次数: 7
Distributed Sequential Hypothesis Testing With Zero-Rate Compression 零速率压缩下的分布序列假设检验
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-17 DOI: 10.1109/ITW48936.2021.9611441
Sadaf Salehkalaibar, V. Tan
{"title":"Distributed Sequential Hypothesis Testing With Zero-Rate Compression","authors":"Sadaf Salehkalaibar, V. Tan","doi":"10.1109/ITW48936.2021.9611441","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611441","url":null,"abstract":"In this paper, we consider sequential testing over a single-sensor, a single-decision center setup. At each time, instant t, the sensor gets k samples $(k gt 0)$ and describes the observed sequence until time t to the decision center over a zero-rate noiseless link. The decision center sends a single bit of feedback to the sensor to request for more samples for compression/testing or to stop the transmission. We have characterized the optimal exponent of type-II error probability under the constraint that type-I error probability does not exceed a given threshold $varepsilon in(0,1)$ and also when the expectation of the number of requests from decision center is smaller than n which tends to infinity. Interestingly, the optimal exponent coincides with that for fixed-length hypothesis testing with zero-rate communication constraints.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116171996","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}
引用次数: 5
Covert queueing problem with a Markovian statistic 具有马尔可夫统计量的隐蔽排队问题
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-13 DOI: 10.1109/ITW48936.2021.9611410
Arti D. Yardi, Tejas Bodas
{"title":"Covert queueing problem with a Markovian statistic","authors":"Arti D. Yardi, Tejas Bodas","doi":"10.1109/ITW48936.2021.9611410","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611410","url":null,"abstract":"Based on the covert communication framework, we consider a covert queueing problem that has a Markovian statistic. Willie jobs arrive according to a Poisson process and require service from server Bob. Bob does not have a queue for jobs to wait and hence when the server is busy, arriving Willie jobs are lost. Willie and Bob enter a contract under which Bob should only serve Willie jobs. As part of the usage statistic, for a sequence of N consecutive jobs that arrived, Bob informs Willie whether each job was served or lost (this is the Markovian statistic). Bob is assumed to be violating the contract and admitting non-Willie (Nillie) jobs according to a Poisson process. For such a setting, we identify the hypothesis testing to be performed (given the Markovian data) by Willie to detect the presence or absence of Nillie jobs. We also characterize the upper bound on arrival rate of Nillie jobs such that the error in the hypothesis testing of Willie is arbitrarily large, ensuring covertness in admitting Nillie jobs.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126191273","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信