Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fully Homomorphic Encryption in Real World ApplicationsSorting on Encrypted Data

Fully Homomorphic Encryption in Real World Applications: Sorting on Encrypted Data [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fully Homomorphic Encryption in Real World ApplicationsSorting on Encrypted Data

Download PDF
24 pages

Loading next page...
 
/lp/springer-journals/fully-homomorphic-encryption-in-real-world-applications-sorting-on-wGv5lwwRYs
Publisher
Springer Singapore
Copyright
© Springer Nature Singapore Pte Ltd. 2019
ISBN
978-981-13-6392-4
Pages
23 –47
DOI
10.1007/978-981-13-6393-1_3
Publisher site
See Chapter on Publisher Site

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.]

Published: Mar 30, 2019

There are no references for this article.