Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
ATZ-Fachkongress

Chassis.tech plus 2024


4 Kongresse in einer Veranstaltung

Treffen Sie in München die Fachleute von Chassis, Lenkung, Bremsen sowie Reifen/Räder.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2019 | OriginalPaper | Buchkapitel

3. Sorting on Encrypted Data

verfasst von : Ayantika Chatterjee, Khin Mi Mi Aung

Erschienen in: Fully Homomorphic Encryption in Real World Applications

Verlag: Springer Singapore

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Literature Survey
Nächstes Kapitel Translating Algorithms to Handle Fully Homomorphic Encrypted Data
Fußnoten
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).
 
Literatur
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–430MATH
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
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
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
Metadaten
Titel
Sorting on Encrypted Data
verfasst von
Ayantika Chatterjee
Khin Mi Mi Aung
Copyright-Jahr
2019
Verlag
Springer Singapore
Buch
Fully Homomorphic Encryption in Real World Applications

Print ISBN: 978-981-13-6392-4

Electronic ISBN: 978-981-13-6393-1

Copyright-Jahr: 2019

DOI
https://doi.org/10.1007/978-981-13-6393-1_3