Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 24 / Issue 4

available in:   PDF (914 kB) PS (2 MB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-024-04-0488


Parallel Fast Sort Algorithm for Secure Multiparty Computation

Zbigniew Marszałek (Silesian University of Technology, Poland)

Abstract: The use of encryption methods such as secure multiparty computation is an important issue in applications. Applications that use encryption of information require special algorithms of sorting data in order to preserve the secrecy of the information. This proposition is composed for parallel architectures. Presented algorithm works with a number of logical processors. Operations are flexibly distributed among them. Therefore sorting of data sets takes less time. Results of the experimental tests confirm the effectiveness of the proposed flexible division of tasks between logical processors and show that this proposition is a valuable method that can find many practical applications in high performance computing.

Keywords: algorithm design and analysis, data mining, parallel algorithm, privacy, secure multi-party computation

Categories: E.1, E.4, F.2