Skip to content
University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • Theses and Dissertations from UMD
    • UMD Theses and Dissertations
    • View Item
    •   DRUM
    • Theses and Dissertations from UMD
    • UMD Theses and Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Information Theoretic Generation of Multiple Secret Keys

    Thumbnail
    View/Open
    umi-umd-2886.pdf (725.3Kb)
    No. of downloads: 1769

    Date
    2005-10-21
    Author
    Ye, Chunxuan
    Advisor
    Narayan, Prakash
    Metadata
    Show full item record
    Abstract
    This dissertation studies the problem of secret key generation for encrypted group communication in a network, based on an information theoretic approach. This approach, which relies on a provable form of security, also provides suggestions for key constructions. We examine the problem of the simultaneous generation of multiple keys by different groups of terminals intended for encrypted group communication, in certain three-terminal source models, which capture the salient features of general multiterminal models. We characterize the rates at which two designated pairs of terminals can simultaneously generate private keys, each of which is effectively concealed from the remaining terminal, and the rates at which the following two types of keys can be generated simultaneously: (i) all the three terminals generate a (common) secret key, which is effectively concealed from an eavesdropper; and (ii) a designated pair of terminals generate a private key, which is effectively concealed from the remaining terminal as well as the eavesdropper. Furthermore, we develop an approach for the construction of a new class of provably secure secret keys by terminals in several simple multiterminal source models, which exploits innate connections between secret key generation and multiterminal Slepian-Wolf near-lossless data compression (sans secrecy restrictions). Implementations of these constructions using low density parity check (LDPC) channel codes are illustrated.
    URI
    http://hdl.handle.net/1903/3078
    Collections
    • Electrical & Computer Engineering Theses and Dissertations
    • UMD Theses and Dissertations

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility
     

     

    Browse

    All of DRUMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister
    Pages
    About DRUMAbout Download Statistics

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility