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

2015 IEEE Information Theory Workshop - Fall (ITW)最新文献

筛选
英文 中文
Light-weight secrecy system using channels with insertion errors: Cryptographic implications 使用带有插入错误信道的轻量级保密系统:密码学含义
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360775
A. Kavcic, M. Mihaljević, Kanta Matsuura
{"title":"Light-weight secrecy system using channels with insertion errors: Cryptographic implications","authors":"A. Kavcic, M. Mihaljević, Kanta Matsuura","doi":"10.1109/ITWF.2015.7360775","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360775","url":null,"abstract":"A model of an encryption approach is analyzed from an information-theoretic point of view. In the model, an attacker faces the problem of observing messages through a concatenation of a binary symmetric channel and a channel with randomly inserted bits. The paper points out to a number of security related implications resulting from employing an insertion channel. It is shown that deliberate and secret-key-controlled insertions of random bits into the basic ciphertext provide a security enhancement of the resulting encryption scheme.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126728300","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
The two-hop interference untrusted-relay channel with confidential messages 带有机密信息的两跳干扰不可信中继信道
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360788
Ahmed A. Zewail, A. Yener
{"title":"The two-hop interference untrusted-relay channel with confidential messages","authors":"Ahmed A. Zewail, A. Yener","doi":"10.1109/ITWF.2015.7360788","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360788","url":null,"abstract":"This paper considers the two-user interference relay channel where each source wishes to communicate to its destination a message that is confidential from the other destination. Furthermore, the relay, that is the enabler of communication, due to the absence of direct links, is untrusted. Thus, the messages from both sources need to be kept secret from the relay as well. We provide an achievable secure rate region for this network. The achievability scheme utilizes structured codes for message transmission, cooperative jamming and scaled compute-and-forward. In particular, the sources use nested lattice codes and stochastic encoding, while the destinations jam using lattice points. The relay decodes two integer combinations of the received lattice points and forwards, using Gaussian codewords, to both destinations. The achievability technique provides the insight that we can utilize the untrusted relay node as an encryption block in a two-hop interference relay channel with confidential messages.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115556523","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}
引用次数: 9
Distributed testing against independence with conferencing encoders 使用会议编码器对独立性进行分布式测试
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360726
Wenwen Zhao, L. Lai
{"title":"Distributed testing against independence with conferencing encoders","authors":"Wenwen Zhao, L. Lai","doi":"10.1109/ITWF.2015.7360726","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360726","url":null,"abstract":"Motivated by distributed inference over big datasets problems, we study multi-terminal distributed hypothesis testing problems in which each terminal has data related to only one random variable. Due to the restriction of one-shot communication, we consider the distributed testing against independence problem when interaction among the encoders are allowed. Subject to type 1 error probability and communication rates constraints, we first provide a scheme for the general case and then show that this scheme is optimal for some special cases.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115862494","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}
引用次数: 8
Anytime properties of protograph-based repeat-accumulate codes 基于原型的重复累积代码的任意属性
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360758
N. Zhang, Md. Noor-A.-Rahim, B. Vellambi, K. Nguyen
{"title":"Anytime properties of protograph-based repeat-accumulate codes","authors":"N. Zhang, Md. Noor-A.-Rahim, B. Vellambi, K. Nguyen","doi":"10.1109/ITWF.2015.7360758","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360758","url":null,"abstract":"In this paper, a highly efficient protograph-based repeat-accumulate (P-RA) anytime code is proposed, which is derived from the combination of protograph-based low-density parity-check convolutional (P-LDPCC) and spatially coupled low-density parity-check convolutional (SC-LDPCC) codes. Density evolution technique is applied to demonstrate the anytime properties of the P-RA codes over the binary erasure channel (BEC). The simulation results show that P-RA codes perform better than SC-LDPCC and P-LDPCC codes. More importantly, the finite-length performance of P-RA codes is only dependent on the decoding delay rather than the decoding message position.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134223193","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
Maximizing recommender's influence in a social network: An information theoretic perspective 社交网络中推荐人影响力最大化:信息理论视角
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360776
Basak Guler, Kaya Tutuncuoglu, A. Yener
{"title":"Maximizing recommender's influence in a social network: An information theoretic perspective","authors":"Basak Guler, Kaya Tutuncuoglu, A. Yener","doi":"10.1109/ITWF.2015.7360776","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360776","url":null,"abstract":"We study a social network in which individuals make decisions influenced by a recommender as well as the previous actions taken by themselves or other users. The recommender aims to tailor its suggestions to maximize the benefit from utilizing social interactions. We refer to this benefit as the recommender's influence which, in essence, measures the value of controlling the specific suggestions offered to the individuals. We show that this influence can be quantified by the directed information between the suggestions and people's actions. Accordingly, we identify the precise relationship between the social network-based recommendation system and a finite state communication channel whose capacity analysis provides the solution for the influence maximization problem for the recommender. Our results demonstrate that a recommender that tailors its suggestions based on the social dynamics of its customer base can have a significantly greater influence.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133083986","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
The ergodic high SNR capacity of the spatially-correlated non-coherent MIMO channel within an SNR-independent gap 在信噪比无关的间隙内，空间相关非相干MIMO信道的遍历高信噪比容量
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360770
R. Gohary, H. Yanikomeroglu
{"title":"The ergodic high SNR capacity of the spatially-correlated non-coherent MIMO channel within an SNR-independent gap","authors":"R. Gohary, H. Yanikomeroglu","doi":"10.1109/ITWF.2015.7360770","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360770","url":null,"abstract":"The ergodic capacity of spatially-correlated non-coherent multiple-input multiple-output channels is not known. In this paper upper and lower bounds are derived for this capacity at asymptotically high signal-to-noise ratios (SNRs). The bounds are accurate within an approximation error that decays as 1/SNR, and the gap between these bounds depends solely on the signalling dimensions and the condition number of the transmitter correlation matrix. The upper bound on the high SNR ergodic capacity is shown to decrease monotonically with the logarithm of the condition number of the transmitter correlation matrix. Furthermore, the lower bound on this capacity is achieved by input signals in the form of the product of an isotropically distributed random Grassmannian component and a deterministic component comprising the eigenvectors and the inverse of the eigenvalues of the transmitter correlation matrix.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134486287","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
On two terminal interactive source coding for function computation with remote sources 对两端交互源编码进行了远程源函数计算
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360784
A. Zaidi
{"title":"On two terminal interactive source coding for function computation with remote sources","authors":"A. Zaidi","doi":"10.1109/ITWF.2015.7360784","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360784","url":null,"abstract":"In this paper, we study a setting in which two terminals A and B respectively observe, or measure, noisy versions X̃ and Ỹ of two memoryless, possibly statistically dependent, remote sources X and Y; and they interact bidirectionally in the aim of computing functions of the remote sources. Focusing on a distributed source coding formulation, we establish characterizations of the rate-distortion region and the minimum sum-rate for any finite number of messages. This generalizes Ma and Ishwar's two-terminal function computation result to the case of remote sources. Furthermore, in the case in which the computation is performed at only one side, we establish upper bounds on the maximum gain that can be brought up by the interaction in terms of the minimum sum rate improvement for a given average distortion. We also apply the results to some important special cases, thus allowing us to gain some fundamental insights on the benefits of the interaction for both lossless and lossy function computations in these cases.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"419 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116333747","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
Optimal binary locally repairable codes with joint information locality 具有联合信息局部性的最优二进制局部可修码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360733
Junghyun Kim, Mi-Young Nam, Hong‐Yeop Song
{"title":"Optimal binary locally repairable codes with joint information locality","authors":"Junghyun Kim, Mi-Young Nam, Hong‐Yeop Song","doi":"10.1109/ITWF.2015.7360733","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360733","url":null,"abstract":"We propose new families of optimal binary locally repairable codes, called crown codes and ring codes, that achieve optimal code rate for joint information locality (r1, r2)i = (2, 3) and (r1, r2)i = (2, 4), respectively. The joint information locality is a set of numbers of symbols for repairing various erasure patterns of information symbols. We simplify the code design problem utilizing simple graphs, and present that special structures of the graphs provide good locality properties.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126016761","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
On Algebraic Manipulation Detection codes from linear codes and their application to storage systems 线性码的代数操作检测码及其在存储系统中的应用
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360735
J. Harshan, F. Oggier
{"title":"On Algebraic Manipulation Detection codes from linear codes and their application to storage systems","authors":"J. Harshan, F. Oggier","doi":"10.1109/ITWF.2015.7360735","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360735","url":null,"abstract":"Algebraic Manipulation Detection (AMD) codes form a cryptographic primitive designed to detect data corruption of the form of an additive operation in an Abelian group. In this paper, we discuss the applicability of AMD codes to protect erasure code based storage systems from a Byzantine adversary injecting fake data in the distributed storage system. We study a special class of AMD codes which relies on classical linear codes for its construction. We explore the design aspects of such AMD codes namely, (i) understanding its design criteria, (ii) studying the fundamental limits of such codes, to facilitate data integrity, and (iii) present some examples.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126426529","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}
引用次数: 1
The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropper 具有高斯干扰和友好窃听者的广播信道的容量
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360789
Kevin Luo, R. Gohary, H. Yanikomeroglu
{"title":"The capacity of a broadcast channel with Gaussian jamming and a friendly eavesdropper","authors":"Kevin Luo, R. Gohary, H. Yanikomeroglu","doi":"10.1109/ITWF.2015.7360789","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360789","url":null,"abstract":"A friendly eavesdropper assists communication in a broadcast scenario in which one transmitter wishes to send a common message to two receivers in the presence of a malicious jammer. The jammer attempts to disrupt communication by transmitting a high power Gaussian signal, whereas the friendly eavesdropper `hears' the jammer's transmission and sends an assisting signal to the destinations over an orthogonal channel in order to help them alleviate the jammer's impact. We derive an expression for capacity, i.e., the maximum data rate that can be reliably communicated from the transmitter to the receivers and we show that it is optimal for the friendly eavesdropper to send a Gaussian description of the jamming signal with the help of a scheme based on a modified compress-and-forward relaying that uses a list decoding procedure.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125223452","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信