Change search
Link to record
Permanent link

Direct link
BETA
Oechtering, Tobias J.ORCID iD iconorcid.org/0000-0002-0036-9049
Alternative names
Publications (10 of 133) Show all publications
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2019). Operational Equivalence of Distributed Hypothesis Testing and Identification Systems. In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT): . Paper presented at IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019 (pp. 1999-2003). IEEE
Open this publication in new window or tab >>Operational Equivalence of Distributed Hypothesis Testing and Identification Systems
2019 (English)In: Proceedings 2019 IEEE International Symposium on Information Theory (ISIT), IEEE , 2019, p. 1999-2003Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we revisit the connections of the distributed hypothesis testing against independence (HT) problem with the Wyner-Ahlswede-Korner (WAK) problem and the identification systems (ID). We show that the strong converse for the WAK problem is equivalent to the strong converse for the HT problem via constructive and nonconstructive transformations of codes. As another consequence of the transformation we provide a new exponentially strong converse equivalence statement. Applying the same idea, we prove a new result that the epsilon-identification capacity of the ID problem is equal to the maximum epsilon-exponent of type II of error in the HT problem when both side compression is allowed.

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-263388 (URN)10.1109/ISIT.2019.8849571 (DOI)000489100302019 ()2-s2.0-85073166961 (Scopus ID)
Conference
IEEE International Symposium on Information Theory (ISIT), Paris, FRANCE, JUL 07-12, 2019
Note

QC 20191114

Available from: 2019-11-14 Created: 2019-11-14 Last updated: 2019-11-14Bibliographically approved
Treust, M. L. & Oechtering, T. J. (2019). Optimal Control Designs for Vector-valued Witsenhausen Counterexample Setups. In: 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018: . Paper presented at 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, 2 October 2018 through 5 October 2018 (pp. 532-537). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Optimal Control Designs for Vector-valued Witsenhausen Counterexample Setups
2019 (English)In: 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, Institute of Electrical and Electronics Engineers Inc. , 2019, p. 532-537Conference paper, Published paper (Refereed)
Abstract [en]

In this work, necessary and sufficient conditions for empirical coordination of vector-valued Witsenhausen counter-example two terminal setups with non-classical information structure are derived. Vector-valued processing allows to involve coding in the design of the control strategies. Optimal characterizations are obtained for the non-causal encoding and causal decoding case as well as causal encoding and non-causal decoding case. Necessary and sufficient conditions are provided for the case with both non-causal encoding and decoding. The feasible set of target distributions can serve as optimization domain for characterizing the optimal average cost, in particular using Witsenhausen's cost function.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2019
Keywords
Cost functions, Decoding, Signal encoding, Causal coding, Classical information, Empirical coordinations, Encoding and decoding, feasible target distributions, Optimal control design, Optimization domain, Witsenhausen counterexample, Encoding (symbols)
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-252076 (URN)10.1109/ALLERTON.2018.8635949 (DOI)000461021200075 ()2-s2.0-85062856936 (Scopus ID)
Conference
56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, 2 October 2018 through 5 October 2018
Note

QC 20190731

Available from: 2019-07-31 Created: 2019-07-31 Last updated: 2019-07-31Bibliographically approved
Li, Z., Oechtering, T. J. & Gunduz, D. (2019). Privacy Against a Hypothesis Testing Adversary. IEEE Transactions on Information Forensics and Security, 14(6), 1567-1581
Open this publication in new window or tab >>Privacy Against a Hypothesis Testing Adversary
2019 (English)In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 14, no 6, p. 1567-1581Article in journal (Refereed) Published
Abstract [en]

Privacy against an adversary (AD) that tries to detect the underlying privacy-sensitive data distribution is studied. The original data sequence is assumed to come from one of the two known distributions, and the privacy leakage is measured by the probability of error of the binary hypothesis test carried out by the AD. A management unit (MU) is allowed to manipulate the original data sequence in an online fashion while satisfying an average distortion constraint. The goal of the MU is to maximize the minimal type II probability of error subject to a constraint on the type I probability of error assuming an adversarial Neyman-Pearson test, or to maximize the minimal error probability assuming an adversarial Bayesian test. The asymptotic exponents of the maximum minimal type II probability of error and the maximum minimal error probability are shown to be characterized by a Kullback-Leibler divergence rate and a Chernoff information rate, respectively. Privacy performances of particular management policies, the memoryless hypothesis-aware policy and the hypothesis-unaware policy with memory, are compared. The proposed formulation can also model adversarial example generation with minimal data manipulation to fool classifiers. At last, the results are applied to a smart meter privacy problem, where the user's energy consumption is manipulated by adaptively using a renewable energy source in order to hide user's activity from the energy provider.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Keywords
Neyman-Pearson test, Bayesian test, information theory, large deviations, privacy-enhancing technology
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-247798 (URN)10.1109/TIFS.2018.2882343 (DOI)000460659400001 ()2-s2.0-85058482049 (Scopus ID)
Note

