Pub Date : 2005-10-31DOI: 10.1109/ISIT.2005.1523537
K. Cartrysse, J. Lubbe
Mobile code is software code that may be run at a remote location, which is possibly untrustworthy. This paper provides a secrecy model for mobile code based on Shannon's information theoretic model. Due to different characteristics of mobile code, such as the possibility of plaintext-attacks and untrustworthy execution environments, a new definition for the maximum level of secrecy is necessary. This results in different minimum requirements to obtain this level of secrecy. Furthermore, the unicity distance is derived in various situations
{"title":"Information theoretical approach to mobile code","authors":"K. Cartrysse, J. Lubbe","doi":"10.1109/ISIT.2005.1523537","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523537","url":null,"abstract":"Mobile code is software code that may be run at a remote location, which is possibly untrustworthy. This paper provides a secrecy model for mobile code based on Shannon's information theoretic model. Due to different characteristics of mobile code, such as the possibility of plaintext-attacks and untrustworthy execution environments, a new definition for the maximum level of secrecy is necessary. This results in different minimum requirements to obtain this level of secrecy. Furthermore, the unicity distance is derived in various situations","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126263538","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523554
R. Karp, M. Luby, A. Shokrollahi
In this paper we extend the double verification algorithm of Luby and Mitzenmacher to the class of Raptor codes, analyze it, and design Raptor codes that perform very well with respect to this algorithm
{"title":"Verification decoding of raptor codes","authors":"R. Karp, M. Luby, A. Shokrollahi","doi":"10.1109/ISIT.2005.1523554","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523554","url":null,"abstract":"In this paper we extend the double verification algorithm of Luby and Mitzenmacher to the class of Raptor codes, analyze it, and design Raptor codes that perform very well with respect to this algorithm","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129822753","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523754
D. Kirovski
The difficulty of building an effective digital rights management system stems from the fact that traditional cryptographic primitives such as encryption or scrambling do not protect audio or video signals once they are played in plain-text. This fact, commonly referred to as "the analog hole," has been responsible for the popularity of multimedia file sharing which cannot be controlled, at least technically, by content's copyright owners. In this paper, we explore a specific issue in multimedia fingerprinting as an answer to "the analog hole" problem. We analyze the collusion resistance of spread-spectrum fingerprints with an arbitrary probability distribution of their source using a recently introduced collusion procedure, the gradient attack
{"title":"Collusion of fingerprints via the gradient attack","authors":"D. Kirovski","doi":"10.1109/ISIT.2005.1523754","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523754","url":null,"abstract":"The difficulty of building an effective digital rights management system stems from the fact that traditional cryptographic primitives such as encryption or scrambling do not protect audio or video signals once they are played in plain-text. This fact, commonly referred to as \"the analog hole,\" has been responsible for the popularity of multimedia file sharing which cannot be controlled, at least technically, by content's copyright owners. In this paper, we explore a specific issue in multimedia fingerprinting as an answer to \"the analog hole\" problem. We analyze the collusion resistance of spread-spectrum fingerprints with an arbitrary probability distribution of their source using a recently introduced collusion procedure, the gradient attack","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129209456","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523536
Mitsugu Iwamoto, Hirosuke Yamamoto
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case where some information about the secret leaks from a non-qualified set of shares, and hence, they are more desirable than weak ramp SS schemes. However, it is not known how to construct the strong ramp SS schemes in the case of general access structures. In this paper, it is shown that a strong ramp SS scheme can always be constructed from a SS scheme with plural secrets for any feasible general access structure. As a byproduct, it is pointed out that threshold ramp SS schemes based on Shamir's polynomial interpolation method are not always strong
{"title":"Strongly secure ramp secret sharing schemes","authors":"Mitsugu Iwamoto, Hirosuke Yamamoto","doi":"10.1109/ISIT.2005.1523536","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523536","url":null,"abstract":"Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case where some information about the secret leaks from a non-qualified set of shares, and hence, they are more desirable than weak ramp SS schemes. However, it is not known how to construct the strong ramp SS schemes in the case of general access structures. In this paper, it is shown that a strong ramp SS scheme can always be constructed from a SS scheme with plural secrets for any feasible general access structure. As a byproduct, it is pointed out that threshold ramp SS schemes based on Shamir's polynomial interpolation method are not always strong","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128560853","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523387
S. Diggavi, David Tse
Diversity-embedded codes for fading channels are high-rate codes that are designed so that they have a high-diversity code embedded within them. This allows a form of communication where the high-rate code opportunistically takes advantage of good channel realizations whereas the embedded high-diversity code ensures that at least part of the information is received reliably. This can also be thought as coding the data into two streams such that the high-priority stream has higher reliability than the low-priority stream. For SISO (single-input-single-output), SIMO, MISO and parallel fading channels, we characterize the achievable rates and reliability of the two streams in the high SNR regime in terms of the diversity-multiplexing tradeoff. We exhibit the performance gain over a single-stream code. We also show some constructions for finite block lengths that achieve the optimal performance
{"title":"Fundamental limits of diversity-embedded codes over fading channels","authors":"S. Diggavi, David Tse","doi":"10.1109/ISIT.2005.1523387","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523387","url":null,"abstract":"Diversity-embedded codes for fading channels are high-rate codes that are designed so that they have a high-diversity code embedded within them. This allows a form of communication where the high-rate code opportunistically takes advantage of good channel realizations whereas the embedded high-diversity code ensures that at least part of the information is received reliably. This can also be thought as coding the data into two streams such that the high-priority stream has higher reliability than the low-priority stream. For SISO (single-input-single-output), SIMO, MISO and parallel fading channels, we characterize the achievable rates and reliability of the two streams in the high SNR regime in terms of the diversity-multiplexing tradeoff. We exhibit the performance gain over a single-stream code. We also show some constructions for finite block lengths that achieve the optimal performance","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124602475","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523683
U. Erez, G. Wornell, M. Trott
Rateless codes are good codes of infinite length that have the property that prefixes of such codes are themselves good codes. This makes them attractive for applications in which the channel quality is uncertain, where systems transmit as much of a codeword as necessary for decoding to be possible. In particular, rateless codes are potentially attractive for wireless communication. In a recent work, a rateless coding scheme was proposed for the AWGN channel, based on layering, repetition and random dithering. We extend this scheme to multiple-input single-output (MISO) Gaussian channels. We show that the rate loss associated with orthogonal design space-time codes may be alleviated by layering and dithering, very similar to the rateless approach for the AWGN channel. We then combine the two schemes and arrive at a close-to-capacity rateless code for MISO channels. The required complexity depends on the fraction of capacity that is targeted, is linear in the capacity of the channel and does not depend on the number of transmit antennas. Furthermore, the coding scheme uses only one base AWGN code
{"title":"Rateless space-time coding","authors":"U. Erez, G. Wornell, M. Trott","doi":"10.1109/ISIT.2005.1523683","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523683","url":null,"abstract":"Rateless codes are good codes of infinite length that have the property that prefixes of such codes are themselves good codes. This makes them attractive for applications in which the channel quality is uncertain, where systems transmit as much of a codeword as necessary for decoding to be possible. In particular, rateless codes are potentially attractive for wireless communication. In a recent work, a rateless coding scheme was proposed for the AWGN channel, based on layering, repetition and random dithering. We extend this scheme to multiple-input single-output (MISO) Gaussian channels. We show that the rate loss associated with orthogonal design space-time codes may be alleviated by layering and dithering, very similar to the rateless approach for the AWGN channel. We then combine the two schemes and arrive at a close-to-capacity rateless code for MISO channels. The required complexity depends on the fraction of capacity that is targeted, is linear in the capacity of the channel and does not depend on the number of transmit antennas. Furthermore, the coding scheme uses only one base AWGN code","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130898551","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523606
Hongyuan Zhang, H. Dai, Quan Zhou
For MIMO diversity schemes, it is well known that antenna selection methods that optimize the post-processing signal-to-noise ratio can preserve the diversity order of the full MIMO system. On the other hand, the diversity order achieved by antenna selection in spatial multiplexing (SM) systems, especially those exploiting practical coding and decoding schemes, has not thus far been rigorously analyzed. In this paper, from a geometrical standpoint, we propose a new framework to theoretically analyze the diversity order achieved by transmit antenna selection for independently encoded SM systems with linear receivers. Our results show that a diversity order of (NT -1)(NR -1) can be achieved for an NRtimesNT SM system in which L = 2 antennas are selected from the transmit side
{"title":"A geometrical analysis on transmit antenna selection for spatial multiplexing systems with linear receivers","authors":"Hongyuan Zhang, H. Dai, Quan Zhou","doi":"10.1109/ISIT.2005.1523606","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523606","url":null,"abstract":"For MIMO diversity schemes, it is well known that antenna selection methods that optimize the post-processing signal-to-noise ratio can preserve the diversity order of the full MIMO system. On the other hand, the diversity order achieved by antenna selection in spatial multiplexing (SM) systems, especially those exploiting practical coding and decoding schemes, has not thus far been rigorously analyzed. In this paper, from a geometrical standpoint, we propose a new framework to theoretically analyze the diversity order achieved by transmit antenna selection for independently encoded SM systems with linear receivers. Our results show that a diversity order of (NT -1)(NR -1) can be achieved for an NRtimesNT SM system in which L = 2 antennas are selected from the transmit side","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128895410","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523721
M. Langberg, A. Sprintson, Jehoshua Bruck
In this paper we study the distribution of dynamic data over a broadcast channel to a large number of passive clients. The data is simultaneously distributed to clients in the form of discrete packets, each packet captures the most recent state of the information source. Clients obtain the information by accessing the channel and listening for the next available packet. This scenario, referred to as discrete broadcast, has many practical applications such as the distribution of stock information to wireless mobile devices and downloading up-to-date battle information in military networks. Our goal is minimize the amount of time a client has to wait in order to obtain a new data packet, i.e., the waiting time of the client. We show that we can significantly reduce the waiting time by adding redundancy to the schedule. We identify universal schedules that guarantee low waiting time for any client, regardless of the access pattern. A key point in the design of data distribution systems is to ensure that the transmitted information is always up-to-date. Accordingly, we introduce the notion of staleness that captures the amount of time that passes from the moment the information is generated, until it is delivered to the client. We investigate the fundamental trade-off between the staleness and the waiting time. In particular, we present schedules that yield lowest possible waiting time for any given staleness constraint
{"title":"Staleness vs. waiting time in universal discrete broadcast","authors":"M. Langberg, A. Sprintson, Jehoshua Bruck","doi":"10.1109/ISIT.2005.1523721","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523721","url":null,"abstract":"In this paper we study the distribution of dynamic data over a broadcast channel to a large number of passive clients. The data is simultaneously distributed to clients in the form of discrete packets, each packet captures the most recent state of the information source. Clients obtain the information by accessing the channel and listening for the next available packet. This scenario, referred to as discrete broadcast, has many practical applications such as the distribution of stock information to wireless mobile devices and downloading up-to-date battle information in military networks. Our goal is minimize the amount of time a client has to wait in order to obtain a new data packet, i.e., the waiting time of the client. We show that we can significantly reduce the waiting time by adding redundancy to the schedule. We identify universal schedules that guarantee low waiting time for any client, regardless of the access pattern. A key point in the design of data distribution systems is to ensure that the transmitted information is always up-to-date. Accordingly, we introduce the notion of staleness that captures the amount of time that passes from the moment the information is generated, until it is delivered to the client. We investigate the fundamental trade-off between the staleness and the waiting time. In particular, we present schedules that yield lowest possible waiting time for any given staleness constraint","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120937946","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523550
J. Hiltunen, C. Hollanti, J. Lahtonen
We construct some geometrically dense matrix lattices with good minimum determinants for 4 transmit antenna MISO applications. The construction is based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform the earlier rectangular lattices as well as the DAST-lattice
{"title":"Dense full-diversity matrix lattices for four transmit antenna MISO channel","authors":"J. Hiltunen, C. Hollanti, J. Lahtonen","doi":"10.1109/ISIT.2005.1523550","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523550","url":null,"abstract":"We construct some geometrically dense matrix lattices with good minimum determinants for 4 transmit antenna MISO applications. The construction is based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform the earlier rectangular lattices as well as the DAST-lattice","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126575527","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 : 2005-10-31DOI: 10.1109/ISIT.2005.1523409
Daniel J. Ryan, I. Clarkson, I. Collings
This paper presents performance bounds for block-based detection of PAM and QAM transmitted over non-coherent channels. Such channels give rise to inherent detection ambiguities since multiple possible transmit sequences can have the same likelihood. The number of ambiguous sequences is a function of the block length. In this paper, we derive the probability of detection error in terms of a Dedekind zeta function of the block length, for infinite-sized constellations and zero noise. We also provide expressions for finite constellations which can be evaluated in polynomial time with the constellation size, as opposed to checking all possible sequences
{"title":"Detection error probabilities in noncoherent channels","authors":"Daniel J. Ryan, I. Clarkson, I. Collings","doi":"10.1109/ISIT.2005.1523409","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523409","url":null,"abstract":"This paper presents performance bounds for block-based detection of PAM and QAM transmitted over non-coherent channels. Such channels give rise to inherent detection ambiguities since multiple possible transmit sequences can have the same likelihood. The number of ambiguous sequences is a function of the block length. In this paper, we derive the probability of detection error in terms of a Dedekind zeta function of the block length, for infinite-sized constellations and zero noise. We also provide expressions for finite constellations which can be evaluated in polynomial time with the constellation size, as opposed to checking all possible sequences","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126631149","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
扫码关注我们
求助内容：
应助结果提醒方式：