Team for Research in
Ubiquitous Secure Technology

Information-Theoretic Key Agreement of Multiple Terminals - Part II: Channel Model
Amin Aminzadeh Gohari, Venkatachalam Anantharam

Citation
Amin Aminzadeh Gohari, Venkatachalam Anantharam. "Information-Theoretic Key Agreement of Multiple Terminals - Part II: Channel Model". Submitted to ``IEEE Transactions on Information Theory", 2008.

Abstract
This is the second part of a two-part paper on information-theoretically secure secret key agreement. This paper focuses on the secret key rate problem under the channel model. In the channel model, a set of two or more terminals wish to create a shared secret key that is Information-theoretically secure from an eavesdropper. The first terminal can choose a sequence of inputs to a discrete memoryless broadcast channel, which has outputs at the other terminals and at the eavesdropper. After each channel use, the terminals can engage in arbitrarily many rounds of interactive Authenticated communication over a public channel; thus, each input by the first terminal can depend on the previous inputs and the public communication so far. At the end of the process each terminal should be able to generate the key. We introduce a technique for proving that a given expression bounds the secrecy rate from above. Using this technique, a new upper bound on the secrecy rate in the general multi-terminal case is proposed that strictly improves the currently best known upper bound. We also derive a new lower bound on the secrecy rate and prove that it strictly improves what is essentially the best known lower bound.

Electronic downloads


Internal. This publication has been marked by the author for TRUST-only distribution, so electronic downloads are not available without logging in.
Citation formats  
  • HTML
    Amin Aminzadeh Gohari, Venkatachalam Anantharam. <a
    href="http://www.truststc.org/pubs/370.html"
    >Information-Theoretic Key Agreement of Multiple
    Terminals - Part II: Channel Model</a>,
    <i>Submitted to ``IEEE Transactions on Information
    Theory"</i>,  2008.
  • Plain text
    Amin Aminzadeh Gohari, Venkatachalam Anantharam.
    "Information-Theoretic Key Agreement of Multiple
    Terminals - Part II: Channel Model". <i>Submitted
    to ``IEEE Transactions on Information
    Theory"</i>,  2008.
  • BibTeX
    @article{GohariAnantharam08_InformationTheoreticKeyAgreementOfMultipleTerminals,
        author = {Amin Aminzadeh Gohari and Venkatachalam Anantharam},
        title = {Information-Theoretic Key Agreement of Multiple
                  Terminals - Part II: Channel Model},
        journal = {Submitted to ``IEEE Transactions on Information
                  Theory"},
        year = {2008},
        abstract = {This is the second part of a two-part paper on
                  information-theoretically secure secret key
                  agreement. This paper focuses on the secret key
                  rate problem under the channel model. In the
                  channel model, a set of two or more terminals wish
                  to create a shared secret key that is
                  Information-theoretically secure from an
                  eavesdropper. The first terminal can choose a
                  sequence of inputs to a discrete memoryless
                  broadcast channel, which has outputs at the other
                  terminals and at the eavesdropper. After each
                  channel use, the terminals can engage in
                  arbitrarily many rounds of interactive
                  Authenticated communication over a public channel;
                  thus, each input by the first terminal can depend
                  on the previous inputs and the public
                  communication so far. At the end of the process
                  each terminal should be able to generate the key.
                  We introduce a technique for proving that a given
                  expression bounds the secrecy rate from above.
                  Using this technique, a new upper bound on the
                  secrecy rate in the general multi-terminal case is
                  proposed that strictly improves the currently best
                  known upper bound. We also derive a new lower
                  bound on the secrecy rate and prove that it
                  strictly improves what is essentially the best
                  known lower bound.},
        URL = {http://www.truststc.org/pubs/370.html}
    }
    

Posted by Amin Aminzadeh Gohari on 17 Apr 2008.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.