Secure Modulo Sum via Multiple Access Channel

12/28/2018
by   Masahito Hayashi, et al.
0

We discuss secure computation of modular sum when multiple access channel from distinct players A_1, ..., A_c to a third party (Receiver) is given. Then, we define the secure modulo sum capacity as the supremum of the transmission rate of modulo sum without information leakage of other information. We derive its useful lower bound, which is numerically calculated under a realistic model that can be realizable as a Gaussian multiple access channel.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2017

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

In this work, we describe an LDPC code design framework for the unequal ...
research
04/28/2018

Secure Computation-and-Forward with Linear Codes

We discuss secure transmission via an untrusted relay when we have a mul...
research
04/22/2019

On the Sum-Rate Capacity of Poisson Multiple Access Channel with Non-Perfect Photon-Counting Receiver

We first investigate two-user nonasymmetric sum-rate Poisson capacity wi...
research
05/31/2023

On the Capacity of Secure K-user Product Computation over a Quantum MAC

Inspired by a recent study by Christensen and Popovski on secure 2-user ...
research
09/14/2023

Permutation Capacity Region of Adder Multiple-Access Channels

Point-to-point permutation channels are useful models of communication n...
research
05/26/2022

On the separation of correlation-assisted sum capacities of multiple access channels

The capacity of a channel characterizes the maximum rate at which inform...
research
12/29/2017

Compute--Forward Multiple Access (CFMA): Practical Code Design

We present a practical strategy that aims to attain rate points on the d...

Please sign up or login with your details

Forgot password? Click here to reset