Change search
Refine search result
1 - 15 of 15
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1.
    Chia, Yeow-Khiang
    et al.
    Institute for Infocomm Research, Singapore.
    Kittichokechai, Kittipong
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On secure source coding with side information at the encoder2013In: 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE, 2013, p. 2204-2208Conference paper (Refereed)
    Abstract [en]

    We consider a secure source coding problem with side informations at the decoder and the eavesdropper. The encoder has a source that it wishes to describe with limited distortion through a rate-limited link to a legitimate decoder. The message sent is also observed by the eavesdropper. The encoder aims to minimize both the distortion incurred by the legitimate decoder; and the information leakage rate at the eavesdropper. When the encoder has access to the side information (S.I.) at the decoder, we characterize the rate-distortion-information leakage rate (R.D.I.) region under a Markov chain assumption and when S.I. at the encoder does not improve the rate-distortion region as compared to the case when S.I. is absent. We then extend our setting to consider the case where the encoder and decoder obtain coded S.I. through a rate-limited helper, and characterize the R.D.I. region for several special cases under logarithmic loss distortion (log-loss). Finally, we consider the case of list or entropy constraints at the decoder and show that the R.D.I. region coincides with R.D.I. region under log-loss.

  • 2.
    Kittichokechai, Kittipong
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Communication With Reconstruction and Privacy Constraints2014Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Communication networks are an integral part of the Internet of Things (IoT) era. They enable endless opportunities for connectivity in a wide range of applications, leading to advances in efficiency of day-to-day life. While creating opportunities, they also incur several new challenges. In general, we wish to design a system that performs optimally well in all aspects. However, there usually exist competing objectives which lead to tradeoffs. In this thesis, driven by several applications, new features and objectives are included into the system model, making it closer to reality and needs. The results presented in this thesis aim at providing insight into the fundamental tradeoff of the system performance which can serve as a guideline for the optimal design of real-world communication systems.

    The thesis is divided into two parts. The first part considers the aspect of signal reconstruction requirement as a new objective in the source and channel coding problems. In this part, we consider the framework where the quality and/or availability of the side information can be influenced by a cost-constrained action sequence. In the source coding problem, we impose a constraint on the reconstruction sequence at the receiver that it should be reproduced at the sender, and characterize the fundamental tradeoff in the form of the rate-distortion-cost region, revealing the optimal relation between compression rate, distortion, and action cost. The channel coding counterpart is then studied where a reconstruction constraint is imposed on the channel input sequence such that it should be reconstructed at the receiver. An extension to the multi-stage channel coding problem is also considered where inner and outer bounds to the capacity region are given. The result on the channel capacity reveals interesting consequence of imposing an additional reconstruction requirement on the system model which has a causal processing structure.

    In the second part, we consider the aspect of information security and privacy in lossy source coding problems. The sender wishes to compress the source sequence in order to satisfy a distortion criterion at the receiver, while revealing only limited knowledge about the source to an unintended user. We consider three different aspects of information privacy. First, we consider privacy of the source sequence against the eavesdropper in the problem of source coding with action-dependent side information. Next, we study privacy of the source sequence due to the presence of a public helper in distributed lossy source coding problems. The public helper is assumed to be either a user who provides side information over a public link which can be eavesdropped, or a legitimate user in the network who helps to relay information to the receiver, but may not ignore the information that is not intended for it. Lastly, we take on a new perspective of information privacy in the source coding problem. That is, instead of protecting the source sequence, we are interested in the privacy of the reconstruction sequence with respect to a user in the system. For above settings, we provide the complete characterization of the rate-distortion(-cost)-leakage/equivocation region or corresponding inner and outer bounds for discrete memoryless systems.

  • 3.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Chia, Yeow-Khiang
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Weissman, Tsachy
    Secure Source Coding With a Public Helper2016In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 62, no 7, p. 3930-3949Article in journal (Refereed)
    Abstract [en]

    We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper and 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff among transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of the rate-distortion-leakage region for various classes of problems.

  • 4.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Chia, Yeow-Khiang
    Institute for Infocomm Research, Singapore.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Weissman, Tsachy
    Stanford University, USA.
    Secure Source Coding with a Public Helper2013In: IEEE International Symposium on Information Theory, IEEE conference proceedings, 2013, p. 2209-2213Conference paper (Refereed)
    Abstract [en]

    We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eavesdropper, 2) triangular source coding with a helper where the helper is considered as a public terminal. We are interested in how the helper can support the source transmission subject to a constraint on the amount of information leaked due to its public nature. We characterize the tradeoff between transmission rate, incurred distortion, and information leakage rate at the helper/eavesdropper in the form of a rate-distortion-leakage region for various classes of problems.

  • 5.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Capacity of the Channel With Action-dependent State and Reversible Input2011In: 2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011, 2011, p. 24-28Conference paper (Refereed)
    Abstract [en]

    We consider a problem of coding for channels with action-dependent states available noncausally to the encoder where the decoder is additionally required to be able to decode the channel input reliably. The complete characterization of the channel capacity is given in this work to complete our previous result presented in ISIT 2011. The key contribution essentially lies in the converse proof of the capacity result where the restriction on the set of input distribution is shown to coincide with the two-stage coding condition. Some interesting discussion on the two-stage coding condition and the connection to the multiple-access setting is also provided.

  • 6.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Coding With Action-Dependent Side Information and Additional Reconstruction Requirements2015In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 61, no 11, p. 6355-6367Article in journal (Refereed)
    Abstract [en]

    Two classes of source/channel coding problems, namely, coding with action-dependent side information and coding with additional signal reconstruction are considered in a unified fashion. In the source coding setting, a decoder wishes to reconstruct the source subject to a distortion constraint, while an encoder is required to estimate the decoder's reconstruction reliably. Side information is action-dependent in the sense that its quality and/or availability at the encoder or decoder can be influenced by a cost-constrained action sequence. In the channel coding dual, the decoder wishes to decode both the message and the channel input sequence reliably, and the channel state information available at the encoder or decoder is assumed to depend on the action sequence. We consider discrete memoryless systems and characterize single letter expressions for the rate-distortion-cost function and channel capacity for the respective source and channel coding problems.

  • 7.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Lossy Source Coding with Reconstruction Privacy2014In: 2014 IEEE International Symposium on Information Theory (ISIT), IEEE , 2014, p. 386-390Conference paper (Refereed)
    Abstract [en]

    We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender, or a helper. We are interested in how the reconstruction privacy constraint at a particular terminal affects the rate-distortion tradeoff. In this work, we allow the decoder to use a random mapping, and give inner and outer bounds to the rate-distortion-equivocation region for different cases. In the case where each reconstruction symbol depends only on the source description and current side information symbol, the complete rate-distortion-equivocation region is provided. A binary example illustrating a new tradeoff due to the new privacy constraint, and a gain from the use of randomized decoder is given.

  • 8.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Multi-stage coding for channels with a rewrite option and reversible input2012In: Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, IEEE , 2012, p. 3063-3067Conference paper (Refereed)
    Abstract [en]

    We consider a problem of constrained multi-stage coding for channels with a rewrite option. It is a natural extension of Weissman's channels with action-dependent states to the multistage coding case where an encoder in each stage observes its own message as well as all previous-stage messages, inputs, and outputs. In addition to decoding all messages at the final stage, the new reconstruction constraint introduced in Sumszyk and Steinberg's information embedding with reversible stegotext is imposed on the problem such that the decoder is required to be able to reconstruct all channel input sequences reliably. The complete characterization of the channel capacity region is given for the two-stage case, while the inner and outer bounds to the capacity regions for the cases of three or more stages are provided. For the two-stage case, a discussion regarding the rate constraint of the message in the second stage is also given in which we can draw a connection to the two-stage coding condition which appears in our previous study on channel with action-dependent state and reversible input.

  • 9.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    On the capacity of a channel with action-dependent state and reversible input2011In: IEEE International Symposium on Information Theory - Proceedings, 2011, p. 331-335Conference paper (Refereed)
    Abstract [en]

    We consider a problem of coding for channels with action-dependent states available noncausally to the encoder where the decoder is additionally required to be able to decode the channel input reliably. Lower and upper bounds on the channel capacity are derived. It is shown that the capacity is determined if there exists a maximizing joint probability distribution in the upper bound which satisfies the two-stage coding condition, and it, in turn, reveals the formula duality between this problem and that of source coding with common reconstruction and action-dependent side information. We also state two simple coding schemes and the corresponding achievable rates for the cases where the two-stage coding condition is not fulfilled.

  • 10.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Secure source coding with action-dependent side information2011In: IEEE International Symposium on Information Theory - Proceedings, 2011, p. 1678-1682Conference paper (Refereed)
    Abstract [en]

    We consider a secure lossy source coding problem with the presence of an eavesdropper who has access to the source description. An encoder wants to compress the source in such a way that the intended decoder can reconstruct the source sequence and satisfy a distortion criterion, while revealing only limited knowledge about the source to the eavesdropper. In our system an action sequence is generated based on the source description with some costs to influence the side information available to the legitimate decoder and the eavesdropper. We provide a complete characterization of the rate-distortion- cost-equivocation region for a discrete source with correlated action-dependent side information at the decoders. The result serves as a fundamental limit for example in secure sensor networking.

  • 11.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Source Coding With Common Reconstruction and Action-dependent Side Information2010In: 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings, IEEE , 2010, p. 5592707-Conference paper (Refereed)
    Abstract [en]

    We determine the rate region of a source coding problem with common reconstruction and action-dependent side information where an action sequence is taken by an encoder over a rate-limited link. We show that the rate region depends only on the sum-rate and the sum-rate distortion and cost function is characterized. The result serves as a fundamental limit in transmission scenarios where the encoder wants to control and monitor the quality of the decoder's reconstruction via the respective uses of action sequences and a common reconstruction constraint.

  • 12.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Theory.
    Chia, Yeow-Khiang
    Secure Source Coding With Action-Dependent Side Information2015In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 61, no 12, p. 6444-6464Article in journal (Refereed)
    Abstract [en]

    We consider the problems of secure lossy source coding with side information in the presence of a passive eavesdropper who has access to the source description. The encoder wishes to compress the source sequence in order to satisfy a distortion criterion at the decoder, while revealing only limited knowledge about the source to the eavesdropper. The side information available to the encoder, the legitimate decoder, or the eavesdropper can be influenced by a cost-constrained action sequence. Three different settings are studied. In the first two settings, we are interested in understanding the influence of the action sequence on the rate-distortion-leakage tradeoff where the action is taken either by the decoder or by the encoder to influence side information at the decoder and eavesdropper. Next, we consider a setting where common action-dependent side information is available securely to both encoder and decoder, and thus can be used for secret key generation. We characterize the optimal rate-distortion-cost-leakage region or the corresponding inner bounds for a discrete memoryless source for above settings. The results are useful in characterizing fundamental limits for example in secure sensor networking and future cyber physical systems.

  • 13.
    Kittichokechai, Kittipong
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Thobaben, Ragnar
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Source and channel coding with action-dependent partially known two-sided state information2010In: IEEE International Symposium on Information Theory - Proceedings, 2010, p. 629-633Conference paper (Refereed)
    Abstract [en]

    We consider a source coding problem where the encoder can take actions that influence the availability and/or quality of the side information which is available partially and noncausally at the encoder and the decoder. We then characterize the associated achievable tradeoffs between rate, distortion, and cost. In addition, we state and discuss a capacity result for the channel coding dual problem where the formula duality of special cases is recognized.

  • 14.
    Li, Zuxing
    et al.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Kittichokechai, Kittipong
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Parallel Distributed Bayesian Detection with Privacy Constraints2014In: Proceedings of the IEEE International Conference on Communications (ICC) 2014, 2014, p. 2178-2183Conference paper (Refereed)
    Abstract [en]

    In this paper, the privacy problem of a parallel distributed detection system vulnerable to an eavesdropper is proposed and studied in the Bayesian formulation. The privacy risk is evaluated by the detection cost of the eavesdropper which is assumed to be informed and greedy. It is shown that the optimal detection strategy of the sensor whose decision is eavesdropped on is a likelihood-ratio test. This fundamental insight allows for the optimization to reuse known algorithms extended to incorporate the privacy constraint. The trade-off between the detection performance and privacy risk is illustrated in a numerical example. The incorporation of physical layer privacy in the system design will lead to trustworthy sensor networks in future.

  • 15.
    Xu, Derek
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Kittichokechai, Kittipong
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Oechtering, Tobias J.
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skoglund, Mikael
    KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Secure Successive Refinement with Degraded Side Information2014In: 2014 IEEE International Symposium on Information Theory (ISIT), IEEE , 2014, p. 2674-2678Conference paper (Refereed)
    Abstract [en]

    In this paper, we investigate the problem of successive refinement with side information (SI) under secrecy constraint. In particular, under classical successive refinement coding scheme, there are degraded SI sequences Y-n and Z(n) at two decoders and E-n at the eavesdropper. Based on the status of two switches, three different cases are investigated. In case 1 and 3, the eavesdropper only observes output of encoder 1 and 2, respectively, while in case 2, the eavesdropper observes outputs of both encoder 1 and 2. The Markov chain X - Y - (Z, E) holds in all cases. The equivocation is measured by the normalized entropy of source sequence conditioned on the observation of eavesdropper. We completely characterize the rate-distortion-equivocation regions for all three cases, and show that layered coding is optimal. Finally, a binary source example is given.

1 - 15 of 15
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf