Toward Construction of Encryption with Decryption Awareness Ability for Cloud Storage

  • Xu An WangEmail author
  • Fatos Xhafa
  • GuangMing Wu
  • Wei Wang
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 1)


In cloud platforms, nowadays more and more data owners prefer to first encrypt their personal files and then outsource them to the cloud storage. This however, poses several challenges such as those related to access control and rights. Most previous research results care more about the fine-grained access to the encrypted private files, while little research has concentrated on the following basic question: have the stored ciphertexts been successfully decrypted and when did this happen? Aiming at tackling this problem, we propose a new notion of encryption, namely, public key encryption with decryption awareness ability, which we denote as PKE-DAA. Concretely speaking, PKE-DAA can realize the following: after a ciphertext has been created by the encrypter, once this ciphertext has been successfully decrypted, the encrypter or some other party could be aware of the decryption! To the best of our knowledge, until now there are no such notions or encryption schemes. Own to the recent cryptographic community research result on obfuscation, especially indistinguishable obfuscation, we try to give such a construction in a weak form.We believe that this new primitive has many potential applications, such as against strongest illegal eavesdropping launched by NSA in the post-Snowden era etc.


Cloud Storage Decryption Algorithm Homomorphic Encryption Fuzzy Identity Cryptology ePrint Archive 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan SP, Yang K (2001) On the (im)possibility of obfuscating programs. In: Kilian J (ed) CRYPTO 2001, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 2139, pp 1–18Google Scholar
  2. 2.
    Boneh D, Franklin MK (2001) Identity-based encryption from the Weil pairing. In: Kilian J (ed) CRYPTO 2001, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 2139, pp 213–229Google Scholar
  3. 3.
    Boneh D, ZhandryM(2014) Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay JA, Gennaro R (eds) CRYPTO 2014, Part I, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 8616, pp 480–499, DOI  10.1007/978-3-662-44371-2_27
  4. 4.
    Brakerski Z, Vaikuntanathan V (2011) Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky R (ed) 52nd FOCS, IEEE Computer Society Press, Palm Springs, California, USA, pp 97–106Google Scholar
  5. 5.
    Brakerski Z, Gentry C, Vaikuntanathan V (2012) (leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pages 309–325Google Scholar
  6. 6.
    Chase M, Chow SSM (2009) Improving privacy and security in multi-authority attribute-based encryption. In: Al-Shaer E, Jha S, Keromytis AD (eds) ACM CCS 09, ACM Press, Chicago, Illinois, USA, pp 121–130Google Scholar
  7. 7.
    Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Transactions on Information Theory 22(6):644–654Google Scholar
  8. 8.
    Garg S, Gentry C, Halevi S, Raykova M, Sahai A, Waters B (2013) Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, IEEE Computer Society Press, Berkeley, CA, USA, pp 40–49Google Scholar
  9. 9.
    Garg S, Gentry C, Halevi S, Sahai A, Waters B (2013) Attribute-based encryption for circuits from multilinear maps. In: Canetti R, Garay JA (eds) CRYPTO 2013, Part II, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 8043, pp 479–499, DOI  10.1007/978-3-642-40084-1_27
  10. 10.
    Gentry C, Halevi S, Smart NP (2012) Fully homomorphic encryption with polylog overhead. In: Pointcheval D, Johansson T (eds) EUROCRYPT 2012, Springer, Berlin, Germany, Cambridge, UK, LNCS, vol 7237, pp 465–482Google Scholar
  11. 11.
    Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti R, Garay JA (eds) CRYPTO 2013, Part I, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 8042, pp 75–92, DOI  10.1007/978-3-642-40041-4_5
  12. 12.
    Goldwasser S, Kalai YT (2005) On the impossibility of obfuscation with auxiliary input. In: 46th FOCS, IEEE Computer Society Press, Pittsburgh, PA, USA, pp 553–562Google Scholar
  13. 13.
    Goldwasser S, Rothblum GN (2007) On best-possible obfuscation. In: Vadhan SP (ed) TCC 2007, Springer, Berlin, Germany, Amsterdam, The Netherlands, LNCS, vol 4392, pp 194–213Google Scholar
  14. 14.
    Gorbunov S, Vaikuntanathan V, Wee H (2013) Attribute-based encryption for circuits. In: Boneh D, Roughgarden T, Feigenbaum J (eds) 45th ACM STOC, ACM Press, Palo Alto, CA, USA, pp 545–554Google Scholar
  15. 15.
    Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: Juels A, Wright RN, Vimercati S (eds) ACM CCS 06, ACM Press, Alexandria, Virginia, USA, pp 89–98, available as Cryptology ePrint Archive Report 2006/309Google Scholar
  16. 16.
    Hada S (2000) Zero-knowledge and code obfuscation. In: Okamoto T (ed) ASIACRYPT 2000, Springer, Berlin, Germany, Kyoto, Japan, LNCS, vol 1976, pp 443–457Google Scholar
  17. 17.
    Halevi S, Shoup V (2014) Algorithms in HElib. Cryptology ePrint Archive, Report 2014/106,
  18. 18.
    Lewko AB,Waters B (2011) Decentralizing attribute-based encryption. In: Paterson KG (ed) EUROCRYPT 2011, Springer, Berlin, Germany, Tallinn, Estonia, LNCS, vol 6632, pp 568–588Google Scholar
  19. 19.
    Lewko AB, Waters B (2012) New proof methods for attribute-based encryption: Achieving full security through selective techniques. In: Safavi-Naini R, Canetti R (eds) CRYPTO 2012, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 7417, pp 180–198Google Scholar
  20. 20.
    Lewko AB, Okamoto T, Sahai A, Takashima K, Waters B (2010) Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In: Gilbert H (ed) EUROCRYPT 2010, Springer, Berlin, Germany, French Riviera, LNCS, vol 6110, pp 62–91Google Scholar
  21. 21.
    Okamoto T, Takashima K (2010) Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin T (ed) CRYPTO 2010, Springer, Berlin, Germany, Santa Barbara, CA, USA, LNCS, vol 6223, pp 191–208Google Scholar
  22. 22.
    Rivest RL, Shamir A, Adleman LM (1978) A method for obtaining digital signature and public-key cryptosystems. Communications of the Association for Computing Machinery 21(2):120–126Google Scholar
  23. 23.
    Sahai A, Waters B (2014) How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys DB (ed) 46th ACMSTOC, ACMPress, New York, NY, USA, pp 475–484Google Scholar
  24. 24.
    Sahai A,Waters BR (2005) Fuzzy identity-based encryption. In: Cramer R (ed) EUROCRYPT 2005, Springer, Berlin, Germany, Aarhus, Denmark, LNCS, vol 3494, pp 457–473Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Xu An Wang
    • 1
    Email author
  • Fatos Xhafa
    • 2
  • GuangMing Wu
    • 1
  • Wei Wang
    • 3
  1. 1.Key Laboratory of Cryptology and Information SecurityEngineering University of CAPFXi’anChina
  2. 2.Department of Computer ScienceTechnical University of CataloniaBarcelonaSpain
  3. 3.Engineering University of CAPFXi’anChina

Personalised recommendations