Research On The Data Privacy And Consistency Technologies In Online Storage System

With a rush of online storage systems entering into the market and providing anincreasing cheap storage space to the customers, online storage services are gainingpopularity nowadays. But a majority of online storage systems have some flaws in the way ofsecurity, what’s more, some of them do not encrypt the data which the customers own. Insuch systems, online storage providers possess the control and access right to the user’s data,which makes the ordinary users usually lose the control over their data. Consequently, thistriggers a series of security threat, for example, data stolen and modification, etc. To someextent, these threat prevent the development of the online storage. To solve this problem, wepropose a security module: online storage which loading this module can provide user withdata confidentiality, data integrity and access control. We adopt coupling design in order toguarantee the independence of the online storage system. When implanting the securitymodule, the system only need to do a small amount of changes and can provide securityprotection on the basis of the original system. We use efficient key management, dataself-encryption technology and lazy revocation technique in the security module. In thesecurity metadata server, we employ caching technology to enhance the efficiency of thesystem. In order to increase authority of the whole Online storage system, we introduce a CAas an independent Third-Party. Our experiment results show that when loading the securitymodule, the whole system could not lose much performance which is not beyond theacceptable range of the user. The security metadata server can easily deal with a greatquantity of requests which the users of the storage system send simultaneously when they areonline. In order to cope with the possibility of the increase number of the user, we also designexpandability to the metadata server.Usually, the online systems promise high availability and low latency, and they providedifferent degrees of consistency to find the trade-off between availability, low latency andconsistency. High consistency usually means the systems will sacrifice the availability, butlow consistency can bring difficulty to the programmer. In this paper, we present a newconsistency protocol for a online storage system, which can let it deal with the operation ofmove delete and rename on the sharing catalogue and file efficiently. At the same time, thisprotocol can guarantee the catalogue and file on the client will not end in chaos.