Delay of linear perfect secret key agreement
Chung Yuen Chan · 2011
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.