The aim of this study was to develop algorithm for preserving personal genome information. The challange comes when the user searches for allele linked information whose rights need to be protected.
To counteract such a problem the authors have proposed a technique similar to Burrows–Wheeler transform which is based on homomorphic encryption. They have used a technique called oblivious transform to hide the string query and genomic regions of interest. They have applied this for searching queries of SNPs. They have also given figures regarding the time consumed for carrying out their searches.
The implementation can be seen on the following webpage https://github.com/iskana/PBWT-sec and https://github.com/ratschlab/PBWT-sec