Cryptology ePrint Archive: Report 2013/272

Cryptography Challenges for Computational Privacy in Public Clouds

Sashank Dara

Abstract: Computational privacy is a property of cryptographic system that ensures the privacy of data (and/or operations) while being processed at an untrusted server. Cryptography has been an indispensable tool for computer security but its readiness for this new generational shift of computing platform i.e. Cloud Computing is still questionable. Theoretical constructions like Fully Homomorphic Encryption, Functional encryption, Server aided Multiparty Computation, Verifiable Computation, Instance Hiding etc. are few directions being pursued. These cryptographic techniques solve Cloud privacy problems at different levels but most of them dont fit well in overall scheme of things. We state the privacy requirements for Cloud offerings in various delivery methods. We discuss the challenges with current cryptographic techniques being pursued by researchers and show that they dont cater to blanket cover these privacy requirements. We urge the need to find generalizations and connections among these isolated techniques. As this might give more insights into the underpinnings of Computational Privacy and lead to better solutions.

Category / Keywords: applications, implementation, computational privacy, cloud privacy, fully homomorphic encryption, functional encryption, challenges

Date: received 13 May 2013, last revised 2 Aug 2013

Contact author: krishna sashank at gmail com

Available format(s): PDF | BibTeX Citation

Note: This is a position paper, got accepted for IEEE 2013 CCEM conference . Minor corrections and typos are fixed with this revision

Version: 20130803:031424 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]