Open Access Open Access  Restricted Access Subscription or Fee Access

Efficient Data Sharing In Cloud Medium with Key Aggregate Cryptosystem

A. Shakila Banu

Abstract


In cloud storage the Resources are shared and, remotely accessed. And then we show how to securely, professionally, share data with others in cloud storage. And consider Aggregation is a collection of things to make retrieve a data but the key aggregate is a multiple keys produce a set of result in the cryptosystem. In the Advanced Key sharing system based on hint text methodology is formed to share the data safely.Once the data sharing is completed then the key aggregate differs from its actual form. So the user cannot guess the key aggregate cryptosystem and this process provides efficient solution than the existing ones.


Keywords


Cloud Storage, Information Retrieval, Hint Text Manipulation, Dynamic Decryption.

Full Text:

PDF

References


S. S. M. Chow, Y. J. He, L. C. K. Hui, and S.-M. Yiu, “SPICE -Simple Privacy-Preserving Identity-Management for Cloud Environment,”in Applied Cryptography and Network Security - ACNS2012, 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.

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

B. Wang, S. S. M. Chow, M. Li, and H. Li, “Storing Shared Data on the Cloud via Security-Mediator,” in International Conference on Distributed Computing Systems - ICDCS 2013. IEEE, 2013.

S. S. M. Chow, C.-K. Chu, X. Huang, J. Zhou, and R. H. Deng,“Dynamic Secure Cloud Storage with Provenance,” in Cryptographyand Security: From Theory to Applications - Essays Dedicated to Jean-Jacques Quisquater on the Occasion of His 65th Birthday, ser. LNCS, vol. 6805. Springer, 2012, pp. 442–464.

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

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

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

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

S. G. Akl and P. D. Taylor, “Cryptographic Solution to a Problem of Access Control in a Hierarchy,” ACM Transactions on Computer Systems (TOCS), vol. 1, no. 3, pp. 239–248, 1983.

G. C. Chick and S. E. Tavares, “Flexible Access Control with Master Keys,” 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 Assignment Scheme for Access Control in a Hierarchy,” IEEE Transactions on Knowledge 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, 2012.

F. Guo, Y. Mu, and Z. Chen, “Identity-Based Encryption: How to Decrypt Multiple Cipher texts Using a Single Decryption Key,” in Proceedings of Pairing-Based Cryptography (Pairing ’07), ser. LNCS, vol. 4575. Springer, 2007, pp. 392–406.

Y. Sun and K. J. R. Liu, “Scalable Hierarchical Access Control in Secure Group Communications,” in Proceedings of the 23th IEEE International Conference on Computer Communications (INFOCOM’04). IEEE, 2004.

Q. Zhang and Y. Wang, “A Centralized Key Management Scheme for Hierarchical Access Control,” in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM ’04). IEEE, 2004, pp.2067–2071.

J. Benaloh, “Key Compression and Its Application to Digital Fingerprinting,” Microsoft Research, Tech. Rep., 2009.

D. Boneh and M. K. Franklin, “Identity-Based Encryption from the Weil Pairing,” in Proceedings of Advances in Cryptology – CRYPTO ’01, ser. LNCS, vol. 2139. Springer, 2001, pp. 213–229.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.