Delay of linear perfect secret key agreement
Author:
- 1 September 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1128-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
This publication has 9 references indexed in Scilit:
- Linear perfect secret key agreement2011
- The hidden flow of information2011
- Perfect Omniscience, Perfect Secrecy, and Steiner Tree PackingIEEE Transactions on Information Theory, 2010
- An algorithmic framework for wireless information flow2009
- Secrecy generation for multiple input multiple output channel models2009
- Secrecy Capacities for Multiterminal Channel ModelsIEEE Transactions on Information Theory, 2008
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Secrecy Capacities for Multiple TerminalsIEEE Transactions on Information Theory, 2004
- Matroids and linking systemsJournal of Combinatorial Theory, Series B, 1979