Mutual Key administration Protocol via Deniable Attribute-Based Encryption for Cloud Data Sharing

Authors(2) :-T. Ushapriyanka, Prof. R. Suresh

Cloud storage services became increasingly in style. As a result of the importance of privacy, several cloud storage encryption schemes are proposed to protect data from those that don't have access. All such schemes assumed that cloud storage providers are safe and can't be hacked; but, in apply, some authorities might force cloud storage providers to reveal user secrets or confidential data on the cloud, so altogether circumventing storage encryption schemes. In this paper, we have a tendency to present our design for a new cloud storage encryption theme that permits cloud storage providers to create convincing fake user secrets to protect user privacy. Since coercers cannot tell if obtained secrets are true or not, the cloud storage providers ensure that user privacy continues to be securely protected.

Authors and Affiliations

T. Ushapriyanka
M. Tech , Department of Computer Science And Engineering, Chadalawada Ramanamma Engineering College ,Chadalawada Nagar , Tirupati, India
Prof. R. Suresh
Professor, Department of Computer Science And Engineering, Chadalawada Ramanamma Engineering College , Chadalawada Nagar, Tirupati , India

Cloud Storage, encryption schemes, user privacy.

  1. Shweta Agrawal, Dan Boneh, and Xavier Boyen. Efficient lattice (H) IBE in the standard model. In Advances in Cryptology—EUROCRYPT 2010, volume 6110 of LNCS, pages 553- 572. Springer, 2010.
  2. Shweta Agrawal, Dan Boneh, and Xavier Boyen. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Advances in Cryptology—CRYPTO 2010, volume 6223 of LNCS, pages 98-115. Springer, 2010.
  3. Shweta Agrawal and Xavier Boyen. Identity-based encryption from lattices in the standard model. Manuscript, July 2009. http://www.cs.stanford.edu/~xb/ab09/.
  4. M. Ajtai. Generating hard instances of lattice problems (extended abstract). In STOC ’96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 99- 108, New York, NY, USA, 1996. ACM.
  5. Miklos Ajtai. Generating hard instances of the short basis problem. In Jir Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, ICALP, volume 1644 of Lecture Notes in Computer Science, pages 1-9. Springer, 1999.
  6. Miklos Ajtai and Cynthia Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In STOC, pages 284-293, 1997.
  7. Joel Alwen and Chris Peikert. Generating shorter bases for hard random lattices. In STACS, pages 75-86, 2009.
  8. Rikke Bendlin and Ivan Damg?ard. Threshold decryption and zero-knowledge proofs for latticebased cryptosystems. In TCC, pages 201-218, 2010.
  9. John Bethencourt, Amit Sahai, and Brent Waters. Ciphertext-policy attribute-based encryption. In SP ’07: Proceedings of the 2007 IEEE Symposium on Security and Privacy, pages 321-334, Washington, DC, USA, 2007. IEEE Computer Society. 15
  10. Dan Boneh and Xavier Boyen. Efficient selective-id secure identity-based encryption without random oracles. In Advances in Cryptology (EUROCRYPT 2004), volume 3027 of LNCS, pages 223-238. Springer, 2004.
  11. Dan Boneh, Ran Canetti, Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based encryption. Siam Journal on Computing, 36:1301-1328, 2007.
  12. Dan Boneh, Craig Gentry, and Michael Hamburg. Space-efficient identity based encryption without pairings. In Proceedings of FOCS 2007, pages 647-657, 2007.
  13. Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-DNF formulas on ciphertexts. In Theory of Cryptography, pages 325-341, 2005.
  14. Dan Boneh, Amit Sahai, and Brent Waters. Functional encryption: Definitions and challenges. In TCC, 2011.
  15. Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphism encryption from ring-LWE and security for key dependent messages. To Appear in CRYPTO 2011, 2011.
  16. David Cash, Dennis Hofheinz, Eike Kiltz, and Chris Peikert. Bonsai trees or, how to delegate a lattice basis. In Proceedings of Eurocrypt, 2010, 2010. http://eprint.iacr.org/.
  17. Ling Cheung and Calvin C. Newport. Provably secure ciphertext policy ABE. In ACM Conference on Computer and Communications Security, pages 456-465, 2007.
  18. Clifford Cocks. An identity based encryption scheme based on quadratic residues. In Proceedings of the 8th IMA International Conference on Cryptography and Coding, pages 26-8, 2001.

Publication Details

Published in : Volume 3 | Issue 4 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 172-176
Manuscript Number : CSEIT11833186
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

T. Ushapriyanka, Prof. R. Suresh , "Mutual Key administration Protocol via Deniable Attribute-Based Encryption for Cloud Data Sharing", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.172-176, March-April-2018.
Journal URL : http://ijsrcseit.com/CSEIT11833186

Article Preview

Follow Us

Contact Us