• Title of article

    Online data storage using implicit security

  • Author/Authors

    Abhishek Parakh، نويسنده , , Subhash Kak، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    9
  • From page
    3323
  • To page
    3331
  • Abstract
    It is advantageous to use implicit security for online data storage in a cloud computing environment. We describe the use of a data partitioning scheme for implementing such security involving the roots of a polynomial in finite field. The partitions are stored on randomly chosen servers on the network and they need to be retrieved to recreate the original data. Data reconstruction requires access to each server, login password and the knowledge of the servers on which the partitions are stored. This scheme may also be used for data security in sensor networks and internet voting protocols.
  • Keywords
    Implicit security architecture , Data partitioning , Online data storage
  • Journal title
    Information Sciences
  • Serial Year
    2009
  • Journal title
    Information Sciences
  • Record number

    1213740