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 138) Show all publications
Cao, P. & Oechtering, T. J. (2020). Optimal Transmit Strategies for Gaussian MISO Wiretap Channels. IEEE Transactions on Information Forensics and Security, 15, 829-838
Open this publication in new window or tab >>Optimal Transmit Strategies for Gaussian MISO Wiretap Channels
2020 (English)In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 15, p. 829-838Article in journal (Refereed) Published
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 that channel 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 derived. Sufficient conditions are provided for the special case of two transmit antennas. For the special case of aligned channels, the optimal transmit strategies can deduced from an equivalent point-to-point channel problem. Last, the theoretical results are illustrated by numerical simulations.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2020
Keywords
Wiretap channels, per-antenna power constraints, secrecy rate, optimal transmit strategy
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-264151 (URN)10.1109/TIFS.2019.2929474 (DOI)000493566500023 ()2-s2.0-85069917662 (Scopus ID)
Funder
Swedish Research Council, 2016-03853
Note

QC 20191209. QC 20200319

Available from: 2019-12-09 Created: 2019-12-09 Last updated: 2020-03-19Bibliographically approved
Zhou, L., Vu, M. T., Oechtering, T. J. & Skoglund, M. (2019). Fundamental Limits for Biometric Identification Systems without Privacy Leakage. In: Proceedings 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton): . Paper presented at 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 24-27 Sept. 2019. IEEE
Open this publication in new window or tab >>Fundamental Limits for Biometric Identification Systems without Privacy Leakage
2019 (English)In: Proceedings 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE, 2019Conference paper, Published paper (Refereed)
Abstract [en]

Wewithout privacy leakage. Privacy-preserving biometric identifi- cation systems that involve helper data, secret keys and private keys are considered. The helper data are stored in a public database and can be used to support the user identification. The secret key is either stored in an encrypted database or handed to the user, which can be used for authentication. Since the helper data are public and releasing the biometric information invokes privacy issues, the public helper data can only leak a negligible amount of biometric information. To achieve this, we use private keys to mask the helper data such that the public helper data contain as little as possible information about the biometrics. Moreover, a two-stage extension is also studied, where the clustering method is used such that the search complexity in the identification phase can be reduced. identification

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Telecommunications
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-271127 (URN)10.1109/ALLERTON.2019.8919895 (DOI)2-s2.0-85077789237 (Scopus ID)978-1-7281-3151-1 (ISBN)978-1-7281-3152-8 (ISBN)
Conference
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 24-27 Sept. 2019
Funder
Swedish Research Council, 2016-03853
Note

QC 20200318

Available from: 2020-03-18 Created: 2020-03-18 Last updated: 2020-03-18Bibliographically approved
Vu, M. T., Oechtering, T. J. & Skoglund, M. (2019). Hierarchical Identification with Pre-processing. IEEE Transactions on Information Theory, 66(1), 82-113
Open this publication in new window or tab >>Hierarchical Identification with Pre-processing
2019 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 66, no 1, p. 82-113Article in journal (Refereed) Published
Abstract [en]

We study a two-stage identification problem with pre-processing to enable efficient data retrieval and reconstruc- tion. In the enrollment phase, users’ data are stored into the database in two layers. In the identification phase an observer obtains an observation, which originates from an unknown user in the enrolled database through a memoryless channel. The observation is sent for processing in two stages. In the first stage, the observation is pre-processed, and the result is then used in combination with the stored first layer information in the database to output a list of compatible users to the second stage. Then the second step uses the information of users contained in the list from both layers and the original observation sequence to return the exact user identity and a corresponding reconstruction sequence. The rate-distortion regions are characterized for both discrete and Gaussian scenarios. Specifically, for a fixed list size and distortion level, the compression-identification trade-off in the Gaussian scenario results in three different operating cases characterized by three auxiliary functions. While the choice of the auxiliary random variable for the first layer information is essentially unchanged when the identification rate is varied, the second one is selected based on the dominant function within those three. Due to the presence of a mixture of discrete and continuous random variables, the proof for the Gaussian case is highly non-trivial, which makes a careful measure theoretic analysis necessary. In addition, we study a connection of the previous setting to a two observer identification and a related problem with a lower bound for the list size, where the latter is motivated from privacy concerns.

Place, publisher, year, edition, pages
IEEE, 2019
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:kth:diva-271121 (URN)10.1109/TIT.2019.2948848 (DOI)000505566100004 ()2-s2.0-85077234904 (Scopus ID)
Funder
Swedish Research Council, 2016-03853
Note

QC 20191114. QC 20200318

Available from: 2020-03-18 Created: 2020-03-18 Last updated: 2020-03-18Bibliographically approved
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
Funder
Swedish Research Council, 2016-03853
Note

QC 20191114. QC 20200318

Available from: 2019-11-14 Created: 2019-11-14 Last updated: 2020-03-18Bibliographically 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
Funder
Swedish Research Council, 2016-03853
Note

QC 20190731

Available from: 2019-07-31 Created: 2019-07-31 Last updated: 2020-03-24Bibliographically approved
Zhou, L., Vu, M. T. & Oechtering, T. J. (2019). Polar Codes for Identification Systems. In: Proceedings of the 12th International ITG Conference on Systems, Communications and Coding: . Paper presented at SCC 2019; 12th International ITG Conference on Systems, Communications and Coding, 11-14 Feb. 2019, Rostock, Germany.
Open this publication in new window or tab >>Polar Codes for Identification Systems
2019 (English)In: Proceedings of the 12th International ITG Conference on Systems, Communications and Coding, 2019Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we study compression and identifica- tion algorithms for the identification systems using polar codes. High dimensional feature vectors representing users are first compressed and then enrolled in a database. When an unknown enrolled user is observed, the noisy observation is compared with the entries in the database and the processing unit outputs an estimated user index. We develop three approaches based on polar codes and apply them to identification systems. This is the first time that identification system based on polar codes is studied. In particular, the identification mapping is challenging. The proposed methods provide a framework of applying polar codes to identification systems. The numerical evaluation results show that they results in complexity linearly depends on the number of users and low identification error rates as the sequence length increases.

National Category
Telecommunications
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-271126 (URN)10.30420/454862024 (DOI)978-3-8007-4862-4 (ISBN)
Conference
SCC 2019; 12th International ITG Conference on Systems, Communications and Coding, 11-14 Feb. 2019, Rostock, Germany
Funder
Swedish Research Council, 2016-03853
Note

QC 20200318

Available from: 2020-03-18 Created: 2020-03-18 Last updated: 2020-03-18Bibliographically 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-26Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-0036-9049

Search in DiVA

Show all publications