Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Communications workshops

Privacy-preserving quantization learning for distributed binary decision with applications to smart meters

Maggie Mhanna, Pablo Piantanida, Pierre Duhamel

Published May 1, 2017• 0 citations
Publisher

Abstract

Vector Quantization (VQ) design for distributed binary decision in the presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes i.i.d. samples and communicates them via a public noiseless rate-limited channel to the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to another correlated analog source. This paper evaluates relevant trade-offs between the error probability of the two types and the amount of tolerated information leakage, for the particular case of testing against independence. An application to illustrate our results to real-data measured from the electric consumption at houses to perform anomaly detection is also provided.

DOI
10.1109/iccw.2017.7962810

Related papers

Quantization for distributed binary detection under secrecy constraints

Maggie Mhanna, Pablo Piantanida, Pierre Duhamel

The design of scalar quantization for distributed binary decision in presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes a memoryless source and communicate via a public noiseless rate-limited channel with the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to a different correlated analog source and perfectly observe the information bits sent by Alice. This paper evaluates the various tradeoffs between the probabilities of error (on the decision) depending on the amount of information leakage from Alice to Eve. The Bhattacharyya distance; one of the distances measuring the difference between two probability distributions; is taken as a criterion to optimize the scalar quantizer subject to a tolerable constraint on the information leakage at the level of Eve. Numerical results for memoryless Gaussian sources demonstrate the performance of the proposed quantization method.

•May 23, 2016•3 citations

Quantization for distributed binary detection under secrecy constraints

Maggie Mhanna, Pierre Duhamel, Pablo Piantanida

The design of scalar quantization for distributed binary decision in presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes a memoryless source and communicate via a public noiseless rate-limited channel with the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to a different correlated analog source and perfectly observe the information bits sent by Alice. This paper evaluates the various tradeoffs between the probabilities of error (on the decision) depending on the amount of information leakage from Alice to Eve. The Bhattacharyya distance; one of the distances measuring the difference between two probability distributions; is taken as a criterion to optimize the scalar quantizer subject to a tolerable constraint on the information leakage at the level of Eve. Numerical results for memoryless Gaussian sources demonstrate the performance of the proposed quantization method.

International Conference on Communications•May 1, 2016•4 citations

On secure distributed hypothesis testing

Maggie Mhanna, Pablo Piantanida

The distributed binary hypothesis testing problem with communication and security constraints is investigated. A legitimate statistician (referred to as Bob) is interested in detecting the joint probability distribution of two remotely located sources. To this end, Bob has access to analog and coded data where the later is observed at another node (referred to as Alice) and communicated over a public noise-less channel of finite rate. An eavesdropper (referred to as Eve) has access to the encoded bits. In this framework, we study the tradeoff between the maximum achievable error exponent at Bob, i.e., the minimum Type II error probability for a fixed Type I probability of error, the rate and the equivocation rate. We first derive an achievable rate-exponent-equivocation region. Then, we investigate the special case of testing against independence for which we provide the optimal rate-exponent-equivocation region. An application example to binary sources is also considered.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•30 citations

Testing Against Independence with an Eavesdropper

Sara Faour, Mustapha Hamad, Mireille Sarkiss +1 more

We study a distributed binary hypothesis testing (HT) problem with communication and security constraints, involving three parties: a remote sensor called Alice, a legitimate decision center called Bob, and an eavesdropper called Eve, all having their own source observations. In this system, Alice conveys a rate-R description of her observations to Bob, and Bob performs a binary hypothesis test on the joint distribution underlying his and Alice’s observations. The goal of Alice and Bob is to maximize the exponential decay of Bob’s miss-detection (type-II error) probability under two constraints: Bob’s false-alarm (type-I error) probability has to stay below a given threshold and Eve’s uncertainty (equivocation) about Alice’s observations should stay above a given security threshold even when Eve learns Alice’s message. For the special case of testing against independence, we characterize the largest possible type-II error exponent under the described type-I error probability and security constraints.

arXiv:2211.03475•IEEE Information Theory Workshop (ITW)•Apr 23, 2023•5 citations

Secure Multiterminal Source Coding With Side Information at the Eavesdropper

