Sai Krishna Illendula, B.Kumar Swamy


The idea of deniability arises from indisputable proven fact that coercers cannot show the forecasted evidence is wrong and for that reason don't have any motive to refuse the best evidence. This method attempts to obstruct coercion efforts as coercers realize that their attempts are ineffective. We make use of this idea to make sure that providers of cloud storage can provide audit-free storage services. The majority of the method of deniable file encryption offers the problems with understanding error including method of designed understanding. Within our work we offer a effective file encryption plan of cloud storage that enables the providers of cloud storage to create convincing false user methods for defend user privacy. We employ highlights of attribute basis file encryption for securing of understanding that's stored inside the sorts of proper-grained access control additionally to deniable file encryption to postpone outdoors auditing. Our suggested plan will grant users to get capable of offer fake secrets that appear genuine to exterior coercers.


Deniability; Fine-Grained Access Control; Attribute Basis Encryption; Deniable Encryption; Coercion; Cloud Storage; User Privacy;


A. B. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters, “Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption,” in Eurocrypt, 2010, pp. 62–91.

N. Attrapadung, J. Herranz, F. Laguillaumie, B. Libert, E. de Panafieu, and C. R`afols, “Attribute-based encryption schemes with constant-size ciphertexts,” Theor. Comput. Sci., vol. 422, pp. 15–38, 2012.

J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-based encryption,” in IEEE Symposium on Security and Privacy, 2007, pp. 321–334.

B. Waters, “Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization,” in Public Key Cryptography, 2011, pp. 53–70

J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Eurocrypt, 2008, pp. 146–162.

S. Meiklejohn, H. Shacham, and D. M. Freeman, “Limitations on transformations from composite-order to prime-order groups: The case of round-optimal blind signatures,” in Asiacrypt, 2010, pp. 519–538.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at