Kittipong Kittichokechai

Kittipong Kittichokechai
Technische Universität Berlin | TUB

About

25
Publications
1,967
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
181
Citations
Additional affiliations
October 2009 - September 2015
KTH Royal Institute of Technology
Position
  • PhD Student

Publications

Publications (25)
Article
Full-text available
The fifth-generation (5G) wireless technology is primarily designed to address a wide range of use cases categorized into the enhanced mobile broadband (eMBB), ultra-reliable and low latency communication (URLLC), and massive machine-type communication (mMTC). Nevertheless, there are a few other use cases that are in-between these main use cases su...
Preprint
The fifth generation (5G) wireless technology is primarily designed to address a wide range of use cases categorized into the enhanced mobile broadband (eMBB), ultra-reliable and low latency communication (URLLC), and massive machine-type communication (mMTC). Nevertheless, there are a few other use cases which are in-between these main use cases s...
Preprint
The 5th generation (5G) new radio (NR) is designed to support a wide range of use cases, requirements, and services from enhanced mobile broadband (eMBB) to ultra-reliable low-latency communications (URLLC). NR signals are designed to meet stringent requirements, and in particular the physical downlink control channel (PDCCH) which requires careful...
Article
The problem of secret-key based authentication under a privacy constraint on the source sequence is considered. The identifier measurements during authentication are assumed to be controllable via a cost-constrained “action” sequence. Single-letter characterizations of the optimal trade-off among the secret-key rate, storage rate, privacy-leakage r...
Article
Full-text available
We consider problems of two-user secret key generation through an intermediate relay. Each user observes correlated source sequences and communicates to the relay over rate-limited noiseless links. The relay processes and broadcasts information to the two users over another rate-limited link. The users then generate a common secret key based on the...
Article
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...
Article
Full-text available
We consider the problem of revealing/sharing data in an efficient and secure way via a compact representation. The representation should ensure reliable reconstruction of the desired features/attributes while still preserve privacy of the secret parts of the data. The problem is formulated as a remote lossy source coding with a privacy constraint w...
Article
Full-text available
We consider the problem of identification and authentication based on secret key generation from some user-generated source data (e.g., a biometric source). The goal is to reliably identify users pre-enrolled in a database as well as authenticate them based on the estimated secret key while preserving the privacy of the enrolled data and of the gen...
Article
Full-text available
We consider problems of authentication using secret key generation under a privacy constraint on the enrolled source data. An adversary who has access to the stored description and correlated side information tries to deceive the authentication as well as learn about the source. We characterize the optimal tradeoff between the compression rate of t...
Conference Paper
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 Yn and Zn at two decoders and En at the eavesdropper. Based on the status of two switches, three different cases are investigated....
Article
Full-text available
We consider the problem of lossy source coding with side information under a secrecy 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...
Article
Full-text available
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 ar...
Article
We consider a secure source coding problem with side information (S.I.) 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...
Conference Paper
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 messa...
Article
Full-text available
Constrained lossy source coding and channel coding with side information problems which extend the classic Wyner-Ziv and Gel'fand-Pinsker problems are considered. Inspired by applications in sensor networking and control, we first consider lossy source coding with two-sided partial side information where the quality/availability of the side informa...
Conference Paper
Full-text available
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 eavesdr...
Conference Paper
Full-text available
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 probabil...
Conference Paper
Full-text available
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 fundamenta...
Conference Paper
Full-text available
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 ca...

Network

Cited By