QC 20190401

Available from: 2019-04-01 Created: 2019-04-01 Last updated: 2019-04-01Bibliographically approved
Li, Z. & Oechtering, T. J. (2019). Privacy-utility management of hypothesis tests. In: 2018 IEEE Information Theory Workshop, ITW 2018: . Paper presented at 2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018. Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Privacy-utility management of hypothesis tests
2019 (English)In: 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc. , 2019Conference paper, Published paper (Refereed)
Abstract [en]

The trade-off of hypothesis tests on the correlated privacy hypothesis and utility hypothesis is studied. The error exponent of the Bayesian composite hypothesis test on the privacy or utility hypothesis can be characterized by the corresponding minimal Chernoff information rate. An optimal management protects the privacy by minimizing the error exponent of the privacy hypothesis test and meanwhile guarantees the utility hypothesis testing performance by satisfying a lower bound on the corresponding minimal Chernoff information rate. The asymptotic minimum error exponent of the privacy hypothesis test is shown to be characterized by the infimum of corresponding minimal Chernoff information rates subject to the utility guarantees.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2019
Keywords
Economic and social effects, Errors, Information theory, Chernoff information, Composite hypothesis, Error exponent, Hypothesis testing, Hypothesis tests, Lower bounds, Optimal management, Utility management, Statistical tests
National Category
Mathematics
Identifiers
urn:nbn:se:kth:diva-248275 (URN)10.1109/ITW.2018.8613427 (DOI)000467849900090 ()2-s2.0-85062110822 (Scopus ID)9781538635995 (ISBN)
Conference
2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018
Note

QC 20190405

Available from: 2019-04-05 Created: 2019-04-05 Last updated: 2019-06-10Bibliographically approved
Wiese, M., Oechtering, T. J., Johansson, K. H., Papadimitratos, P., Sandberg, H. & Skoglund, M. (2019). Secure Estimation and Zero-Error Secrecy Capacity. IEEE Transactions on Automatic Control, 64(3), 1047-1062
Open this publication in new window or tab >>Secure Estimation and Zero-Error Secrecy Capacity
Show others...
2019 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 64, no 3, p. 1047-1062Article in journal (Refereed) Published
Abstract [en]

We study the problem of securely estimating the states of an unstable dynamical system subject to non-stochastic disturbances. The estimator obtains all its information through an uncertain channel, which is subject to nonstochastic disturbances as well, and an eavesdropper obtains a disturbed version of the channel inputs through a second uncertain channel. An encoder observes and block encodes the states in such a way that, upon sending the generated codeword, the estimator's error is bounded and a security criterion is satisfied, thereby ensuring that the eavesdropper obtains as little state information as possible. Two security criteria are considered and discussed with the help of a numerical example. A sufficient condition on the uncertain wiretap channel, i.e., the pair formed by the uncertain channel from the encoder to the estimator and the uncertain channel from the encoder to the eavesdropper is derived, which ensures that a bounded estimation error and security are achieved. This condition is also shown to be necessary for a subclass of uncertain wiretap channels. To formulate the condition, the zero-error secrecy capacity of uncertain wiretap channels is introduced, i.e., the maximal rate at which data can be transmitted from the encoder to the estimator in such a way that the eavesdropper is unable to reconstruct the transmitted data. Finally, the zero-error secrecy capacity of uncertain wiretap channels is studied.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019
Keywords
Secure state estimation, uncertain wiretap channel, zero-error secrecy capacity
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-247828 (URN)10.1109/TAC.2018.2849620 (DOI)000460415600012 ()2-s2.0-85048871914 (Scopus ID)
Note

QC 20190326

