Browsing by Author "Rachid, Maan Haj"

Now showing items 1-6 of 6

    • Enclave-based oblivious RAM using Intel's SGX 

      Rachid, Maan Haj; Riley, Ryan; Malluhi, Qutaibah ( Elsevier , 2020 , Article)
      Oblivious RAM (ORAM) schemes exist in order to protect the access pattern of data in a data store. Under an ORAM algorithm, a client accesses a data store in such a way that does not reveal which item it is interested in. ...

    • Implementing and Analyzing a Recursive Technique for Building Path Oblivious RAM 

      Rachid, Maan Haj; Riley, Ryan; Malluhi, Qutaibah ( Hamad bin Khalifa University Press (HBKU Press) , 2018 , Conference)
      It has been demonstrated that encrypting confidential data before storing it is not sufficient because data access patterns can leak significant information about the data itself (Goldreich & Ostrovsky, 1996). Oblivious ...

    • A Practical and Scalable Tool to Find Overlaps between Sequences 

      Rachid, Maan Haj; Malluhi, Qutaibah ( Hindawi , 2015 , Article)
      The evolution of the next generation sequencing technology increases the demand for efficient solutions, in terms of space and time, for several bioinformatics problems. This paper presents a practical and easy-to-implement ...

    • Private Function Evaluation Using Intel's SGX 

      Abou Selo, Omar; Rachid, Maan Haj; Shikfa, Abdullatif; Wang, Yongge; Malluhi, Qutaibah ( John Wiley and Sons Inc , 2020 , Article)
      Private Function Evaluation (PFE) is the problem of evaluating one party's private data using a private function owned by another party. Existing solutions for PFE are based on universal circuits evaluated in secure ...

    • Two Efficient Techniques to Find Approximate Overlaps between Sequences 

      Rachid, Maan Haj (2017 , Article)
      The next-generation sequencing (NGS) technology outputs a huge number of sequences (reads) that require further processing. After applying prefiltering techniques in order to eliminate redundancy and to correct erroneous ...

    • Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem 

      Rachid, Maan Haj; Malluhi, Qutaibah; Abouelhoda, Mohamed ( Hindawi , 2014 , Article)
      The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of ...