Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895436
Peng Yang, Rui Zhang, Kanta Matsuura
Stateful public key encryption schemes are introduced recently with improved efficiency over traditional stateless schemes. However, previous proposals are either based on strong assumptions; or admitting very loose security reductions. In this paper, we improve these aspects by presenting a stateful public key encryption scheme with tight security reduction to the computational Diffie-Hellman assumption (cf. gap Diffie-Hellman in [5]), as well as a stateful identity based encryption scheme with tighter security reduction (than [12]) to the computational bilinear Diffie-Hellman problem. It is worth reminding that it is always desirable to have the proofs with tight reductions such that the actual schemes can be practically-meaningful.
{"title":"Stateful public key encryption: How to remove gap assumptions and maintaining tight reductions","authors":"Peng Yang, Rui Zhang, Kanta Matsuura","doi":"10.1109/ISITA.2008.4895436","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895436","url":null,"abstract":"Stateful public key encryption schemes are introduced recently with improved efficiency over traditional stateless schemes. However, previous proposals are either based on strong assumptions; or admitting very loose security reductions. In this paper, we improve these aspects by presenting a stateful public key encryption scheme with tight security reduction to the computational Diffie-Hellman assumption (cf. gap Diffie-Hellman in [5]), as well as a stateful identity based encryption scheme with tighter security reduction (than [12]) to the computational bilinear Diffie-Hellman problem. It is worth reminding that it is always desirable to have the proofs with tight reductions such that the actual schemes can be practically-meaningful.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115378534","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895662
S. Kuzuoka
This paper clarifies the adequacy of the linear channel coding approach for the Slepian-Wolf coding of individual sequences. Our result reveals that LDPC code ensembles give optimal code for the Slepian-Wolf coding of individual sequences.
{"title":"An application of linear codes to Slepian-Wolf coding of individual sequences","authors":"S. Kuzuoka","doi":"10.1109/ISITA.2008.4895662","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895662","url":null,"abstract":"This paper clarifies the adequacy of the linear channel coding approach for the Slepian-Wolf coding of individual sequences. Our result reveals that LDPC code ensembles give optimal code for the Slepian-Wolf coding of individual sequences.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115712686","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895453
M. Goto, T. Ishida, M. Suzuki, S. Hirasawa
This paper discusses the document classification problems in text mining from the viewpoint of asymptotic statistical analysis. In the problem of text mining, the several heuristics are applied to practical analysis because of its experimental effectiveness in many case studies. The theoretical explanation about the performance of text mining techniques is required and such thinking will give us very clear idea. In this paper, the performances of distance measures used to classify the documents are analyzed from the new viewpoint of asymptotic analysis. We also discuss the asymptotic performance of IDF measure used in the information retrieval field.
{"title":"Asymptotic evaluation of distance measure on high dimensional vector spaces in text mining","authors":"M. Goto, T. Ishida, M. Suzuki, S. Hirasawa","doi":"10.1109/ISITA.2008.4895453","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895453","url":null,"abstract":"This paper discusses the document classification problems in text mining from the viewpoint of asymptotic statistical analysis. In the problem of text mining, the several heuristics are applied to practical analysis because of its experimental effectiveness in many case studies. The theoretical explanation about the performance of text mining techniques is required and such thinking will give us very clear idea. In this paper, the performances of distance measures used to classify the documents are analyzed from the new viewpoint of asymptotic analysis. We also discuss the asymptotic performance of IDF measure used in the information retrieval field.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124288463","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895641
M. Mihaljević, H. Imai
A novel approach for design of stream ciphers based on a combination of pseudo-randomness and randomness is proposed. The core element of the approach is a pseudo-random embedding of the random bits into the ciphertext. This embedding plays a role of a homophonic encoding and implies an additional communications overhead. Before its output to the public communication channel the ciphertext with the embedded random bits is also intentionally degraded via its exposure to a moderate noise binary symmetric channel. The proposed design has potential of providing that complexity of recovering the secret key in the known plaintext attacking scenario is close to the complexity of recovering the secret key via the exhaustive search, i.e. close to the maximal possible one for the given size of secret key. Accordingly, the proposed approach can be considered as a trade-off between the increased security and decreased communications efficiency.
{"title":"A stream cipher design based on embedding of random bits","authors":"M. Mihaljević, H. Imai","doi":"10.1109/ISITA.2008.4895641","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895641","url":null,"abstract":"A novel approach for design of stream ciphers based on a combination of pseudo-randomness and randomness is proposed. The core element of the approach is a pseudo-random embedding of the random bits into the ciphertext. This embedding plays a role of a homophonic encoding and implies an additional communications overhead. Before its output to the public communication channel the ciphertext with the embedded random bits is also intentionally degraded via its exposure to a moderate noise binary symmetric channel. The proposed design has potential of providing that complexity of recovering the secret key in the known plaintext attacking scenario is close to the complexity of recovering the secret key via the exhaustive search, i.e. close to the maximal possible one for the given size of secret key. Accordingly, the proposed approach can be considered as a trade-off between the increased security and decreased communications efficiency.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114688536","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895430
A. Ghassemi, T. Gulliver
An efficient tone reservation (TR) technique for peak-to-average power ratio (PAPR) reduction in passband multicarrier systems is introduced. This reduces the number of variables in the quadratically constrained quadratic program (QCQP) for passband multicarrier modulation. The proposed PAPR reduction algorithm is developed using the structure of the inverse fast Fourier transform (IFFT). Considerable complexity reduction is achieved compared with existing TR algorithms. Simulation results are presented which demonstrate that the proposed algorithm yields performance close to that with other PAPR reduction solutions.
{"title":"Efficient optimization for tone reservation OFDM","authors":"A. Ghassemi, T. Gulliver","doi":"10.1109/ISITA.2008.4895430","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895430","url":null,"abstract":"An efficient tone reservation (TR) technique for peak-to-average power ratio (PAPR) reduction in passband multicarrier systems is introduced. This reduces the number of variables in the quadratically constrained quadratic program (QCQP) for passband multicarrier modulation. The proposed PAPR reduction algorithm is developed using the structure of the inverse fast Fourier transform (IFFT). Considerable complexity reduction is achieved compared with existing TR algorithms. Simulation results are presented which demonstrate that the proposed algorithm yields performance close to that with other PAPR reduction solutions.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116190038","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895480
Kazushi Mimura
We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem.
{"title":"Typical performance of irregular LDGM codes for lossy compression","authors":"Kazushi Mimura","doi":"10.1109/ISITA.2008.4895480","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895480","url":null,"abstract":"We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123955856","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895552
V. Gardasevic, R. Muller, F. Knudsen
We propose a method for vector precoding suited to singular multiple-input multiple-output (MIMO) channels were the number of data streams is larger than the number of transmit antennas. We calculate the probability that our method, due to the channel singularity, fails to provide the data without crosstalk to the receiver, analytically, and show that this probability goes to zero exponentially with the size of the MIMO system if the number of QPSK data streams in smaller than twice the number of transmit antennas.
{"title":"Vector precoding for singular MIMO channels","authors":"V. Gardasevic, R. Muller, F. Knudsen","doi":"10.1109/ISITA.2008.4895552","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895552","url":null,"abstract":"We propose a method for vector precoding suited to singular multiple-input multiple-output (MIMO) channels were the number of data streams is larger than the number of transmit antennas. We calculate the probability that our method, due to the channel singularity, fails to provide the data without crosstalk to the receiver, analytically, and show that this probability goes to zero exponentially with the size of the MIMO system if the number of QPSK data streams in smaller than twice the number of transmit antennas.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125737539","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895476
M. Tanahashi, H. Ochiai
We have recently proposed symbol insertion (SI) systems for band-limited single-carrier transmission as a joint approach to channel coding and peak-to-average power ratio (PAR) reduction. At the transmitter, the SI periodically inserts redundant symbols into transmitted symbols to control the envelope fluctuation of the pulse-shaped signals. At the receiver, viewing the inserted symbols as parities, we exploit them for error-correction. Furthermore, concatenation of the SI and another code forms a serially-concatenated turbo system, which produces significant coding gain. In this paper, we show that, with differential encoding, the SI can easily accommodate to noncoherent reception.
{"title":"Noncoherent iterative decoding of symbol insertion systems","authors":"M. Tanahashi, H. Ochiai","doi":"10.1109/ISITA.2008.4895476","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895476","url":null,"abstract":"We have recently proposed symbol insertion (SI) systems for band-limited single-carrier transmission as a joint approach to channel coding and peak-to-average power ratio (PAR) reduction. At the transmitter, the SI periodically inserts redundant symbols into transmitted symbols to control the envelope fluctuation of the pulse-shaped signals. At the receiver, viewing the inserted symbols as parities, we exploit them for error-correction. Furthermore, concatenation of the SI and another code forms a serially-concatenated turbo system, which produces significant coding gain. In this paper, we show that, with differential encoding, the SI can easily accommodate to noncoherent reception.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124728087","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895374
K. Ishii, K. Ishibashi, H. Ochiai
This paper proposes a new coded cooperation protocol based on multilevel coded modulation for the case when the number of cooperative nodes is arbitrary. If the number of cooperative nodes is N, the proposed system makes a cooperative diversity with the multilevel coded 2N-PAM. Multilevel coded 2N-PAM can be decomposed into N parallel binary channels. Thus, the node can assign its own information and the other nodes' information to respective parallel channels. The destination node decodes the information of respective source nodes using the received symbols at N consecutive time-slots. We show that the proposed multilevel coded cooperation can obtain N the diversity gain and outperform the time-division cooperative and signal superposing cooperative transmissions based on the outage probability analyses.
{"title":"Multilevel coded cooperation: Concepts and dsign criteria","authors":"K. Ishii, K. Ishibashi, H. Ochiai","doi":"10.1109/ISITA.2008.4895374","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895374","url":null,"abstract":"This paper proposes a new coded cooperation protocol based on multilevel coded modulation for the case when the number of cooperative nodes is arbitrary. If the number of cooperative nodes is N, the proposed system makes a cooperative diversity with the multilevel coded 2N-PAM. Multilevel coded 2N-PAM can be decomposed into N parallel binary channels. Thus, the node can assign its own information and the other nodes' information to respective parallel channels. The destination node decodes the information of respective source nodes using the received symbols at N consecutive time-slots. We show that the proposed multilevel coded cooperation can obtain N the diversity gain and outperform the time-division cooperative and signal superposing cooperative transmissions based on the outage probability analyses.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129494886","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}
Pub Date : 2008-12-01DOI: 10.1109/ISITA.2008.4895397
H. Noguchi, K. Kamakura
We introduce a hybrid of one-way and two-way reservations for slotted optical burst switching (S-OBS). Our hybrid method adds one-way mode to the two-way reservation, which has the idle time for ingress nodes to wait outcomes on preparing and scheduling at each node on the routes to egress nodes for the data segment used in S-OBS. The one-way mode enables ingress nodes to transmit data segments without waiting any outcome of the reservation of the channel resources on routes to egress nodes, though data segments are transmitted with waiting such outcomes in the two-way mode. The addition of the one-way mode reduces the idle time for ingress nodes to wait the acknowledgements of data segments in the two-way reservation method of S-OBS. We also explain the order of transmitting at the ingress node and receiving at the egress node for the correct order of the data segment. We analyze the end-to-end delay of the hybrid method, and show that the hybrid method decreases the end-to-end delay.
{"title":"Effect of one-way mode of hybrid reservation on slotted optical burst switching networks","authors":"H. Noguchi, K. Kamakura","doi":"10.1109/ISITA.2008.4895397","DOIUrl":"https://doi.org/10.1109/ISITA.2008.4895397","url":null,"abstract":"We introduce a hybrid of one-way and two-way reservations for slotted optical burst switching (S-OBS). Our hybrid method adds one-way mode to the two-way reservation, which has the idle time for ingress nodes to wait outcomes on preparing and scheduling at each node on the routes to egress nodes for the data segment used in S-OBS. The one-way mode enables ingress nodes to transmit data segments without waiting any outcome of the reservation of the channel resources on routes to egress nodes, though data segments are transmitted with waiting such outcomes in the two-way mode. The addition of the one-way mode reduces the idle time for ingress nodes to wait the acknowledgements of data segments in the two-way reservation method of S-OBS. We also explain the order of transmitting at the ingress node and receiving at the egress node for the correct order of the data segment. We analyze the end-to-end delay of the hybrid method, and show that the hybrid method decreases the end-to-end delay.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129636406","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：