|| Secure Modulo Sum via Multiple Access Channel
||Masahito Hayashi, Southern University of Science and Technology, China|
||D3-S6-T4: Multi-Party Computation II
||Wednesday, 14 July, 23:40 - 00:00
||Thursday, 15 July, 00:00 - 00:20
We discuss secure computation of modular sum when multiple access channel from distinct players $A_1, \ldots, 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.