• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    • Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Information-theoretically secure key generation and management

    Author(s)
    Yang, EH
    Wu, XW
    Griffith University Author(s)
    Wu, Xin-Wen
    Year published
    2017
    Metadata
    Show full item record
    Abstract
    In this paper, we address the problems of key generation and management for enabling one-key-for-one-file secure encryption, where every file is encrypted by using an independent random key, which is highly desired in long-term protection of data stored on public clouds and other applications. A new concept dubbed information-theoretical ϵ-security is introduced to measure the security of a keystore (i.e., a set of random keys, ki, 1 ≤ i ≤ Λ, each consisting of l bits) which are generated from a random string of L bits, called the keystore seed. An efficient keystore generation scheme is presented, and the resulting keystore ...
    View more >
    In this paper, we address the problems of key generation and management for enabling one-key-for-one-file secure encryption, where every file is encrypted by using an independent random key, which is highly desired in long-term protection of data stored on public clouds and other applications. A new concept dubbed information-theoretical ϵ-security is introduced to measure the security of a keystore (i.e., a set of random keys, ki, 1 ≤ i ≤ Λ, each consisting of l bits) which are generated from a random string of L bits, called the keystore seed. An efficient keystore generation scheme is presented, and the resulting keystore Ψ = {ki :1 ≤ i ≤ Λ} is shown to be information-theoretically e-secure with small e. Specifically, they satisfy the following properties: (1) Λ ≫ L is sufficiently large to realize one-key-for-one-file encryption for applications with a large number of files; (2) for any key index i, the key ki is uniformly distributed over the key space {0,1}1 and hence statistically independent of i if i is chosen randomly; (3) for any two independent i, j, 1 ≤ i, j ≤ Λ, the probability that ki = kj is less than (1 - ϵ) × 2-l + ϵ and (4) for any two independent key indices i and j, knowing i, j, and ki does not reduce the amount of uncertainty about kj significantly, i.e., the conditional Shannon entropy H (kj |i, j, ki)is at least as large as (1 - ϵ)H(kj | j). These security properties along with easy generation of each key ki from the keystore seed and the key index i remove most challenges in distributing and managing a large number of random keys.
    View less >
    Conference Title
    IEEE International Symposium on Information Theory - Proceedings
    DOI
    https://doi.org/10.1109/ISIT.2017.8006785
    Subject
    Cybersecurity and privacy not elsewhere classified
    Publication URI
    http://hdl.handle.net/10072/372039
    Collection
    • Conference outputs

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander