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 10 of 10 for “"Oblivious algorithms"”.

  1. Efficient Data-Oblivious Computation

    … data is encrypted — can leak secret information. Oblivious RAM is a well studied cryptographic primitive that can be used to solve the underlying challenge of hiding data-access patterns. In this dissertation, we improve Oblivious RAMs and oblivious algorithms asymptotically. We then show how to …

    maryland Repository record for Efficient Data-Oblivious Computation (opens in a new tab)

  2. 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)

  3. Algorithms and data structures for cache-efficient computation: theory and experimental evaluation

    … modern computers which facilitates the design of algorithms that can use the caches (i.e., memory levels) in the hierarchy efficiently without using the knowledge of cache parameters. In addition to possibly running faster than traditional flat-memory algorithms due to reduced cache-misses, these …

    texas Repository record for Algorithms and data structures for cache-efficient computation: theory and experimental evaluation (opens in a new tab)

  4. Parallel Oblivious Joins using Radix Partitioning

    We present parallel doubly oblivious algorithms for both non-foreign key and foreign key joins using an oblivious radix partitioning technique. Oblivious query processing enables secure execution over encrypted data when organizations outsource data to the cloud. When the cloud server processes …

    waterloo Repository record for Parallel Oblivious Joins using Radix Partitioning (opens in a new tab)

  5. Work-Stealing Scheduler for Parallel Cache-Adaptive Algorithms

    … Model (DAM) and advancements such as cache-oblivious algorithms have focused on minimizing memory transfers without requiring explicit knowledge of memory hierarchy parameters. However, these approaches assume fixed memory sizes and exclusive cache access, limiting their applicability in …

    wustl Repository record for Work-Stealing Scheduler for Parallel Cache-Adaptive Algorithms (opens in a new tab)

  6. Cache-Oblivious Searching and Sorting in Multisets

    … searching and sorting in multisets in the cache-oblivious model: Finding the most frequent element (the mode), duplicate elimination and finally multi-sorting. We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context under …

    waterloo Repository record for Cache-Oblivious Searching and Sorting in Multisets (opens in a new tab)

  7. Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing

    … studies the computational resources needed by algorithms to correctly solve computational problems. In this thesis, we derive lower bounds on the computational complexity of different problems for different classes of algorithms. The computational resources we consider are the running time, the …

    washington Repository record for Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing (opens in a new tab)

  8. Data Sharing-Aware Task Allocation Algorithms In Edge Computing Systems

    … Allocation (ODSTA) problem and design online algorithms for task allocation in edge computing that take into account the sharing of data among the tasks offloaded to the same server. We perform an extensive performance analysis by comparing our proposed data sharing-aware online algorithms …

    wayne-thes Repository record for Data Sharing-Aware Task Allocation Algorithms In Edge Computing Systems (opens in a new tab)

  9. Efficient Oblivious Database Joins

    … execution is ensuring that their execution is oblivious to their inputs, in the sense that their memory access patterns do not leak sensitive information to the server. This problem is particularly relevant to cloud databases that wish to allow queries over the client’s encrypted data. One of …

    waterloo Repository record for Efficient Oblivious Database Joins (opens in a new tab)