Joffrey Villard, Pablo Piantanida

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously satisfying the desired requirements on the distortion level at a legitimate receiver (referred to as Bob) and the equivocation rate—average uncertainty—at an eavesdropper (referred to as Eve). It is further assumed the presence of a (public) rate-limited link between Alice and Bob. In this setting, Eve perfectly observes the information bits sent by Alice to Bob and has also access to a correlated source which can be used as side information. A second encoder (referred to as Charlie) helps Bob in estimating Alice's source by sending a compressed version of its own correlated observation via a (private) rate-limited link, which is only observed by Bob. For instance, the problem at hands can be seen as the unification between the Berger–Tung and the secure source coding setups. Inner and outer bounds on the so-called rate-distortion-equivocation region are derived. The inner region turns to be tight for two cases: 1) uncoded side information at Bob and 2) lossless reconstruction of both sources at Bob—secure distributed lossless compression. Application examples to secure lossy source coding of Gaussian and binary sources in the presence of Gaussian and binary/ternary (respectively) side informations are also considered. Optimal coding schemes are characterized for some cases of interest where the statistical differences between the side information at the decoders and the presence of a nonzero distortion at Bob can be fully exploited to guarantee secrecy.

arXiv:1105.1658•IEEE Transactions on Information Theory•Feb 6, 2013•78 citations

On Function Computation With Privacy and Secrecy Constraints

Wenwen Tu, Lifeng Lai

In this paper, the problem of function computation with privacy and secrecy constraints is considered. The considered model consists of three legitimate nodes (i.e., two transmitters, Alice and Bob, and a fusion center that acts as the receiver) that observe correlated sources and are connected by noiseless public channels, and an eavesdropper Eve who has full access to the public channels and also has its own source observations. The fusion center would like to compute a function of the distributed sources within a prefixed distortion level under a certain distortion metric. To facilitate the function computation, Alice and Bob will send messages to the fusion center. Different from the existing setups in function computation, we assume that there is a privacy constraint on the sources at Alice and Bob. In particular, Alice and Bob would like to enable the fusion center to compute the function, but at same time, they do not want the fusion center to learn too much information about the source observations. We introduce a quantity to precisely measure the privacy leakage to the fusion center. In addition to this privacy constraint, we also have a secrecy constraint to Eve and use equivocation of sources to measure this quantity. Under this model, we study the tradeoffs among message rates, private information leakage, equivocation, and distortion. We first consider a scenario that has only one transmitter, i.e., the source at Bob is empty, and fully single-letter characterize the corresponding regions. Then, we consider the more general case and provide both outer and inner bounds on the corresponding regions.

