Efficiency considerations in unconditionally secure communication by public discussion

Rok, strany: 2006, 113 - 122

Using noisy communication channels, and assuming that the enemy does not have access to the same information as the legitimate parties allows for an unconditionally secure key exchange protocol proposed by [Maurer U. M.: Secret key agreement by public discussion from common information, IEEE Trans. Inform. Theory, 39 (1993) 733–742]. The main result of this paper is the analysis of Maurer's multi-round protocol [Maurer U. M.: Protocols for secret key agreement by public discussion based on common information, Advances in Cryptology, CRYPTO '92, Lecture Notes Comput. Sci., Springer-Verlag, Berlin, Vol. 740, 1993, pp. 461–470], and the proof that for any choice of protocol parameters the optimal round length is always two. In addition, some remarks are made about protocols with communication channels of non-binary distributions.

ISO 690:

Ren, M. 2006. Efficiency considerations in unconditionally secure communication by public discussion. In Tatra Mountains Mathematical Publications, vol. 33, no.1, pp. 113-122. 1210-3195.

APA:

Ren, M. (2006). Efficiency considerations in unconditionally secure communication by public discussion. Tatra Mountains Mathematical Publications, 33(1), 113-122. 1210-3195.