Yang, QS and Desmedt, Y (2010) General Perfectly Secure Message Transmission Using Linear Codes. In: Abe, M, (ed.) ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010. (pp. 448 - 465). SPRINGER-VERLAG BERLIN
Full text not available from this repository.
We study perfectly secure message transmission (PSMT) from a sender S to a receiver R in the general adversary model. In this model, instead of being bounded by a threshold, the Byzantine adversary in a network is characterized by an adversary structure. By regarding monotone general access structures as linear codes, we introduce some new properties that allow us to design efficient PSMT protocols. We give a number of efficient PSMT protocols in both undirected and directed network graphs. These protocols comprehensively improve the transmission complexity of some previous results in this area. More significantly, as all of our protocols are executed in either 3 or 2 rounds, our result is the first, in the context of PSMT in the general adversary model, to have constant round complexity when using interaction.
|Title:||General Perfectly Secure Message Transmission Using Linear Codes|
|Event:||16th International Conference on the Theory and Application of Cryptology and Information Security|
|Dates:||2010-12-05 - 2010-12-09|
|Keywords:||perfectly secure message transmission, adversary structure, linear codes, transmission complexity, round complexity, MULTIPARTY COMPUTATION, ADVERSARY STRUCTURES, DIRECTED NETWORKS, FEEDBACK, SCHEME|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record