Sorting on Encrypted Data

  • Ayantika ChatterjeeEmail author
  • Khin Mi Mi Aung
Part of the Computer Architecture and Design Methodologies book series (CADM)


Sorting is an age old problem of rearrangement. Since arrangement of items has profound influence on speed and simplicity of algorithms, sorting has attracted great deal of importance in computer science literature. Recently with the advent of cloud computing we revisit problem of sorting on encrypted data. Sorting network consists of comparators and swapping operations. The difference between classical comparison-based sorting algorithms and sorting networks on encrypted inputs are discussed in this chapter. The interesting fact for encrypted domain is that all operations must be data independent in the flow of the algorithm steps in sorting networks. Hence, in spite of the fact that data dependent algorithms may be faster, they may not suitable for encrypted data.


  1. Akin IH, Sunar B (2015) On the difficulty of securing web applications using CryptDB. IACR cryptology ePrint archive, vol 2015, p 82Google Scholar
  2. Baldimtsi F, Ohrimenko O (2015) Sorting and searching behind the curtain. In: Financial cryptography and data security - 19th international conference, FC 2015, San Juan, Puerto Rico, 26–30 January 2015, Revised selected papers, pp 127–146Google Scholar
  3. Bogdanov D, Laur S, Talviste R (2014) A practical analysis of oblivious sorting algorithms for secure multi-party computation. In: Bernsmed K, Fischer-Hübner S (eds) Secure IT systems. NordSec 2014. Lecture notes in computer science, vol 8788. SpringerGoogle Scholar
  4. Çetin GS, Doröz Y, Sunar B, Savaş E (2015) Low depth circuits for efficient homomorphic sorting. Cryptology ePrint Archive, Report 2015/274Google Scholar
  5. Chatterjee A, Kaushal M, SenGupta I (2013) Accelerating sorting of fully homomorphic encrypted data. INDOCRYPT 262–273Google Scholar
  6. Chatterjee A, SenGupta I (2015) Windowing technique for lazy sorting of encrypted data. In: 2015 IEEE conference on communications and network security (CNS), pp 633–637Google Scholar
  7. Chatterjee A, SenGupta I (2017) Sorting of fully homomorphic encrypted cloud data: can partitioning be effective? IEEE Trans Serv ComputGoogle Scholar
  8. Chatterjee A, SenGupta I (2018) Translating algorithms to handle fully homomorphic encrypted data on the cloud. IEEE Trans Cloud Comput 287–300Google Scholar
  9. Damgård I, Geisler M, Krøigaard M (2007) Efficient and secure comparison for on-line auctions. Springer, Berlin, pp 416–430zbMATHGoogle Scholar
  10. Emmadi N, Gauravaram P, Narumanchi H, Syed H (2015) Updates on sorting of fully homomorphic encrypted data. IACR cryptology ePrint archive, vol 2015, p 995Google Scholar
  11. Fischlin M (2001) A cost-effective pay-per-multiplication comparison method for millionairesGoogle Scholar
  12. Goldwasser S, Micali S (1982) Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proceedings of the Fourteenth annual ACM symposium on theory of computing, STOC ’82, pp 365–377. ACM, New York .
  13. Katz J, Lindell Y (2007) Introduction to modern cryptography (Chapman & Hall/CRC Cryptography and network security series). Chapman & Hall/CRCGoogle Scholar
  14. Knuth DE (1998) The art of computer programming, vol 3, 2nd edn. Sorting and searching. Addison Wesley Longman Publishing Co., Inc, Redwood City, CA, USAGoogle Scholar
  15. Liu D, Bertino E, Yi X (2014) Privacy of outsourced k-means clustering. In: A 9th ACM symposium on information, computer and communications security, ASIA CCS ’14, Kyoto, Japan - June 03 -06 2014, pp 123–134Google Scholar
  16. Naehrig M, Lauter K, Vaikuntanathan V, Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM workshop on cloud computing security workshop, ser. CCSW ’11. New York, NY, USA: ACM, pp 113–124Google Scholar
  17. Popa RA, Redfield Catherine MS, Zeldovich N, Balakrishnan H (2011) CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the 23rd ACM symposium on operating systems principles (SOSP), Cascais, PortugalGoogle Scholar
  18. Sander T, Young A, Yung M (1999) Non-interactive cryptocomputing for nc1. In: 40th annual symposium on foundations of computer science, pp 554–566Google Scholar
  19. Stinson D (2002) Cryptography: theory and practice, second edition : section 5.9.1, 2nd edn. CRC/C&HGoogle Scholar
  20. Vaidya J, Clifton C (2003) Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’03, pp 206–215. ACM, New York.
  21. Wikipedia, Sorting network (2018) [Online. accessed 22-July-2018].
  22. Yao AC (1982) Protocols for secure computations. In: Proceedings of the 23rd annual symposium on foundations of computer science, SFCS ’82, pp 160–164. IEEE Computer Society, Washington, DC.
  23. Zhou H, Wornell GW (2014) Efficient homomorphic encryption on integer vectors and its applications. In: 2014 Information theory and applications workshop, ITA 2014, San Diego, CA, USA, 9–14 February 2014, pp 1–9Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Indian Institute of Technology KharagpurKharagpurIndia
  2. 2.Institute for Infocomm ResearchA*STARSingaporeSingapore

Personalised recommendations