Abstract
An A3-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 of A3-codes by allowing transmitter and receiver not only to individually attack the system but also collude with the arbiter against the other. We derive informationtheoretic lower bounds on success probability of various attacks, and combinatorial lower bounds on the size of key spaces. We also study combinatorial structure of optimal A3-code against collusion attacks and give a construction of an optimal code.
Cite
CITATION STYLE
Wang, Y., & Rei, S. N. (1999). A3-codes under collusion attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 1–9). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
