Scalable Data Sharing In Cloud using Public Key Cryptosystem

Madeti Mohana Krishna Kumar, S Madhri

Abstract


Data sharing is an important functionality in cloud storage. We show how to securely, efficiently, and flexibly share data with others in cloud storage. We describe new public-key cryptosystems that produce constant-size cipher text such that efficient delegation of decryption rights for any set of cipher text is possible. The novelty is that one can aggregate any set of secret keys and make them as compact as a single key, but encompassing the power of all the keys being aggregated. The secret key holder can release the constant-size aggregate key for the flexible choices of cipher text set in cloud storage, but other encrypted files outside the set remain confidential. This compact aggregate key can be conveniently sent to others or be stored in a smart card with very limited secure storage. We provide formal security analysis of our schemes in the standard model. We also describe other application of our schemes. In particular, our schemes give the first public-key patient-controlled encryption for flexible hierarchy, which was yet to be known.

 


Keywords


Cloud storage, data sharing, key-aggregate encryption, Public Key Encryption.

References


key –Aggregate Cryptosystem for Scalable Data Sharing in CloudStorage Cheng-Kang Chu, Sherman S. M. Chow, Wen-GueyTzeng,Jianying Zhou, and Robert H. Deng, Senior Member, IEEE

C Wang, S. S. M. Chow, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Secure Cloud Storage,” IEEETrans.Computers, vol. 62, no. 2, pp. 362–375, 2013

V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-BasedEncryption for Fine-Grained Access Control of Encrypted data,”inProceedings of the 13th ACM Conference on Computer andCommunications Security (CCS ’06). ACM, 2006, pp. 89–98.

M. J. Atallah, M. Blanton, N. Fazio, and K. B. Frikken, “Dynamic andEfficient Key Management for Access Hierarchies,”ACMTransactions on Information and System Security (TISSEC), vol.12,no. 3, 2009.

S. S. M. Chow, C.-K.Chu, X. Huang, J. Zhou, and R. H.

Deng,“Dynamic Secure Cloud Storage with Provenance,” inCryptography and Security: From Theory to Applications – EssaysDedicated to Jean-Jacques Quisquater on the Occasion of His 65thBirthday, ser. LNCS, vol. 6805. Springer, 2012, pp. 442–464.

D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate andVerifiably Encrypted Signatures from Bilinear Maps,” in Proceedingsof Advances in Cryptology - EUROCRYPT ’03, ser. LNCS,vol. 2656.Springer, 2003, pp. 416–432.

S. S. M. Chow, Y. J. He, L. C. K. Hui, and S.-M.Yiu, “SPICE -Simple Privacy-Preserving Identity-Management for CloudEnvironment,” in Applied Cryptography and Network Security –ACNS 2012, ser. LNCS, vol. 7341. Springer, 2012, pp. 526–543.

L. Hardesty, “Secure computers aren’t so secure,” MIT press,2009,http://www.physorg.com/news176107396.html

B. Wang, S. S. M. Chow, M. Li, and H. Li, “Storing Shared Data onthe Cloud via Security-Mediator,” inInternational Conference onDistributed Computing Systems - ICDCS 2013. IEEE, 2013.

J. Benaloh, M. Chase, E. Horvitz, and K. Lauter, “Patient ControlledEncryption: Ensuring Privacy of Electronic Medical Records,” inProceedings of ACM Workshop on Cloud Computing Security (CCSW’09). ACM, 2009, pp. 103–114.

F. Guo, Y. Mu, Z. Chen, and L. Xu, “Multi-Identity Single-KeyDecryption without Random Oracles,” in Proceedings of InformationSecurity and Cryptology (Inscrypt ’07), ser. LNCS, vol. 4990.Springer, 2007, pp. 384–398.

G. C. Chick and S. E. Tavares, “Flexible Access Control with MasterKeys,” in Proceedings of Advances in Cryptology - CRYPTO’89, ser.LNCS, vol. 435. Springer, 1989, pp. 316–322

W.-G. Tzeng, “A Time-Bound Cryptographic Key AssignmentScheme for Access Control in a Hierarchy,” IEEE Transactions onKnowledge and Data Engineering (TKDE), vol. 14, no. 1, pp. 182–188,2002.

G. Ateniese, A. D. Santis, A. L. Ferrara, and B. Masucci, “Provably-Secure Time-Bound Hierarchical Key Assignment Schemes,” J.Cryptology, vol. 25, no. 2, pp. 243–270, 2012Cho,

J., Garcia-Molina, H., Page, L., Efficient Crawling: Through URLOrdering, Computer Science Department, Stanford University,Stanford, CA, USA, 1997.


Full Text: PDF [FULL TEXT]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.