Secure Modulo Sum via Multiple Access Channel

2018/12/28 by Masahito Hayashi, Hayashi, Masahito
Computer Science · Engineering · #Chaos-based Image/Signal Encryption #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1812.10862

openalex publication_date 2018/12/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss secure computation of modular sum when multiple access channel from distinct players A₁, …, 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 (MAC).

Citations

• New hash functions and their use in authentication and set equality

Related

• On the Deterministic Sum-Capacity of the Multiple Access Wiretap Channel
• On Modulo-Sum Computation over an Erasure Multiple Access Channel
• Information-Theoretical Security for Several Models of Multiple-Access Channel
• Multiple Access Channel with Common Message and Secrecy constraint
• The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jamming