13.07.2015 Views

A cryptographic solution for general access control - University of ...

A cryptographic solution for general access control - University of ...

A cryptographic solution for general access control - University of ...

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

A Cryptographic Solution <strong>for</strong> General Access Control 469Table 1. Per<strong>for</strong>mance Comparison between RRN and DBSSystems Encryption Decryption Granting <strong>access</strong> Revoking <strong>access</strong>toasubject from a subjectRRN O(k 2 l el 2 n) O(l d l 2 n) O(k 2 l el 2 n) O(k 2 l el 2 n)DBS O(kl el 2 n) O(l d l 2 n) O(l el 2 n) O(kl 2 n)complexity is kO(l e l 2 n )+O(kl2 n ) ≈ O(kl el 2 n ). The DBS decryption complexity isthe same as that <strong>of</strong> RRN: O(l d l 2 n). We next analyze the complexity <strong>of</strong> authorizationalterations. In RRN system, granting <strong>access</strong> to a subject (or revoking <strong>access</strong>from a subject) requires re-encrypting the affected data item. The complexity<strong>of</strong> this re-encryption is approximately O(k 2 l e l 2 n). In our data based <strong>solution</strong>,granting a subject <strong>access</strong> to a static data item, we only need to generate a newindividual ciphertext <strong>for</strong> the subject and then derive the new share ciphertextfrom the old one. The complexity <strong>of</strong> this process is: O(l e l 2 n)+2O(l 2 n) ≈ O(l e l 2 n).Revoking a subject from <strong>access</strong>ing a static data item only needs one modularoperation. The complexity <strong>of</strong> this process is: O(kl 2 n). Here we only illustrate authorizationalterations <strong>for</strong> static data items; <strong>for</strong> dynamic data items, efficiency<strong>of</strong> authorization alterations is the same as that <strong>of</strong> encryption. The per<strong>for</strong>mancecomparison between RRN and DBS is summarized in table 1, which showsthat besides decryption, DBS system is more efficient than RRN system. Furthermore,our system has the flexibility <strong>of</strong> choosing an alternative public keycryptosystem which may results in more efficient system than DBS system.As we know, RRN system requires the RSA public exponent e to be shared.This opens a potential security hole to attackers. The claim <strong>of</strong> [1] that “havingmultiple copies <strong>of</strong> the same data encrypted with different keys does not arise”is not true because with the knowledge <strong>of</strong> the RSA moduli and the sharers <strong>of</strong> adata item, an attacker can create those multiple copies by modular operations.In comparison with RRN system, if our data based <strong>solution</strong> uses the RSA cryptosystem,sharing the same RSA public exponent e is not required, i.e. differentRSA public exponents can be used. Moreover, our data based <strong>solution</strong> has theflexibility <strong>of</strong> choosing an alternative public key cryptosystem which may resultsin more secure system.5 A Key Based SolutionAs discussed in section 1, our <strong>cryptographic</strong> <strong>solution</strong> <strong>of</strong> <strong>general</strong> <strong>access</strong> <strong>control</strong>has two categories: data based <strong>solution</strong> and key based <strong>solution</strong>. In data based<strong>solution</strong>, to share a message m with k sharers, the size <strong>of</strong> the share ciphertextis k times bigger than that <strong>of</strong> m. As a consequence, data based <strong>solution</strong> is notpreferable if m or k is big. Moreover, data based <strong>solution</strong> is based on public keycryptosystem. This is because, to share a data item, its owner must know allsharers’ encryption keys. In order to protect the confidentiality <strong>of</strong> decryptionkeys, we can only use a public key cryptosystem. Public key cryptosystems are

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!