Privacy Signaling Games with Binary Alphabets

Date

2022-01-01

Author

Stavrou, Photios A.
Sarıtaş, Serkan
Skoglund, Mikael

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

91
views

0
downloads

In this paper, we consider a privacy signaling game problem for binary alphabets and single-bit transmission where a transmitter has a pair of messages, one of which is a casual message that needs to be conveyed, whereas the other message contains sensitive data and needs to be protected. The receiver wishes to estimate both messages to acquire as much information as possible. For this setup, we study the interactions between the transmitter and the receiver with non-aligned information-theoretic objectives (modeled by mutual information and hamming distance) due to the privacy concerns of the transmitter. We derive conditions under which Nash and/or Stackelberg equilibria exist and identify the optimal responses of the encoder and decoders strategies for each type of game. One particularly surprising result is that when both types of equilibria exist, they admit the same encoding and decoding strategies. We corroborate our analysis with simulation studies.

URI

https://hdl.handle.net/11511/99958

DOI

https://doi.org/10.23919/ecc55457.2022.9838456

Conference Name

European Control Conference (ECC)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Related-key attacks on block ciphers Darbuka, Aslı; Doğanaksoy, Ali; Department of Cryptography (2009) One of the most important cryptographic primitives is the concept of block ciphers which yields confidentiality for data transmission in communication. Therefore, to be sure that confidentiality is provided, it is necessary to analyse the security of block ciphers by investigating their resistance to existing attacks. For this reason, related-key attacks gain much popularity in recent years and have been applied to many block ciphers with weak key schedules. In this work, our main motivation is to cover typ...
Diversity Analysis of Hierarchical Modulation in Wireless Relay Networks Yalcyn, Ahmet Zahid; Yüksel Turgut, Ayşe Melda (2014-07-01) In communication systems, hierarchical modulation is used to increase system robustness and to send different information flows simultaneously. However, when used in cooperative communication systems, hierarchical modulation is prone to error propagation, which is the most important problem that prevents the achievement of full diversity gains. Depending on the signal-to-noise ratio between the source and the relay, threshold digital relaying can be used to mitigate error propagation. Mitigating error propa...
Cooperative Communications in Future Home Networks Genc, Zulkuf; Rizvi, Umar H.; Onur, Ertan; Niemegeers, Ignas (Springer Science and Business Media LLC, 2010-05-01) The basic idea behind cooperative communications is that mobile terminals collaborate to send data to each other. This effectively adds diversity in the system and improves the overall performance. In this paper, we investigate the potential gains of cooperative communication in future home networks. We derive analytical expressions for the error probability of binary phase shift keying (BPSK) signals over Nakagami-m fading channels in a multi relay communication network. Following to the analytical study, ...
Efficient Modular Exponentiation Methods for RSA Güner, Hatice; Cenk, Murat; Çalık, Çağdaş (2015-11-03) RSA is a commonly used asymmetric key cryptosystem that is used in encrypting and signing messages. The efficiency of the implementation is an important factor in effectively using the system. The RSA algorithm heavily depends on the modular exponentiation operation on large integers. A drawback of this system is that it becomes inefficient so quickly when the parameters are adjusted to increase security. This situation causes the operations to be performed with large numbers. Therefore, implementations req...
Semantic Communications in Networked Systems: A Data Significance Perspective Uysal, Elif; KAYA, ONUR; Ephremides, Anthony; Gross, James; Codreanu, Marian; Popovski, Petar; Assaad, Mohamad; Liva, Gianluigi; Munari, Andrea; Soret, Beatriz; Soleymani, Touraj; Johansson, Karl Henrik (2022-7-01) We present our vision for a departure from the established way of architecting and assessing communication networks, by incorporating the semantics of information, defined not necessarily as the meaning of the messages, but as their significance, possibly within a real-time constraint, relative to the purpose of the data exchange. We argue that research efforts must focus on laying the theoretical foundations of a redesign of the entire process of information generation, transmission, and usage for networke...

Citation Formats

P. A. Stavrou, S. Sarıtaş, and M. Skoglund, “Privacy Signaling Games with Binary Alphabets,” presented at the European Control Conference (ECC), London, Kanada, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/99958.