DocumentCode
2887561
Title
Delay of linear perfect secret key agreement
Author
Chan, Chung
Author_Institution
Chinese Univ. of Hong Kong, Hong Kong, China
fYear
2011
fDate
28-30 Sept. 2011
Firstpage
1128
Lastpage
1135
Abstract
Upper bounds are given on the block length required to attain the secrecy capacity by linear perfect secret key agreement. The bounds are universal to the source statistics and grow polynomially in the size of the network when the number of helpers is constant. The practical significance is that a shorter block length entails a smaller delay, lower computational complexity, and more efficient code construction.
Keywords
block codes; computational complexity; delays; polynomials; source coding; statistics; code construction; computational complexity; linear perfect secret key agreement delay; polynomially; secrecy capacity; shorter block length; upper bound; Delay; Entropy; Equations; Linear systems; Network coding; Upper bound; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4577-1817-5
Type
conf
DOI
10.1109/Allerton.2011.6120294
Filename
6120294
Link To Document