Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

Applicability of Homomorphic Encryption and CryptDB in Social and Business Applications: Securing Data Stored on the Third Party Servers while Processing through Applications

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 100 - Number 1
Year of Publication: 2014
Authors:
Kurra Mallaiah
S. Ramachandram
10.5120/17487-7999

Kurra Mallaiah and S Ramachandram. Article: Applicability of Homomorphic Encryption and CryptDB in Social and Business Applications: Securing Data Stored on the Third Party Servers while Processing through Applications. International Journal of Computer Applications 100(1):5-19, August 2014. Full text available. BibTeX

@article{key:article,
	author = {Kurra Mallaiah and S. Ramachandram},
	title = {Article: Applicability of Homomorphic Encryption and CryptDB in Social and Business Applications: Securing Data Stored on the Third Party Servers while Processing through Applications},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {100},
	number = {1},
	pages = {5-19},
	month = {August},
	note = {Full text available}
}

Abstract

Confidentiality in third party services like cloud computing has become a major concern. IT industry and government organizations are very serious about security factor in cloud computing, because its usage has reached all the way from a common man having a mobile phone to large scale business enterprises. In this paper, we present security threats in social and business applications accessing the data stored in cloud computing scenario. Also, we critically discuss homomorphic encryption and CryptDB schemes which are applicable to protect data from malicious third party service environments (cloud computing) and also from insiders for these applications. We also present empirical results of partial homomorpic encryption algorithms over one lakh 10-digit numbers, using Linux virtual machine on VirtualBox, VMPlayer and KVM. The result for four algorithms (namely Paillier, ElGamal, RSA and Benaloh) as performed on the above four different platforms are computed to show their respective overhead values as compared to plain data operations. In case of Paillier Algorithm the overhead is 17, 15, 22 and 12 times for addition operation and 278, 399,518 and 346 times for multiplication operation respectively. Similarly, in case of Elgamal algorithm 1. 72, 1. 6, 11. 7 and 8. 9 times for multiplication operation; in case of RSA algorithm 1. 79, 1. 5, 3. 48 and 1. 5 times for multiplication operation and in case of Benaloh algorithm is 5. 6, 5. 36, 5. 48 and 3. 5 times for addition operation respectively. These performances clearly indicate that these algorithms are quite feasible enough to be used in context of social and business applications by third party service providers

