Cloud-based Full Homomorphic Encryption Algorithm by Gene Matching
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
To improve the security of gene information and the accuracy of matching, this paper designs a homomorphicencryption algorithm for gene matching based on cloud computing environment. Firstly, the gene sequences ofcloud files entered by users are collected, which are converted into binary code by binary function, so that theencrypted text is obviously different from the original text. After that, the binary code of genes in the databaseis compared with the generated code to complete gene matching. Experimental analysis indicates that when thenumber of fragments in a 1 GB gene file is 65, the minimum encryption time of the algorithm is 80.13 ms. Aside from that, the gene matching time and energy consumption of this algorithm are the least, which are85.69 ms and 237.89 J, respectively.
Abstract
To improve the security of gene information and the accuracy of matching, this paper designs a homomorphicencryption algorithm for gene matching based on cloud computing environment. Firstly, the gene sequences ofcloud files entered by users are collected, which are converted into binary code by binary function, so that theencrypted text is obviously different from the original text. After that, the binary code of genes in the databaseis compared with the generated code to complete gene matching. Experimental analysis indicates that when thenumber of fragments in a 1 GB gene file is 65, the minimum encryption time of the algorithm is 80.13 ms. Aside from that, the gene matching time and energy consumption of this algorithm are the least, which are85.69 ms and 237.89 J, respectively.
참고문헌 (10)
- Y. Li, "A shortest path planning algorithm for cloud computing environment based on multi-access point topology analysis for complex indoor spaces", The Journal of Supercomputing, 73, pp.2867~2880 (2017)[DOI]
- M. B. Karimi, "QoS-aware service composition in cloud computing using data mining techniques and genetic algorithm", The Journal of Supercomputing, 73, pp.1387~1415 (2017)[DOI]
- A. Acar, "A survey on homomorphic encryption schemes : theory and implementation", ACM Computing Surveys (CSUR), 51(4) (2018)[DOI]
- D. Porumbel, "Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation", Mathematical Programming, 155, pp.147~197 (2016)[DOI]
- A. M. Yakubu, "Ensuring privacy and security of genomic data and functionalities", Briefings in Bioinformatics, 21(2), pp.511~526 (2020)[DOI]
- A. Mittos, "Systematizing genome privacy research : a privacy-enhancing technologies perspective", Proceedings on Privacy Enhancing Technologies, 2019(1), pp.87~107 (2019)[DOI]
- M. Hosseini, "Cryfa : a secure encryption tool for genomic data", Bioinformatics, 35(1), pp.146~148 (2019)[DOI]
- Z. Hu, "Privacy-preserving location-based services query scheme against quantum attacks", IEEE Transactions on Dependable and Secure Computing, 17(5), pp.972~983 (2020)[DOI]
- M. N. Sadat, "SAFETY : secure gwAs in federated environment through a hybrid solution", IEEE, 2019, pp.16(1), 93~102
- T. Gao, "PHDP : preserving persistent homology in differentially private graph publications", Proceedings of IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp.2242~2250 (2019)