Team for Research in
Ubiquitous Secure Technology

Unconditionally Secret Key Agreement using Public Discussion
Amin Aminzadeh Gohari, Venkatachalam Anantharam

Citation
Amin Aminzadeh Gohari, Venkatachalam Anantharam. "Unconditionally Secret Key Agreement using Public Discussion". Talk or presentation, 15, February, 2007.

Abstract
In many environments requiring secret key generation, it is possible to provide external randomness to the agents. For example, sensor networks are often deployed in places where it is possible to beam randomness, e.g. from a satellite. Information theoretic security is the most stringent form of security. While once commonly considered infeasible in view of Shannon's one time pad result, the recognition that externally provided randomness can be used to create information theoretically secure keys has led to a rethinking of this pessimistic viewpoint and to significant work over the last decade in to develop protocols to extract high rate secret keys in such situations. We study the fundamental problem in information-theoretic cryptography in which a group of agents together with an eavesdropper have access to possibly correlated random sources. We study the secret key rate of the parties (secret from eavesdropper). Our current results strictly improve the best know n bounds on the secrecy capacity. The results further relate and improve several earlier results in this area which had been studied separately.

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/247.html"
    ><i>Unconditionally Secret Key Agreement using
    Public Discussion</i></a>, Talk or presentation,
     15, February, 2007.
  • Plain text
    Amin Aminzadeh Gohari, Venkatachalam Anantharam.
    "Unconditionally Secret Key Agreement using Public
    Discussion". Talk or presentation,  15, February, 2007.
  • BibTeX
    @presentation{GohariAnantharam07_UnconditionallySecretKeyAgreementUsingPublicDiscussion,
        author = {Amin Aminzadeh Gohari and Venkatachalam Anantharam},
        title = {Unconditionally Secret Key Agreement using Public
                  Discussion},
        day = {15},
        month = {February},
        year = {2007},
        abstract = {In many environments requiring secret key
                  generation, it is possible to provide external
                  randomness to the agents. For example, sensor
                  networks are often deployed in places where it is
                  possible to beam randomness, e.g. from a
                  satellite. Information theoretic security is the
                  most stringent form of security. While once
                  commonly considered infeasible in view of
                  Shannon's one time pad result, the recognition
                  that externally provided randomness can be used to
                  create information theoretically secure keys has
                  led to a rethinking of this pessimistic viewpoint
                  and to significant work over the last decade in to
                  develop protocols to extract high rate secret keys
                  in such situations. We study the fundamental
                  problem in information-theoretic cryptography in
                  which a group of agents together with an
                  eavesdropper have access to possibly correlated
                  random sources. We study the secret key rate of
                  the parties (secret from eavesdropper). Our
                  current results strictly improve the best know n
                  bounds on the secrecy capacity. The results
                  further relate and improve several earlier results
                  in this area which had been studied separately. },
        URL = {http://www.truststc.org/pubs/247.html}
    }
    

Posted by Amin Aminzadeh Gohari on 29 Mar 2007.
Groups: trust trustlocal
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.