Show simple item record

dc.contributor.authorYang, EH
dc.contributor.authorWu, XW
dc.date.accessioned2018-03-22T02:03:22Z
dc.date.available2018-03-22T02:03:22Z
dc.date.issued2017
dc.identifier.isbn9781509040964
dc.identifier.issn2157-8095
dc.identifier.doi10.1109/ISIT.2017.8006785
dc.identifier.urihttp://hdl.handle.net/10072/372039
dc.description.abstractIn 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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.publisher.placeUnited States
dc.relation.ispartofconferencenameISIT 2017
dc.relation.ispartofconferencetitleIEEE International Symposium on Information Theory - Proceedings
dc.relation.ispartofdatefrom2017-06-25
dc.relation.ispartofdateto2017-06-30
dc.relation.ispartoflocationAachen, Germany
dc.relation.ispartofpagefrom1529
dc.relation.ispartofpageto1533
dc.subject.fieldofresearchComputer System Security
dc.subject.fieldofresearchcode080303
dc.titleInformation-theoretically secure key generation and management
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.hasfulltextNo Full Text
gro.griffith.authorWu, Xin-Wen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record