IEEE Transactions on Information Theory•Jun 13, 2019•20 citations
Vector Quantization (VQ) design for distributed binary decision in the presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes i.i.d. samples and communicates them via a public noiseless rate-limited channel to the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to another correlated analog source. This paper evaluates relevant trade-offs between the error probability of the two types and the amount of tolerated information leakage, for the particular case of testing against independence. An application to illustrate our results to real-data measured from the electric consumption at houses to perform anomaly detection is also provided.
The design of scalar quantization for distributed binary decision in presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes a memoryless source and communicate via a public noiseless rate-limited channel with the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to a different correlated analog source and perfectly observe the information bits sent by Alice. This paper evaluates the various tradeoffs between the probabilities of error (on the decision) depending on the amount of information leakage from Alice to Eve. The Bhattacharyya distance; one of the distances measuring the difference between two probability distributions; is taken as a criterion to optimize the scalar quantizer subject to a tolerable constraint on the information leakage at the level of Eve. Numerical results for memoryless Gaussian sources demonstrate the performance of the proposed quantization method.
The design of scalar quantization for distributed binary decision in presence of an eavesdropper (Eve) is investigated. An encoder/quantizer (Alice) observes a memoryless source and communicate via a public noiseless rate-limited channel with the detector (Bob) who has also access to a correlated analog source. Bob can take advantage of both informations to perform a binary decision on the joint probability law of these observations. Eve is further assumed to have access to a different correlated analog source and perfectly observe the information bits sent by Alice. This paper evaluates the various tradeoffs between the probabilities of error (on the decision) depending on the amount of information leakage from Alice to Eve. The Bhattacharyya distance; one of the distances measuring the difference between two probability distributions; is taken as a criterion to optimize the scalar quantizer subject to a tolerable constraint on the information leakage at the level of Eve. Numerical results for memoryless Gaussian sources demonstrate the performance of the proposed quantization method.
The distributed binary hypothesis testing problem with communication and security constraints is investigated. A legitimate statistician (referred to as Bob) is interested in detecting the joint probability distribution of two remotely located sources. To this end, Bob has access to analog and coded data where the later is observed at another node (referred to as Alice) and communicated over a public noise-less channel of finite rate. An eavesdropper (referred to as Eve) has access to the encoded bits. In this framework, we study the tradeoff between the maximum achievable error exponent at Bob, i.e., the minimum Type II error probability for a fixed Type I probability of error, the rate and the equivocation rate. We first derive an achievable rate-exponent-equivocation region. Then, we investigate the special case of testing against independence for which we provide the optimal rate-exponent-equivocation region. An application example to binary sources is also considered.
We study a distributed binary hypothesis testing (HT) problem with communication and security constraints, involving three parties: a remote sensor called Alice, a legitimate decision center called Bob, and an eavesdropper called Eve, all having their own source observations. In this system, Alice conveys a rate-R description of her observations to Bob, and Bob performs a binary hypothesis test on the joint distribution underlying his and Alice’s observations. The goal of Alice and Bob is to maximize the exponential decay of Bob’s miss-detection (type-II error) probability under two constraints: Bob’s false-alarm (type-I error) probability has to stay below a given threshold and Eve’s uncertainty (equivocation) about Alice’s observations should stay above a given security threshold even when Eve learns Alice’s message. For the special case of testing against independence, we characterize the largest possible type-II error exponent under the described type-I error probability and security constraints.
The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously satisfying the desired requirements on the distortion level at a legitimate receiver (referred to as Bob) and the equivocation rate—average uncertainty—at an eavesdropper (referred to as Eve). It is further assumed the presence of a (public) rate-limited link between Alice and Bob. In this setting, Eve perfectly observes the information bits sent by Alice to Bob and has also access to a correlated source which can be used as side information. A second encoder (referred to as Charlie) helps Bob in estimating Alice's source by sending a compressed version of its own correlated observation via a (private) rate-limited link, which is only observed by Bob. For instance, the problem at hands can be seen as the unification between the Berger–Tung and the secure source coding setups. Inner and outer bounds on the so-called rate-distortion-equivocation region are derived. The inner region turns to be tight for two cases: 1) uncoded side information at Bob and 2) lossless reconstruction of both sources at Bob—secure distributed lossless compression. Application examples to secure lossy source coding of Gaussian and binary sources in the presence of Gaussian and binary/ternary (respectively) side informations are also considered. Optimal coding schemes are characterized for some cases of interest where the statistical differences between the side information at the decoders and the presence of a nonzero distortion at Bob can be fully exploited to guarantee secrecy.
In this paper, the problem of function computation with privacy and secrecy constraints is considered. The considered model consists of three legitimate nodes (i.e., two transmitters, Alice and Bob, and a fusion center that acts as the receiver) that observe correlated sources and are connected by noiseless public channels, and an eavesdropper Eve who has full access to the public channels and also has its own source observations. The fusion center would like to compute a function of the distributed sources within a prefixed distortion level under a certain distortion metric. To facilitate the function computation, Alice and Bob will send messages to the fusion center. Different from the existing setups in function computation, we assume that there is a privacy constraint on the sources at Alice and Bob. In particular, Alice and Bob would like to enable the fusion center to compute the function, but at same time, they do not want the fusion center to learn too much information about the source observations. We introduce a quantity to precisely measure the privacy leakage to the fusion center. In addition to this privacy constraint, we also have a secrecy constraint to Eve and use equivocation of sources to measure this quantity. Under this model, we study the tradeoffs among message rates, private information leakage, equivocation, and distortion. We first consider a scenario that has only one transmitter, i.e., the source at Bob is empty, and fully single-letter characterize the corresponding regions. Then, we consider the more general case and provide both outer and inner bounds on the corresponding regions.