Journal of Information Processing Systems

  • 제20권4호
  • /
  • Pages.432-441
  • /
  • 2024
  • /
  • 1976-913X(pISSN)
  • /
  • 2092-805X(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

Cloud-based Full Homomorphic Encryption Algorithm by Gene Matching

  • Pingping Li (Institute of Digital Information Technology, Zhejiang Technical Institute of Economics) ;
  • Feng Zhang (Applied Engineering College, Zhejiang Business College)
  • 투고 : 2022.12.21
  • 심사 : 2023.03.11
  • 발행 : 2024.08.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

To improve the security of gene information and the accuracy of matching, this paper designs a homomorphic encryption algorithm for gene matching based on cloud computing environment. Firstly, the gene sequences of cloud files entered by users are collected, which are converted into binary code by binary function, so that the encrypted text is obviously different from the original text. After that, the binary code of genes in the database is compared with the generated code to complete gene matching. Experimental analysis indicates that when the number 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 are 85.69 ms and 237.89 J, respectively.

키워드

과제정보

The research is supported by Basic Public Welfare Research Project of Zhejiang Province - Research on Cooperative Task Allocation Mechanism in Heterogeneous Multi - Mobile Robot System (No. LGG19F020009).

참고문헌

  1. Y. Li, J. H. Park, and B. S. Shin, "A shortest path planning algorithm for cloud computing environment based on multi-access point topology analysis for complex indoor spaces," The Journal of Supercomputing, vol. 73, pp. 2867-2880, 2017. https://doi.org/10.1007/s11227-016-1650-x 
  2. M. B. Karimi, A. Isazadeh, and A. M. Rahmani, "QoS-aware service composition in cloud computing using data mining techniques and genetic algorithm," The Journal of Supercomputing, vol. 73, pp. 1387-1415, 2017. https://doi.org/10.1007/s11227-016-1814-8 
  3. A. Acar, H. Aksu, A. S. Uluagac, and M. Conti, "A survey on homomorphic encryption schemes: theory and implementation," ACM Computing Surveys (CSUR), vol. 51, no. 4, article no. 79, 2018. https://doi.org/10.1145/3214303 
  4. D. Porumbel, "Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation," Mathematical Programming, vol. 155, pp. 147-197, 2016. https://doi.org/10.1007/s10107-014-0840-7 
  5. A. M. Yakubu and Y. P. P. Chen, "Ensuring privacy and security of genomic data and functionalities," Briefings in Bioinformatics, vol. 21, no. 2, pp. 511-526, 2020. https://doi.org/10.1093/bib/bbz013 
  6. A. Mittos, B. Malin, and E. De Cristofaro, "Systematizing genome privacy research: a privacy-enhancing technologies perspective," Proceedings on Privacy Enhancing Technologies, vol. 2019, no. 1, pp. 87-107, 2019. https://doi.org/10.2478/popets-2019-0006 
  7. M. Hosseini, D. Pratas, and A. J. Pinho, "Cryfa: a secure encryption tool for genomic data," Bioinformatics, vol. 35, no. 1, pp. 146-148, 2019. https://doi.org/10.1093/bioinformatics/bty645 
  8. Z. Hu, S. Liu, and K. Chen, "Privacy-preserving location-based services query scheme against quantum attacks," IEEE Transactions on Dependable and Secure Computing, vol. 17, no. 5, pp. 972-983, 2020. https://doi.org/10.1109/TDSC.2018.2831199 
  9. M. N. Sadat, M. M. Al Aziz, N. Mohammed, F. Chen, X. Jiang, and S. Wang, "SAFETY: secure gwAs in federated environment through a hybrid solution," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 16, no. 1, pp. 93-102, 2019. https://doi.org/10.1109/TCBB.2018.2829760 
  10. T. Gao and F. Li, "PHDP: preserving persistent homology in differentially private graph publications," in Proceedings of IEEE INFOCOM 2019-IEEE Conference on Computer Communications, Paris, France, 2019, pp. 2242-2250. https://doi.org/10.1109/INFOCOM.2019.8737584