Available from: 2019-03-26 Created: 2019-03-26 Last updated: 2019-03-26Bibliographically approved
Avula, R. R., Oechtering, T. J., Chin, J.-X. & Hug, G. (2019). Smart Meter Privacy Control Strategy Including Energy Storage Degradation. In: 2019 IEEE Milan PowerTech: . Paper presented at 2019 IEEE Milan PowerTech. IEEE
Open this publication in new window or tab >>Smart Meter Privacy Control Strategy Including Energy Storage Degradation
2019 (English)In: 2019 IEEE Milan PowerTech, IEEE, 2019Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we present a degradation-aware privacy control strategy for smart meters by taking into account the capacity fade and energy loss of the battery, which has not been included previously. The energy management strategy is designed by minimizing the weighted sum of both privacy loss and total energy storage losses, where the weightage is set using a trade-off parameter. The privacy loss is measured in terms of Bayesian risk of an unauthorized hypothesis test. By making first-order Markov assumptions, the stochastic parameters of energy loss and capacity fade of the energy storage system are modelled using degradation maps. Using household power consumption data from the ECO dataset, the proposed control strategy is numerically evaluated for different trade-off parameters. Results show that, by including the degradation losses in the design of the privacy-enhancing control strategy, significant improvement in battery life can be achieved, in general, at the expense of some privacy loss.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
Smart meter privacy, energy storage system model, partially observable Markov decision process, Bayesian hypothesis testing, energy storage degradation, Privacy, Degradation, Batteries, Hidden Markov models, Energy loss, Bayes methods
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-259388 (URN)10.1109/PTC.2019.8810481 (DOI)2-s2.0-85072325395 (Scopus ID)
Conference
2019 IEEE Milan PowerTech
Note

QC 20191106

Available from: 2019-09-14 Created: 2019-09-14 Last updated: 2019-11-13
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2019). Testing in identification systems. In: 2018 IEEE Information Theory Workshop, ITW 2018: . Paper presented at 2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018. Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Testing in identification systems
2019 (English)In: 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc. , 2019Conference paper, Published paper (Refereed)
Abstract [en]

We study a hypothesis testing problem to decide whether or not an observation sequence is related to one of users in a database which contains compressed versions of users' data. Our main interest lies on the characterization of the exponent of the probability of the second kind of error when the number of users in the database grows exponentially. We show a lower bound on the error exponent and identify special cases where the bound is tight. Next, we study the -achievable error exponent and show a sub-region where the lower bound is tight.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2019
Keywords
Information-spectrum method, Mixture distribution, Strong converse, Errors, Error exponent, Hypothesis testing, Information spectrum, Lower bounds, Mixture distributions, Second kinds, Sub-regions, Information theory
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-248277 (URN)10.1109/ITW.2018.8613310 (DOI)2-s2.0-85062066143 (Scopus ID)9781538635995 (ISBN)
Conference
2018 IEEE Information Theory Workshop, ITW 2018, 25 November 2018 through 29 November 2018
Note

QC 20190405

Available from: 2019-04-05 Created: 2019-04-05 Last updated: 2019-04-05Bibliographically approved
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2018). Gaussian hierarchical identification with pre-processing. In: Data Compression Conference Proceedings: . Paper presented at 2018 Data Compression Conference, DCC 2018, 27 March 2018 through 30 March 2018 (pp. 277-286). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Gaussian hierarchical identification with pre-processing
2018 (English)In: Data Compression Conference Proceedings, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 277-286Conference paper, Published paper (Refereed)
Abstract [en]

In this work we consider a two-stage identification problem with pre-processing where the users' data and observation are Gaussian distributed. In the first stage the processing unit returns a list of compatible users using the information from the first storage layer and the pre-processed observation. Then, the refined search is performed in the second stage where the processing unit returns the exact user's identity and a corresponding reconstruction sequence. We provide a complete rate-distortion trade-off for the Gaussian setting.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2018
Keywords
Compression, Identification system, Compaction, Digital storage, Economic and social effects, Electric distortion, Gaussian distribution, Image coding, Signal distortion, Gaussian distributed, Gaussian setting, Hierarchical identification, Pre-processing, Processing units, Rate distortion trade-off, Storage layers, Two-stage identification, Data compression
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-238076 (URN)10.1109/DCC.2018.00036 (DOI)2-s2.0-85050965248 (Scopus ID)9781538648834 (ISBN)
Conference
2018 Data Compression Conference, DCC 2018, 27 March 2018 through 30 March 2018
Note

