Secure Online Data Sharing in Cloud by Private Transmit Cryptosystem Using Aggregate Keys
Keywords:Data integrity, broadcast, key-aggregate cryptosystem, cloud computing, data sharing.
Cloud has become a crucial part of our day to day life because of its easy, effortless and straightforward nature of data storing and sharing. One of the important concerns for many users is data storing, we mustnâ€™t forget about data sharing. A convenient way of online data sharing is to look at its pros for simple access while preserving security are cons for any user. Thus, a better way of ensuring userâ€™s data is to implement data integrity with the KAC scheme. This scheme provides an efficient sharing method of decrypting multiple sets of data with the single key. Itâ€™s one among many ways of quick and effective data retrieval in case of data loss or data alteration on the cloud. It also uses the broadcast algorithm to distribute data for a specific set of users. This scheme uses basic HMAC, one of the secure hash functions for the stability of data integrity.Â Therefore provides a protected environment where a user can share the bulk of data through integrity. Another advantage of using this scheme could reduce the burden of computation over the cloud.
Â Â Â Â Â Â
 Chow SS, He YJ, Hui LC & Yiu SM, â€œSpice simple privacy-preserving identity-management for cloud environmentâ€, International Conference on Applied Cryptography and Network Security, (2012), pp.526-543.
 Akl SG & Taylor PD, â€œCryptographic solution to a problem of access control in a hierarchyâ€, ACM Transactions on Computer Systems (TOCS), Vol.1, No.3, (1983), pp.239-248.
 Chick GC & Tavares SE, â€œFlexible access control with master keysâ€, Conference on the Theory and Application of Cryptology, (1989), 316-322.
 Tzeng WG, â€œA time-bound cryptographic key assignment scheme for access control in a hierarchyâ€, IEEE Transactions on Knowledge and Data Engineering, Vol.14, No.1, (2002), pp.182-188.
 Ateniese G, De Santis A, Ferrara AL & Masucci B, â€œProvably-secure time-bound hierarchical key assignment schemesâ€, Journal of cryptology, Vol.25, No.2, (2012), pp.243-270.
 Ravinderpal SS, â€œCryptographic implementation of a tree hierarchy for access controlâ€, Information Processing Letters, (1988), pp.95â€“ 98.
 Jeremy H & Ben L, â€œToward hierarchical identity-based encryptionâ€, Advances in Cryptology EUROCRYPT, (2002), pp.466â€“481.
 Dan B, Xavier B & Eu JG, â€œHierarchical identity based encryption with constant size ciphertextâ€, Advances in Cryptologyâ€“EUROCRYPT, (2005), pp.440â€“456.
 Brent W, â€œEfficient identity-based encryption without random oraclesâ€, Advances in Cryptologyâ€“EUROCRYPT, (2005), pp.114-127.
 Xavier B & Brent W, â€œAnonymous hierarchical identity based encryption (without random oracles)â€, Advances in Cryptology-CRYPTO, (2006), pp.290â€“307.
 Adi S, â€œIdentity-based cryptosystems and signature schemesâ€, Advances in Cryptology, (1985), pp.47â€“53.
 Fuchun G, Yi M & Zhide C, â€œIdentity-based encryption: how to decrypt multiple ciphertext using a single decryption keyâ€, In Pairing-Based Cryptographyâ€“Pairing, (2007), pp.392â€“406.
 Fuchun G, Yi M, Zhide C & Li X, â€œMulti-identity single key decryption without random oraclesâ€, Information Security and Cryptology, (2008), pp.384â€“398.
 Amit S & Brent W, â€œFuzzy identity-based encryptionâ€, Advances in Cryptologyâ€“EUROCRYPT, (2005), pp.457â€“473.
 Ming L, Shucheng Y, Yao Z, Kui R & Wenjing L, â€œScalable and secure sharing of personal health records in cloud computing using attribute-based encryptionâ€, IEEE Transactions Parallel and Distributed Systems, (2013), pp.131â€“143.
 Benaloh J, Chase M, Horvitz E & Lauter K, â€œPatient Controlled Encryption: Ensuring Privacy of Electronic Medical Recordsâ€, ACM Workshop on Cloud Computing Security ACM, (2009), pp.103â€“114.
 Goldreich O, Foundations of cryptography I: Basic Tools, Cambridge, Cambridge University Press, (2001).
 Mihir B, Joe K & Phillip R, â€œThe Security of the Cipher Block Chaining Message Authentication Codeâ€, Journal of Computer and System Sciences, Vol.61, (2001), pp.362-399.
 Bellare M, Canetti R & Krawczyk H, â€œKeying hash functions for message authenticationâ€, Annual International Cryptology Conference, (1996), pp.1-15.
 Rogaway P & Shrimpton T, â€œCryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistanceâ€, International workshop on fast software encryption, (2004), pp.371-388.
 Schneier B, Applied Cryptography, John Wiley & Sons, (1996).
 Mihir B, â€œNew Proofs for NMAC and HMAC: Security without Collision-Resistanceâ€, Advances in Cryptology CRYPTO, (2006).
 The Keyed-Hash Message Authentication Code (HMAC). Federal Information Processing Standards Publication, (2008).
 Sikhar P, Yash S & Debdeep M, â€œProvably Secure Key-Aggregate Cryptosystems with Broadcast Aggregate Keys for Online Data Sharing on the Cloudâ€, IEEE Transactions on Computers, (2016).
 Cheng KC, Sherman SMC, Wen GT, Jianying Z & Robert HD, â€œKey-aggregate cryptosystem for scalable data sharing in cloud storageâ€, Parallel and Distributed Systems, IEEE Transactions on Computers, (2014), pp.468â€“477.
 Dan B, Craig G & Brent W, â€œCollusion resistant broadcast encryption with short ciphertexts and private keysâ€, Advances in Cryptology-CRYPTO, (2005), pp.258â€“275.
 Sai Prasad K, Chandra SRN, Rama B, Soujanya A & Ganesh D, â€œAnalyzing and Predicting Academic Performance of Students Using Data Mining Techniquesâ€, Journal of Advanced Research in Dynamical and Control Systems, Vol.10, No.7, (2018), pp.259-266.
 B Kassimbekova, G Tulekova, V Korvyakov (2018). Problems of development of aesthetic culture at teenagers by means of the Kazakh decorative and applied arts. OpciÃ³n, AÃ±o 33. 170-186
 M PallarÃ¨s Piquer and O Chiva Bartoll (2017). La teorÃa de la educaciÃ³n desde la filosofÃa de Xavier Zubiri. OpciÃ³n, AÃ±o 33, No. 82 (2017): 91-113