References

  • http://www. homelandsecuritynewswire. com /databreaches-Compromise-nearly-8-million-medicalrecords: Data breaches compromise nearly 8 million medical records, published 1 June 2011
  • http://en. m. wikipedia. org/wiki/PlayStation_Network_outage: Playstation Network outage.
  • Carlos Aguilar Melchor and Philippe Gaborit, Javier Herranz, Additively Homomorphic Encryption with d-Operand Multiplications. CRYPTO 2010, pp. 138-154, 2010.
  • Ivan Damgard, Mads Jurik: A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System Public Key Cryptography 2001:119-136
  • Raluca Ada Popa,Catherine M. S. Redfield,Nickolai Zeldovich,and Hari Balakrishnan," CryptDB: Protecting Confidentiality with Encrypted Query Processing", SOSP'11, October 23-26, 2011, Cascais, Portugal
  • Yin Hu, A Dissertation on"Improving the Efficiency of Homomorphic Encryption Schemes", May 2013
  • http://en. wikipedia. org/wiki/sidechannelattack
  • R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120126,1978.
  • T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. Eurocrypt 08, LNCS 1403,pp. 308-318,1998
  • http://go. worldbank. org/M1JHE0Z280 (extracted on 18. 08. 2008)
  • Brenner, M. , Wiebelitz, J. , von Voigt, G. , Smith, M. : Secret program execution in the cloud applying homomorphic encryption. In: Proceedings of the 5th IEEE International Conference on Digital Ecosystems and Technologies Conference (DEST),pp. 114-119. IEEE (2011)
  • Breuer, P. T. , Bowen, J. P. :Typed assembler for a RISC crypto-processor. In:Barthe, G. ,Livshits,B. ,Scandariato,R. (eds. ) ESSoS 2012. LNCS,vol. 7159,pp. 22-29. Springer, Heidelberg (2012)
  • Nektarios Georgios Tsoutsos and MichailManiatakos, "Investigating the Application of One Instruction Set Computing for Encrypted Data Computation",in proceeding of SPACE 2013 ,Lecture Notes in Computer ScienceVolume 8204, 2013, pp21-37
  • Halevi,S. ,Shoup, V. :Design and implementation of a homomorphic-encryption library (2012)
  • Brakerski, Z. , Gentry, C. , Vaikuntanathan, V. :(Leveled) fully homomorphic encryption without bootstrapping. In:Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309-325. ACM(2012)
  • Ron Rivest, Leonard Adleman,and Michael L. Dertouzos. On data banks and privacyhomomorphisms. In Foundations of Secure Computation,pages 169-180,1978.
  • Craig Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages169-178, 2009.
  • T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory, IT 31(4):469472, July 1985
  • Marten van Dijk, Craig Gentry, ShaiHalevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers. In EUROCRYPT, pages 24-43, 2010.
  • Nigel P. Smart and FrederikVercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography-PKC'10, volume6056 of Lecture Notes in Computer Science, pages 420-443. Springer,2010.
  • Craig Gentry and ShaiHalevi. Implementing gentry's fully-homomorphic encryption scheme. In EUROCRYPT, volume 6632 of Lecture Notes in Computer Science, pages129-148. Springer,2011.
  • Jean-S ebastienCoron,AvradipMandal,David Naccache, and Mehdi Tibouchi. Fullyhomomorphic encryption over the integers with shorter public keys. In CRYPTO,pages 487-504,2011.
  • ZvikaBrakerski and VinodVaikuntanathan. Fully homomorphic encryption from ring-LWE and security for key dependent messages. In CRYPTO, volume 6841, page 501, 2011.
  • ZvikaBrakerski and VinodVaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. In FOCS,pages 97-106,2011. References are to full version: http://eprint. iacr. org/2011/344.
  • Craig Gentry and ShaiHalevi. Fully homomorphic encryption without squashing using Depth-3 arithmetic circuits. In FOCS,pages 107-109,2011.
  • ZvikaBrakerski, Craig Gentry, and VinodVaikuntanathan. Fully homomorphic encryption without bootstrapping. In Innovations in Theoretical Computer Science (ITCS'12), 2012. Available at http://eprint. iacr. org/2011/277.
  • Jean-S ÌA?ebastienCoron, David Naccache, andMehdi Tibouchi. Public key compression and modulus switching for fully homomorphic encryption over the integers. In Advances in Cryptology-EUROCRYPT 2012, volume 7237 of Lecture Notes in Computer Science, pages 446- 464. Springer, 2012.
  • Craig Gentry, ShaiHalevi, and Nigel P. Smart. Fully homomorphic encryption with polylog overhead. In EUROCRYPT, pages 465-482,2012.
  • Craig Gentry, ShaiHalevi, and Nigel P. Smart. Homomorphic evaluation of the aes circuit. In CRYPTO, pages 850-867,2012.
  • Adriana L opez-Alt, EranTromer, and VinodVaikuntanathan. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In STOC, pages 1219-1234, 2012.
  • ZvikaBrakerski. Fully homomorphic encryption without modulus switching from classical gapsvp. In CRYPTO, pages 868-886, 2012.
  • LinkedIn passwords leaked by hackers:http://www. bbc. co. uk/news/technology-18338956
  • Matt Bishop and DavidWagner,"Inside Risks",November 2007/Vol. 50,No. 11 COMMUNICATIONS OF THE ACM
  • http://en. wikipedia. org/wiki Information_privacy,retrieved 28 Feb 2009.
  • http//en. wikipedia. org/wiki/Personally_identifiable_information,retrieved 28 Feb 2009.
  • Google,Inc. User data requests-Google transparency report,Sept. 2013. (http: // www. google. com /transparencyreport/userdatarequests/ retrieved 28 Feb 2009. )
  • "Report of the Defense Science Board Task Force on High Performance Microchip Supply," Defense Science Board, US DoD, Feb. 2005; http://www. acq. osd. mil/dsb/reports/2005-02-HPMS_Report_Final. pdf
  • J. Lieberman, National Security Aspects of the Global Migration of the U. S. Semiconductor Industry, white paper, Airland Subcommittee, US Senate Armed Services Committee,June Applicability of Homomorphic Encryption and CryptDB in Social and Business Applications 15 2003;Referenceshttp:// lieberman. senate. gov / documents/whitepapers/semiconductor. pdf
  • S. Adee, "the Hunt for the Kill Switch,"IEEE Spectrum,vol. 45,no. 5,2008,pp. 34-39.
  • Innovation at RiskIntellectual Property Challenges and Opportunities,white paper, Semiconductor Equipment and Materials International, June 2008.
  • C. Gentry,"A fully homomorphic encryption scheme," PhD thesis, Stanford University, 2009.
  • Josh Benaloh,Dense Probabilistic Encryption,SAC 94, pages 120-128, 1994.
  • S. Goldwasser, S. Micali, Probabilistic Encryption,J. Comp. Sys. Sci. ,28,pp. 270-299,1984.
  • https://hcrypt. com/scarab-library/
  • "Parents: Cyber Bullying Led to Teen's Suicide: Megan Meier's Parents Now Want Measures to Protect Children Online". ABC News 29 November 2007.
  • Halderman,J. A. and Schoen,S. D. and Heninger, N. and Clarkson,W. and Paul,W. and Calandrino, J. A. and Feldman, A. J. and Appelbaum,J. and Felten,E. W. LestWe Remember: Cold Boot Attacks on Encryption Keys Proc. 2008 USENIX Security Symposium
  • AcÄ´siÂÿcmez,O. and Ko. c,C. and Seifert, J. P. Predictingsecret keys via branch prediction Topics in Cryptology- CT-RSA 2007, Springer,2007
  • Craig Gentry and ShaiHalevi,Implementing Gentry's fully-homomorphic encryption scheme,Advances in Cryptology-EUROCRYPT 2011,pp. 129-148,2011
  • D. Naccache, J. Stern. A New Public Key Cryptosystem Based on Higher Residues. Proceedings of the 5th ACM CCS, pages 59-66, 1998.
  • "Social Network Users Statistics," http://www. socialnomics. net/2011/08/16/socialnetwork usersstatistics.
  • http://www. mobilecloudcomputingforum. com
  • P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology - Eurocrypt'99, LNCS vol. 1592, Springer, 1997, pages 223-238.
  • Taesoo Kim1, Marcus Peinado2, Gloria Mainar- Ruiz3:1. MIT CSAIL, 2. Microsoft Research,3. Microsoft Research,STEALTHMEM: System-Level Protection Against Cache-Based Side Channel Attacks in the Cloud.
  • P. Paillier, Trapdooring discrete logarithms on elliptic curves over rings, ASIACRYPT 2000, LNCS 1976,pp. 573-584. 2000.
  • A. Kawachi, K. Tanaka,K. Xagawa. Multi-bit cryptosystems based on lattice problems. PKC '07, pp. 315-329.
  • http://www. verizonenterprise. com/DBIR
  • SalehAlshomrani and ShahzadQamar,"Cloud Based E-Government:Benefits and Challenges", INTERNATIONAL JOURNAL OF MULTIDISCIPLINARY SCIENCES AND ENGINEERING, VOL. 4,NO. 6, JULY 2013.
  • About Zero Day Exploits (http:// netsecurity. about. com/od/newsandeditorial1/a/aazeroday. htm) Netsecurity. about. com. 2010-11-11. Retrieved 2012-01- 08.
  • J. Tudor Web application vulnerability statistics, June 2013. http://www. contextis. com/files/Web_Application_Vulnerability_Statistics_-_June_2013. pdf.
  • D. Borelli. The name Edward Snowden should be sending shivers up CEO spines. Forbes, Sept. 2
  • A. Chen. GCreep: Google engineer stalked teens,spied on chats. Gawker,Sept. 2010. http:gawker. com/5637234/