{"title":"LDPC-based coded cooperative jamming codes","authors":"A. Pierrot, M. Bloch","doi":"10.1109/ITW.2012.6404716","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404716","url":null,"abstract":"We present a practical coded cooperative jamming scheme for the problem of secure communications over the two-way wiretap channel. We design low-density parity-check (LDPC) based codes whose codewords interfere at the eavesdropper's terminal, thus providing secrecy. We show that our scheme can guarantee low information leakage rate, and we assess its precise performance for classical and spatially coupled LDPC codes.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117049174","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}
{"title":"The complexity of information theoretic secure computation","authors":"Y. Ishai","doi":"10.1109/ITW.2012.6404768","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404768","url":null,"abstract":"Summary form only given. A protocol for secure computation allows two or more parties to perform a distributed computation on their local inputs while hiding the inputs from each other. In the so-called “information theoretic” setting for secure computation, the parties are assumed to communicate over secure channels and the inputs should remain hidden even from computationally unbounded parties. It is known that every computation can done securely when there is a majority of honest parties, or alternatively when the parties are given access to certain types of correlated secret randomness. However, the true cost of such secure computations remains wide open. The talk will survey some recent progress and open questions in this area.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802004","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}
{"title":"Comparison of dynamic model selection with infinite HMM for statistical model change detection","authors":"Eiichi Sakurai, K. Yamanishi","doi":"10.1109/ITW.2012.6404680","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404680","url":null,"abstract":"In this study, we address the issue of tracking changes in statistical models under the assumption that the statistical models used for generating data may change over time. This issue is of great importance for learning from non-stationary data. One of the promising approaches for resolving this issue is the use of the dynamic model selection (DMS) method, in which a model sequence is estimated on the basis of the minimum description length (MDL) principle. Another approach is the use of the infinite hidden Markov model (HMM), which is a non-parametric learning method for the case with an infinite number of states. In this study, we propose a few new variants of DMS and propose efficient algorithms to minimize the total code-length by using the sequential normalized maximum likelihood. We compare these algorithms with infinite HMM to investigate their statistical model change detection performance, and we empirically demonstrate that one of our variants of DMS significantly outperforms infinite HMM in terms of change-point detection accuracy.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883403","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}
{"title":"Sequential group testing with graph constraints","authors":"Amin Karbasi, Morteza Zadimoghaddam","doi":"10.1109/ITW.2012.6404678","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404678","url":null,"abstract":"In conventional group testing, the goal is to detect a small subset of defecting items D in a large population N by grouping arbitrary subset of N into different pools. The result of each group test T is a binary output depending on whether the group contains a defective item or not. The main challenge is to minimize the number of pools required to identify the set D. Motivated by applications in network monitoring and infection propagation, we consider the problem of group testing with graph constraints. As opposed to conventional group testing where any subset of items can be pooled, here a test is admissible if it induces a connected subgraph H ⊂ G. In contrast to the non-adaptive pooling process used in previous work, we first show that by exploiting an adaptive strategy, one can dramatically reduce the number of tests. More specifically, for any graph G, we devise a 2-approximation algorithm (and hence order optimal) that locates the set of defective items D. To obtain a good compromise between adaptive and non-adaptive strategies, we then devise a multi-stage algorithm. In particular, we show that if the set of defective items are uniformly distributed, then an l-stage pooling strategy can identify the defective set in O(l·|D|·|N|1/l) tests, on the average. In particular, for l = log(|N|) stages, the number of tests reduces to 4|D| log(|N|), which in turn is order optimum.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123521512","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}
{"title":"Gaussian wiretap lattice codes from binary self-dual codes","authors":"Fuchun Lin, F. Oggier","doi":"10.1109/ITW.2012.6404761","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404761","url":null,"abstract":"We consider lattice coding over a Gaussian wiretap channel with respect to the secrecy gain, a lattice invariant introduced in [1] to characterize the confusion that a chosen lattice can cause at the eavesdropper. The secrecy gain of the best unimodular lattices constructed from binary self-dual codes in dimension n, 24 ≤ n ≤ 32 are calculated. Numerical upper bounds on the secrecy gain of unimodular lattices in general and of unimodular lattices constructed from binary self-dual codes in particular are derived for all even dimensions up to 168.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124851545","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}
Sachin Kadloor, N. Kiyavash, P. Venkitasubramaniam
{"title":"Scheduling with privacy constraints","authors":"Sachin Kadloor, N. Kiyavash, P. Venkitasubramaniam","doi":"10.1109/ITW.2012.6404704","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404704","url":null,"abstract":"In multi-tasking systems where a finite resource is to be shared, a scheduler dictates how the resource is divided among competing processes. Examples of systems which have schedulers include, a computer where the CPU needs to be shared between the different threads running, a cloud computing infrastructure with shared computing resources, a network router serving packets from different streams etc. In such situations, when a processor is shared by multiple users, the delays experienced by jobs from one user are a function of the arrival pattern of jobs from other users, and the scheduling policy of the server. Consequently, a scheduling system creates a timing side channel in which information about arrival pattern from one user is inadvertently leaked to another. In this work, this information leakage is studied for a two user scheduling system. We first introduce a measure of privacy and then demonstrate that no scheduler can provide maximum privacy without idling/taking vacations, and consequently no policy can simultaneously be delay and privacy optimal.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124981782","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}
{"title":"Characterizing the rate region of the coded side-information problem","authors":"I. Land, C. Weidmann, B. Vellambi","doi":"10.1109/ITW.2012.6404685","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404685","url":null,"abstract":"This paper revisits earlier work on the achievable rate-region for the coded side-information problem. For specific source distributions we provide computable extreme rate points. As opposed to previous works, we present short and concise proofs and additional rate points below the time-sharing line of previously known rate points. Our results are based on a formulation as an optimization problem.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122499735","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}
{"title":"Design of binary polar codes with arbitrary kernel","authors":"Vera Miloslavskaya, P. Trifonov","doi":"10.1109/ITW.2012.6404639","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404639","url":null,"abstract":"The problem of construction of binary polar codes with high-dimensional kernels is considered. A novel method for computing the erasure probability in the bit subchannels induced by the polarization kernel is proposed. The codes obtained using the proposed method outperform those based on the Arikan kernel.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114121065","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}
{"title":"Overcoming weak expectations","authors":"Y. Dodis, Yuzhen Yu","doi":"10.1109/ITW.2012.6404636","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404636","url":null,"abstract":"Recently, there has been renewed interest in basing cryptographic primitives on weak secrets, where the only information about the secret is some non-trivial amount of (min-) entropy. From a formal point of view, such results require to upper bound the expectation of some function f(X), where X is a weak source in question. We show an elementary inequality which essentially upper bounds such `weak expectation' by two terms, the first of which is independent of f, while the second only depends on the `variance' of f under uniform distribution. Quite remarkably, as relatively simple corollaries of this elementary inequality, we obtain some `unexpected' results, in several cases noticeably simplifying/improving prior techniques for the same problem. Examples include non-malleable extractors, leakage-resilient symmetric encryption, seed-dependent condensers and improved entropy loss for the leftover hash lemma.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125236544","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}
{"title":"An extension to the chain graph representation of an achievable scheme","authors":"S. Rini","doi":"10.1109/ITW.2012.6404747","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404747","url":null,"abstract":"The chain graph representations of an achievable scheme is a recently introduced theoretical tool to derive achievable regions based on superposition coding and binning for a general, single-hop, multi-terminal network. It allows for a compact representation of complex transmission strategies and the derivation of the corresponding achievable region for a large class of channels. In this paper we extend the original concept to include a new random coding technique that generalizes superposition coding and binning. With this coding strategy, one generates a top codebook conditionally dependent on the bottom codeword and successively uses binning to impose a different conditional distribution between top and bottom codewords. The region achieved with this strategy relates to the Kullback-Leibler divergence between the distribution of the codewords at generation and the distribution after binning.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125517569","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
