arXiv 2105.033802021-05-07cs.ITmath.IT

Communication With Adversary Identification in Byzantine Multiple Access Channels

Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran

英文摘要：

We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access channel where either user may deviate from the prescribed behaviour. Owing to the noisy nature of the channel, it may be overly restrictive to attempt to detect all deviations. In our formulation, we only require detecting deviations which impede the decoding of the non-deviating user's message. When neither user deviates, correct decoding is required. When one user deviates, the decoder must either output a pair of messages of which the message of the non-deviating user is correct or identify the deviating user. The users and the receiver do not share any randomness. The results include a characterization of the set of channels where communication is feasible, and an inner and outer bound on the capacity region.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The $ε$-error Capacity of Symmetric PIR with Byzantine Adversaries

The capacity of symmetric private information retrieval with $K$ messages, $N$ servers (out of which any $T$ may collude), and an omniscient Byzantine adversary (who can corrupt any $B$ answers) is shown to be $1 - \frac{T+2B}{N}$ [1], under the requirement of zero probability of error. In this work, we show that by weakening the adversary slightly (either providing secret low rate channels between the servers and the user, or limiting the observation of the adversary), and allowing vanishing probability of error, the capacity increases to $1 - \frac{T+B}{N}$.

2018-09-11cs.ITmath.IT

拜占庭多址接入信道——第二部分：带对手识别的通信

Byzantine Multiple Access Channels -- Part II: Communication With Adversary Identification

研究两用户离散无记忆多址接入信道中拜占庭用户的识别问题，提出通信可行的信道集合刻画及容量区域内外界，并证明在非空内部下确定性与随机化编码容量区域相同。

2024-09-25cs.ITmath.IT

拜占庭分布式函数计算

Byzantine Distributed Function Computation

本文研究至多 s 个用户被对手控制的 k 用户分布式函数计算问题，刻画了可鲁棒重建的函数集合，并证明在诚实或对抗行为下均能以高概率恢复函数或识别对抗用户。

2025-03-10cs.CRcs.ITmath.IT

Byzantine Multiple Access

We study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded reliably. When an adversary is present, we consider two different decoding guarantees. In part I, we require that the honest users' messages be decoded reliably. We study the 3-user MAC; 2-user MAC capacity follows from point-to-point AVC capacity. We characterize the capacity region for randomized codes. We also study the capacity region for deterministic codes. We obtain necessary conditions including a new non-sym…

2019-04-26cs.ITmath.IT

拜占庭多址接入信道——第一部分：可靠通信

Byzantine Multiple Access Channels -- Part I: Reliable Communication

研究存在潜在敌对用户的多址接入信道（MAC）可靠通信问题，刻画了2用户、3用户及k用户MAC在确定性与随机化编码下的容量区域。

2023-09-11cs.ITmath.IT

存在拜占庭节点时的分布式多重检验与错误发现率控制

Distributed Multiple Testing with False Discovery Rate Control in the Presence of Byzantines

本文研究拜占庭攻击下的分布式多重检验FDR控制，刻画两种攻击模型对全局FDR的影响，提出反制策略并通过仿真验证理论结果与设计权衡。

2025-04-25cs.ITeess.SPmath.IT

更多相关论文收起更多论文

拜占庭容错梯度编码中以通信换取计算

Trading Communication for Computation in Byzantine-Resilient Gradient Coding

针对拜占庭恶意工作节点下的梯度编码，本文通过检测错误输入并将其转化为擦除，把复制度由 2s+1 降至 s+1，并给出分数重复数据分配框架的基本极限。

2023-06-05cs.ITmath.IT

通过局部梯度计算实现拜占庭容错梯度编码

Byzantine-Resilient Gradient Coding through Local Gradient Computations

研究梯度编码中恶意工作节点的破坏问题，提出一种通过局部梯度计算检测错误输入并将其转换为擦除的方法，在存在 $s$ 个恶意节点时将复制从 $2s+1$ 降至 $s+1$，并在复制和局部计算上达到最优。

2024-01-05cs.ITmath.IT

基于相容概率的重识别的形式化

A formalization of re-identification in terms of compatible probabilities

Universitat Oberta de Catalunya（加泰罗尼亚开放大学）

数据隐私中使用重新识别算法来衡量披露风险。他们模拟的情况下，一个对手的攻击发布的数据库通过链接的信息，这个对手的数据库。在本文中，我们正式这种类型的算法的真实概率和兼容的信念功能。这项工作的目的是离开作为重新识别算法，这些算法不满足最低要求。

2013-01-21cs.AIcs.CRcs.IT

隐蔽在线决策：从序贯假设检验到随机多臂老虎机

Covert Online Decision Making: From Sequential Hypothesis Testing to Stochastic Bandits

研究隐蔽在线决策问题，通过将系统建模为Markov核，分别表述为序贯假设检验和老虎机最佳臂识别问题，并刻画了识别错误概率随块长平方根呈指数衰减的规律。

2023-11-20cs.ITmath.IT

Fundamental Limits of Byzantine Agreement

Byzantine agreement (BA) is a distributed consensus problem where $n$ processors want to reach agreement on an $\ell$-bit message or value, but up to $t$ of the processors are dishonest or faulty. The challenge of this BA problem lies in achieving agreement despite the presence of dishonest processors who may arbitrarily deviate from the designed protocol. The quality of a BA protocol is measured primarily by using the following three parameters: the number of processors $n$ as a function of $t$ allowed (resilience); the number of rounds (round complexity, denoted by $r$); and the total number…

2020-12-31cs.CRcs.DCcs.IT

Compound Arbitrarily Varying Channels

We propose a communication model, that we call compound arbitrarily varying channels (CAVC), which unifies and generalizes compound channels and arbitrarily varying channels (AVC). A CAVC can be viewed as a noisy channel with a fixed, but unknown, compound-state and an AVC-state which may vary with every channel use. The AVC-state is controlled by an adversary who is aware of the compound-state. We study three problems in this setting: 'communication', 'communication and compound-state identification', and 'communication or compound-state identification'. For these problems, we study condition…

2021-05-07cs.ITmath.IT

Equivalence for Networks with Adversarial State

We address the problem of finding the capacity of noisy networks with either independent point-to-point compound channels (CC) or arbitrarily varying channels (AVC). These channels model the presence of a Byzantine adversary which controls a subset of links or nodes in the network. We derive equivalence results showing that these point-to-point channels with state can be replaced by noiseless bit-pipes without changing the network capacity region. Exact equivalence results are found for the CC model, and for some instances of the AVC, including all nonsymmetrizable AVCs. These results show tha…

2017-04-02cs.ITmath.IT

基于秘密密钥的身份认证

Secret key-based Identification and Authentication with a Privacy Constraint

我们考虑基于从一些用户生成秘密密钥源数据（例如，生物测定源）。目标是可靠地识别预先登记在数据库中的用户，以及基于估计的秘密密钥来认证他们，同时保护登记数据和生成的密钥的隐私。我们刻画了身份识别率、用户源数据压缩率、信息泄漏率和秘密密钥率之间的最优折衷。特别是，我们提供了一个编码策略的基础上分层随机装箱，这是最佳的。此外，我们研究了一个相关的安全识别/认证问题，对手试图欺骗系统使用自己的数据。这里提供了识别率、压缩率、泄漏率和最大错误接受概率的指数之间的最佳折衷。结果表明，最优秘密密钥速率与身份认证系统的错误接受指数之间存在着密切的联系。

2015-08-06cs.CRcs.ITmath.IT