Multi-terminal strong coordination over noisy channels with secrecy constraints

V Ramachandran, TJ Oechtering… - … on Information Theory …, 2024 - ieeexplore.ieee.org
We investigate the problem of secure multi-terminal strong coordination aided by a multiple-
access wiretap channel (MAC-WT). In this setup, independent and identically distributed (iid) …

Randomized Distributed Function Computation with Semantic Communications: Applications to Privacy

O Günlü - 2024 IEEE International Workshop on Information …, 2024 - ieeexplore.ieee.org
Randomized distributed function computation refers to remote function computation where
transmitters send datato receivers which compute function outputs that are randomized …

Secret Key Agreement via Secure Omniscience

PK Vippathalla, C Chan, N Kashyap… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
In this paper, we explore the connection between secret key agreement and secure
omniscience within the setting of the multiterminal source model with an eavesdropper …

Multi-terminal Strong Coordination subject to Secrecy Constraints

V Ramachandran, TJ Oechtering… - arXiv preprint arXiv …, 2024 - arxiv.org
A fundamental problem in decentralized networked systems is to coordinate actions of
different agents so that they reach a state of agreement. In such applications, it is …

Private Sum Computation: Trade-Off Between Shared Randomness and Privacy

RA Chou, J Kliewer, A Yener - 2024 IEEE International …, 2024 - ieeexplore.ieee.org
Consider a scenario involving multiple users and a fusion center. Each user possesses a
sequence of bits and can communicate with the fusion center through a one-way public …

Wiretap secret key agreement via secure omniscience

PK Vippathalla, C Chan, N Kashyap, Q Zhou - arXiv preprint arXiv …, 2021 - arxiv.org
In this paper, we explore the connection between secret key agreement and secure
omniscience within the setting of the multiterminal source model with a wiretapper who has …

Secure computation to hide functions of inputs

GR Kurri, VM Prabhakaran - 2020 IEEE International …, 2020 - ieeexplore.ieee.org
We consider a two-user secure computation problem in which Alice and Bob communicate
interactively in order to compute some deterministic functions of the inputs. The privacy …

Function computation without secure links: Information and leakage rates

RA Chou, J Kliewer - 2022 IEEE International Symposium on …, 2022 - ieeexplore.ieee.org
Consider L users, who each holds private data, and one fusion center who must compute a
function of the private data of the L users. To accomplish this task, each user can make a …

[PDF][PDF] Multi-terminal strong coordination over noiseless networks with secrecy constraints

V Ramachandran, TJ Oechtering… - … Zurich Seminar on …, 2024 - research-collection.ethz.ch
We investigate the problem of securely emulating a two-user multiple-access channel (MAC)
aided by a multipleaccess network of noiseless links as a resource. In this configuration, two …