Conference code: 138136; Export Date: 30 October 2018; Conference Paper; CODEN: DDCCF

QC 20190114

Available from: 2019-01-14 Created: 2019-01-14 Last updated: 2019-01-14Bibliographically approved
You, Y., Li, Z. & Oechtering, T. J. (2018). Optimal Privacy-Enhancing and Cost-Efficient Energy Management Strategies for Smart Grid Consumers. In: 2018 IEEE Statistical Signal Processing Workshop, SSP 2018: . Paper presented at 20th IEEE Statistical Signal Processing Workshop, SSP 2018, 10 June 2018 through 13 June 2018 (pp. 144-148). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Optimal Privacy-Enhancing and Cost-Efficient Energy Management Strategies for Smart Grid Consumers
2018 (English)In: 2018 IEEE Statistical Signal Processing Workshop, SSP 2018, Institute of Electrical and Electronics Engineers Inc. , 2018, p. 144-148Conference paper, Published paper (Refereed)
Abstract [en]

The design of optimal energy management strategies that trade-off consumers' privacy and expected energy cost by using an energy storage is studied. The Kullback-Leibler divergence rate is used to assess the privacy risk of the unauthorized testing on consumers' behavior. We further show how this design problem can be formulated as a belief state Markov decision process problem so that standard tools of the Markov decision process framework can be utilized, and the optimal solution can be obtained by using Bellman dynamic programming. Finally, we illustrate the privacy-enhancement and cost-saving by numerical examples. 

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2018
Keywords
Kullback-Leibler divergence, Markov decision process, privacy-cost trade-off, Smart metering system, Consumer behavior, Costs, Decision making, Dynamic programming, Economic and social effects, Electric power transmission networks, Energy management, Markov processes, Risk assessment, Signal processing, Cost trade-off, Design problems, Energy management strategies, Expected energy, Kullback Leibler divergence, Markov Decision Processes, Optimal solutions, Smart metering systems, Smart power grids
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-236742 (URN)10.1109/SSP.2018.8450736 (DOI)2-s2.0-85053832174 (Scopus ID)9781538615706 (ISBN)
Conference
20th IEEE Statistical Signal Processing Workshop, SSP 2018, 10 June 2018 through 13 June 2018
Note

Conference code: 139091; Export Date: 22 October 2018; Conference Paper; Funding details: VR, Vetenskapsrådet; Funding details: 2015-06815, CHIST-ERA; Funding text: The work has been supported by the Swedish Research Council (VR) within the CHIST-ERA project COPES under Grant 2015-06815.. QC 20181022

Available from: 2018-10-22 Created: 2018-10-22 Last updated: 2018-10-22Bibliographically approved
Cao, P. & Oechtering, T. J. (2018). Optimal Transmit Strategies for Gaussian MISO Wiretap Channels. IEEE Transactions on Information Forensics and Security
Open this publication in new window or tab >>Optimal Transmit Strategies for Gaussian MISO Wiretap Channels
2018 (English)In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021Article in journal (Other academic) Submitted
Abstract [en]

This paper studies the optimal tradeoff between secrecy and non-secrecy rates of the MISO wiretap channels for different power constraint settings:sum power constraint only, per-antenna power constraints only and joint sum and per-antenna power constraints. The problem is motivated by the fact thatchannel capacity and secrecy capacity are generally achieved by different transmit strategies. First, a necessary and sufficient condition to ensure a positive secrecy capacity is shown. The optimal tradeoff between secrecy rate and transmission rate is characterized by a weighted rate sum maximization problem. Since this problem is not necessarily convex, equivalent problem formulations are introduced to derive the optimal transmit strategies. Under sum power constraint only, a closed-form solution is provided. Under per-antenna power constraints, necessary conditions to find the optimal power allocation are provided. Sufficient conditions are provided for the special case of two transmit antennas. For the special case of parallel channels, the optimal transmit strategies can deduced from an equivalent point-to-point channel problem. Lastly, the theoretical results are illustrated by numerical simulations.

National Category
Computer Systems
Identifiers
urn:nbn:se:kth:diva-247970 (URN)
Note

QC 20190401

Available from: 2019-03-29 Created: 2019-03-29 Last updated: 2019-04-01Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-0036-9049

Search in DiVA

Show all publications