Robust and Simple N-Party Entangled Authentication Cloud Storage Protocol Based on Secret Sharing Scheme

Entangled cloud storage schemes think in different ways with traditional cloud storage secure schemes which provide high level security to force cloud storage servers for treating equally between normal users and influential users without discrimi- nation. The current work on cloud secure storage mainly considers some low level rules, i.e. access control, fuzzy keyword search, data integrity checking, and identity-based cryp- tography. However, either these security mechanisms do not consider a subjectivity of cloud storage administrator (or called a potentially malicious cloud storage provider) to delete your data and even normal users accounts just because you are a normal user. In this paper, techniques are presented which aim at the cloud storage provider must pro- vide the same quality service for each client. We develop a novel scheme, called EACS (entangled authenticated cloud storage), to settle the aforementioned typical problem. Its main idea is to use entangled method for designing a scheme which has four key policies: (i) N-clients can easily entangle their files into a single secret c to be store by a cloud storage provider S; (ii) Using secret c, each client may easily recovery their own original file respectively; (iii) If the server alters c in any way, no clients will be able to retrieve its original file (this policy is called all-or-noting-integrity). (iv) All the parties in the entangled scheme should be authenticated. Finally, we give a full specification of this scheme, including how to realize specific policies, how to design the scheme, how to prove the schemes security.

[1]  Lein Harn,et al.  Authenticated Group Key Transfer Protocol Based on Secret Sharing , 2010, IEEE Transactions on Computers.

[2]  M. Panella Associate Editor of the Journal of Computer and System Sciences , 2014 .

[3]  Amos Beimel,et al.  Secret Sharing and Non-Shannon Information Inequalities , 2011, IEEE Transactions on Information Theory.

[4]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[5]  Carles Padró,et al.  Ideal Hierarchical Secret Sharing Schemes , 2010, IEEE Transactions on Information Theory.

[6]  Tamar Frankel [The theory and the practice...]. , 2001, Tijdschrift voor diergeneeskunde.

[7]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.

[8]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[9]  Jessica Ruth Metcalf-Burton Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid , 2011, Discret. Math..

[10]  Ari Juels,et al.  Pors: proofs of retrievability for large files , 2007, CCS '07.

[11]  Colin D. Simpson,et al.  Industrial Electronics , 1936, Nature.

[12]  Muhammad Khurram Khan,et al.  Cryptanalysis and security enhancement of a 'more efficient & secure dynamic ID-based remote user authentication scheme' , 2011, Comput. Commun..

[13]  Joan Feigenbaum,et al.  Towards a theory of data entanglement , 2007, Theor. Comput. Sci..

[14]  Zhang Min,et al.  achieving efficient dynamic cryptographic access control in cloud storage , 2011 .

[15]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[16]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[17]  Dong Yong-feng A Data Assured Deletion Approach Adapted for Cloud Storage , 2012 .