A3-Codes under Collusion Attacks
A3-Codes under Collusion Attacks
复制标题
共谋攻击下的 A3 代码
DOI：
10.1007/978-3-540-48000-6_31
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
R. Safavi
中科院分区：
文献类型：
--
作者：
Yejing Wang;R. Safavi
A3码是A码的一种扩展，其中三个参与者，发送者，接收者和仲裁者，都不被认为是可信的。在本文中，我们扩展了以前的模型的A3码，允许发送器和接收器不仅单独攻击系统，但也勾结仲裁器对其他。我们推导出各种攻击成功概率的信息论下界，以及密钥空间大小的组合下界。我们还研究了最优A3-码抗共谋攻击的组合结构，并给出了一个最优A3-码的构造。
AnA3-code is an extension of A-code in which none of the three participants, transmitter, receiver and arbiter, is assumed trusted. In this paper we extend the previous model ofA3-codes by allowing transmitter and receiver not only to individually attack the system but also collude with the arbiter against the other. We derive information-theoretic lower bounds on success probability of various attacks, and combinatorial lower bounds on the size of key spaces. We also study combinatorial structure of optimalA3-code against collusion attacks and give a construction of an optimal code.