Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"oblivious sorting"”.

  1. SAT and CP

    … CP solver. In the final chapter, we discuss Sorting Networks, which are data oblivious sorting algorithms. Their independence of the input data lends them to parallel implementation. We consider the question how many parallel sorting steps are needed to sort some inputs, and present both …

    cau-kiel Repository record for SAT and CP (opens in a new tab)

  2. SAT and CP

    … best here. In the final chapter, we will discuss Sorting networks, which are data oblivious sorting algorithms, i. e., the comparisons they perform do not depend on the input data. Their independence of the input data lends them to parallel implementation. We consider the question how many …

    cau-kiel Repository record for SAT and CP (opens in a new tab)

  3. Privacy-Preserving Communications from Privacy-Preserving Computations

    … we start by establishing the notion of ‘fully oblivious’ algorithms. By definition such algorithms do not leak any information about the underlying private data they operate over via such side channels. We then provide several fully oblivious algorithms for the fundamental and recurring data …

    waterloo Repository record for Privacy-Preserving Communications from Privacy-Preserving Computations (opens in a new tab)