Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In computer science, comparator networks are abstract devices built up of a fixed number of “wires”, carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks (Sorting Network 2018).
References
Akin IH, Sunar B (2015) On the difficulty of securing web applications using CryptDB. IACR cryptology ePrint archive, vol 2015, p 82
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–146
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. Springer
Çetin GS, Doröz Y, Sunar B, Savaş E (2015) Low depth circuits for efficient homomorphic sorting. Cryptology ePrint Archive, Report 2015/274
Chatterjee A, Kaushal M, SenGupta I (2013) Accelerating sorting of fully homomorphic encrypted data. INDOCRYPT 262–273
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–637
Chatterjee A, SenGupta I (2017) Sorting of fully homomorphic encrypted cloud data: can partitioning be effective? IEEE Trans Serv Comput
Chatterjee A, SenGupta I (2018) Translating algorithms to handle fully homomorphic encrypted data on the cloud. IEEE Trans Cloud Comput 287–300
Damgård I, Geisler M, Krøigaard M (2007) Efficient and secure comparison for on-line auctions. Springer, Berlin, pp 416–430
Emmadi N, Gauravaram P, Narumanchi H, Syed H (2015) Updates on sorting of fully homomorphic encrypted data. IACR cryptology ePrint archive, vol 2015, p 995
Fischlin M (2001) A cost-effective pay-per-multiplication comparison method for millionaires
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 . http://doi.acm.org/10.1145/800070.802212
Katz J, Lindell Y (2007) Introduction to modern cryptography (Chapman & Hall/CRC Cryptography and network security series). Chapman & Hall/CRC
Knuth DE (1998) The art of computer programming, vol 3, 2nd edn. Sorting and searching. Addison Wesley Longman Publishing Co., Inc, Redwood City, CA, USA
Library libScarab (2011). https://github.com/hcrypt-project/libscarab
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–134
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–124
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, Portugal
Sander T, Young A, Yung M (1999) Non-interactive cryptocomputing for nc1. In: 40th annual symposium on foundations of computer science, pp 554–566
Stinson D (2002) Cryptography: theory and practice, second edition : section 5.9.1, 2nd edn. CRC/C&H
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. http://doi.acm.org/10.1145/956750.956776
Wikipedia, Sorting network (2018) [Online. accessed 22-July-2018]. https://en.wikipedia.org/wiki/Sorting_network
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. http://dx.doi.org/10.1109/SFCS.1982.88
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–9
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Chatterjee, A., Aung, K.M.M. (2019). Sorting on Encrypted Data. In: Fully Homomorphic Encryption in Real World Applications. Computer Architecture and Design Methodologies. Springer, Singapore. https://doi.org/10.1007/978-981-13-6393-1_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-6393-1_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-6392-4
Online ISBN: 978-981-13-6393-1
eBook Packages: EngineeringEngineering (R0)