Processing math: 100%
  • 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Hu Yunshu, Zhou Jun, Cao Zhenfu, Dong Xiaolei. Lightweight Multi-User Verifiable Privacy-Preserving Gene Sequence Analysis Scheme[J]. Journal of Computer Research and Development, 2024, 61(10): 2448-2466. DOI: 10.7544/issn1000-1239.202440453
Citation: Hu Yunshu, Zhou Jun, Cao Zhenfu, Dong Xiaolei. Lightweight Multi-User Verifiable Privacy-Preserving Gene Sequence Analysis Scheme[J]. Journal of Computer Research and Development, 2024, 61(10): 2448-2466. DOI: 10.7544/issn1000-1239.202440453

Lightweight Multi-User Verifiable Privacy-Preserving Gene Sequence Analysis Scheme

Funds: This work was supported by the National Natural Science Foundation of China (62172161, 62132005, 62172162).
More Information
  • Author Bio:

    Hu Yunshu: born in 2004. Undergraduate. Her main research interests include fully homomorphic encryption, secure multiparty computation, and verifiable computation

    Zhou Jun: born in 1982. PhD, professor, PhD supervisor. Member of CCF, IEEE, ACM and IACR. His main research interests include public key cryptography, cloud computing security, and privacy-preserving machine learning

    Cao Zhenfu: born in 1962. PhD, professor, PhD supervisor. Senior member of CCF. His main research interests include public key encryption, digital signature, private computation, and post-quantum cryptography

    Dong Xiaolei: born in 1971. PhD, professor, PhD supervisor. Her main research interests include number theory, cryptography, and network security

  • Received Date: June 04, 2024
  • Revised Date: July 16, 2024
  • Available Online: September 13, 2024
  • As the development of the emerging areas of network services such as big data and cloud computing, data element has played an increasingly critical role in the fields of intelligent e-health and scientific research. Gene sequencing technology is widely used in many fields to determine the cause and category of a patient’s disease, by processing the patient’s gene sequence. Due to constrained storage and computing resources, local users often need to rent resource-abundant cloud servers, unfortunately always working in untrusted environments, to fulfill the computationally-intensive task of large-scale gene sequencing function evaluation. To guarantee users’ data privacy and the correctness of computing results, most of the state-of-the-art methods exploit the techniques of public key fully homomorphic encryption and secure multiparty computation to achieve data privacy, and the technique of Yao’s garbled circuit or bilinear paring to achieve correctness verification. Owing to the fact that huge computational overhead and communication overhead are required in the cryptographic primitives mentioned above, they are inappropriate for efficiency needs of the resource-constrained local users in gene sequence analysis. To address this challenging issue, in this paper, a lightweight verifiable privacy-preserving gene sequence analysis scheme in the multi-user setting is proposed. Firstly, we design an efficient verifiable multi-key homomorphic data encapsulation mechanism VMK-HDEM. The proposed VMK-HDEM enables batch outsourced function evaluation on L different input instances over the encrypted domain. The usage time complexity of public key encryption on each user Seni’s end is O(L), independent of the dataset size ni, which significantly decreases the computational cost of local users. For verification, the size of the proof is O(degF) where degF denotes the degree of the function, independent to the size of user’s dataset ni. Furthermore, based on our constructed cryptographic primitive VMK-HDEM, a lightweight and efficient verifiable privacy-preserving gene sequence analysis scheme LWPPGS is proposed. It not only can preserve the privacy of both users’ gene datasets and the results of gene sequence analysis, but also efficiently verify the correctness of the outcome. Finally, formal security proof and experimental simulation results show the security and practicability of our proposed VMK-HDEM and LWPPGS.

  • [1]
    Kantarcioglu M, Jiang W, Liu Y, et al. A cryptographic approach to securely share and uery genomic sequences[C]//Proc of the 2008 IEEE Transactions Information Technol. Piscataway, NJ: IEEE, 2008: 606–617
    [2]
    López-Alt A, Tromer E, Vaikuntanathan V. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption[C]//Proc of the 44th annual ACM Symp on Theory of Computing. New York: ACM, 2012: 1219–1234
    [3]
    Brakerski Z, Vaikuntanathan V. Fully homomorphic encryption from ring-LWE and security for key dependent messages[C]//Advances in Cryptology—CRYPTO 2011(Lecture Notes in Computer Science). Berlin: Springer, 2011: 505–524
    [4]
    Chen H, Dai W, Kim M, et al. Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference[C]//Proc of the 2019 ACM SIGSAC Conf on Computer and Communications Security. New York: ACM, 2019: 395–412
    [5]
    Cheno J H, Kim A, Kim M, et al. Homomorphic encryption for arithmetic of approximate numbers[C]//Advances in Cryptology – ASIACRYPT 2017. Cham: Springer, 2017: 409–437
    [6]
    Coron J S, Lepoint J, Tibouchi M. ScaleInvariant fully homomorphic encryption over the integers[C]//Advances in Cryptology-EUROCRYPT 2010. Berlin: Springer, 2014: 311–328
    [7]
    Cheon J H, Kim J, Lee M S, et al, CRT-based fully homomorphic encryption over the integers[J]. Information Sciences, 2015, 310: 149−162
    [8]
    Micciancio D, Vaikuntanathan V. SoK: Learning with errors, circular security, and fully homomorphic encryption[C]//Proc of Public-Key Cryptography – PKC 2024. Cham: Springer Nature Switzerland, 2024: 291−321
    [9]
    Zhou Jun, Kim-Kwang R C, Cao Zhenfu, et al. PVOPM: Verifiable privacy-preserving pattern matching with efficient outsourcing in the malicious setting[C]//Proc of the 2021 IEEE Transactions Dependable Secure Computing. Piscataway, NJ: IEEE, 2021: 2253−2270
    [10]
    曹珍富,董晓蕾,周俊,等. 大数据安全与隐私保护研究进展[J]. 计算机研究与发展,2016,53(10):2137−2151 doi: 10.7544/issn1000-1239.2016.20160684

    Cao Zhenfu, Dong Xiaolei, Zhou Jun, et al. Research advances on big data security and privacy preserving[J]. Journal of Computer Research and Development, 2016, 53(10): 2137−2151 (in Chinese) doi: 10.7544/issn1000-1239.2016.20160684
    [11]
    Chen Jing, Chen Zhiping, Kuang Linai, et al. Security count query and integrity verification based on encrypted genomic data[C]//Proc of the 9th Int Conf on Computer Engineering and Networks. Berlin: Springer, 2021: 647−654
    [12]
    Hasan M Z, Mahdi M S R, Sadat M N, et al. Secure count query on encrypted genomic data[J]. Journal of Biomedical Informatics, 2018, 81: 41−52 doi: 10.1016/j.jbi.2018.03.003
    [13]
    Choi S G, Katz J, Kumaresan R, et al. Multi-client non-interactive verifiable computation[C]//Proc of Theory of Cryptography. Berlin: Springer, 2013: 499−518
    [14]
    冯帅,邓伦治. 基于身份的隐私保护数据审计方案[J]. 贵州师范大学学报:自然科学版,2023,41(2):105–112

    Feng Shuai, Deng Lunzhi. Identity-based data auditing scheme with privacy protection[J]. Journal of Guizhou Normal University (Natural Sciences), 2023, 41(2): 105–112
    [15]
    Rivest R L, Adleman L, Dertouzos M L. On data banks and privacy homomorphisms[C]. Foundations of Secure Computation, New York: Academia Press, 1978: 169−179
    [16]
    Kwak H, Min S, Song Y. Towards practical multi-key TFHE: Parallelizable, key-compatible, quasi-linear complexity[C]//Proc of Public-Key Cryptography – PKC 2024. Cham: Springer, 2024: 354−385
    [17]
    彭长根,何兴,谭伟杰等. 人工智能算法安全研究现状与对策[J]. 贵州师范大学学报:自然科学版,2022,40(6):1−16

    Peng Changgen, He Xin, Tan Weijie, et al. Research status and countermeasures of artificial intelligence algorithm security[J]. Journal of Guizhou Normal University (Natural Sciences), 2022, 40(6): 1−16
    [18]
    Gentry C. Fully homomorphic encryption using ideal lattices[C]//Proc of the 41st Annual ACM Symp on Theory of Computing. New York: ACM, 2009: 169−178
    [19]
    Dijk M V, Gentry C, Halevi S, et al. Fully homomorphic encryption over the integers[J]. Lecture Notes in Computer Science, 2010, 2009(4): 24−43
    [20]
    Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE[C]//Proc of IEEE 52nd Annual Symp on Foundations of Computer Science (FOCS2011). Piscataway, NJ: IEEE, 2011: 97−106
    [21]
    Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) Fully homomorphic encryption without bootstrapping[C]//Proc of the 3rd Innovations in Theoretical Computer Science Conf (ITCS’12). New York: ACM, 2012: 309–325
    [22]
    Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based[C]//Advances in Cryptology – CRYPTO 2013. Berlin: Springer, 2013: 75−92
    [23]
    Lee Y, Micciancio D, Kim A, et al. Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption[C]//Proc of EUROCRYPT 2023. Berlin: Springer, 2023: 227−256
    [24]
    Liu Fenghao, Wang Han. Batch bootstrapping I: - A new framework for SIMD bootstrapping in polynomial modulus[C]//Proc of EUROCRYPT 2023. Berlin: Springer, 2023: 321−352
    [25]
    Zhou Jun, Cao Zhenfu, Qin Zhan, et al. LPPA: Lightweight privacy-preserving authentication from efficient multi-key secure outsourced computation for location-based services in VANETs[J]. IEEE Transactions on Information Forensics and Security, 2020, 15: 420−434 doi: 10.1109/TIFS.2019.2923156
    [26]
    Gennaro R, Gentry C, Parno B. Non-interactive verifiable computing: Outsourcing computation to untrusted workers[C]//Advances in Cryptology – CRYPTO 2010. Berlin: Springer, 2010: 465−482
    [27]
    Chung K M, Kalai Y, and Vadhan S. Improved delegation of computation using fully homomorphic encryption[C]//Advances in Cryptology – CRYPTO 2010. Berlin: Springer, 2010: 483−501
    [28]
    Parno B, Raykova M, Vaikuntanathan V. How to delegate and verify in public: Verifiable computation from attribute-based encryption[C]//Proc of Theory of Cryptography. Berlin: Springer, 2012: 422–439
    [29]
    Papamanthou C, Shi E, Tamassia R. Signatures of correct computation[C]//Proc of Theory of Cryptography. Berlin: Springer, 2013: 222–242
    [30]
    Choi S G, Katz J, Kumaresan R. et al. Multi-client noninteractive verifiable computation[C]//Proc of Theory of Cryptography. Berlin: Springer, 2013: 499–518
    [31]
    Baum C, Orsini E, Scholl P, et al. Efficient constant-round MPC with identifiable abort and public verifiability[C]//Advances in Cryptology – CRYPTO 2020. Berlin: Springer, 2020: 562−592
    [32]
    Zhang Liangfeng, Wang Huaxiong. Multi-server verifiable computation of low-degree polynomials[C]//Proc of IEEE Symp on Security and Privacy (SP). Piscataway, NJ: IEEE, 2022: 596−613
    [33]
    Chen Xin, Zhang Liangfeng, Publicly Verifiable homomorphic secret sharing for polynomial evaluation[J]. IEEE Transactions on Information Forensics and Security, 2023, 18: 4609−4624
    [34]
    Gordon S D, Katz J, Liu F H, et al. Multi-client verifiable computation with stronger security guarantees[C]//Proc of Theory of Cryptography. Berlin: Springer, 2015: 144–168
    [35]
    Manulis M, Nguyen J. Fully homomorphic encryption beyond IND-CCA1 security: Integrity through verifiability[C]//Advances in Cryptology-EUROCRYPT 2024. Cham: Springer, 2024: 63−93
    [36]
    Jing Liu, Liang Fengzhang. Privay-preserving and publicly verifiable matrix multiplication[J]. IEEE Transaction on Service Computing, 2013, 16(3): 2059−2071
    [37]
    Fiore D, Mitrokotsa A, Nizzardo L, et al. Multikey homomorphic authenticators[C]//Advances in Cryptology – ASIACRYPT 2016. Berlin: Springer, 2016: 499−530
    [38]
    Katz J, Lindell Y. Introduction to Modern Cryptography, Second Edition[M]. Boca Raton FL, USA: CRC Press, 2014
    [39]
    Multiprecision integer and rational arithmetic c/c++ library[OL]. http://www.shamus.ie/
  • Related Articles

    [1]Dong Kai, Wang Lifu, Ling Zhen. Optimizing and Accelerating Privacy Protection Algorithm for Real-Time Location[J]. Journal of Computer Research and Development, 2024, 61(9): 2156-2169. DOI: 10.7544/issn1000-1239.202330877
    [2]Chen Lüjun, Xiao Di, Yu Zhuyang, Huang Hui, Li Min. Communication-Efficient Federated Learning Based on Secret Sharing and Compressed Sensing[J]. Journal of Computer Research and Development, 2022, 59(11): 2395-2407. DOI: 10.7544/issn1000-1239.20220526
    [3]Yan Yunxue, Ma Ming, Jiang Han. An Efficient Privacy Preserving 4PC Machine Learning Scheme Based on Secret Sharing[J]. Journal of Computer Research and Development, 2022, 59(10): 2338-2347. DOI: 10.7544/issn1000-1239.20220514
    [4]Tian Yangtong, Zhang Huang, Xie Shaohao, Zhang Fangguo. Post-Quantum Privacy Preserving Smart Metering System[J]. Journal of Computer Research and Development, 2019, 56(10): 2229-2242. DOI: 10.7544/issn1000-1239.2019.20190402
    [5]Xu Zhiwei, Zhang Yujun. Efficient Detection of False Data Fusion in IoT[J]. Journal of Computer Research and Development, 2018, 55(7): 1488-1497. DOI: 10.7544/issn1000-1239.2018.20180123
    [6]Fu Shuai, Jiang Qi, Ma Jianfeng. A Privacy-Preserving Data Aggregation Scheme in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2016, 53(9): 2030-2038. DOI: 10.7544/issn1000-1239.2016.20150456
    [7]Fu Anmin, Qin Ningyuan, Song Jianye, Su Mang. Privacy-Preserving Public Auditing for Multiple Managers Shared Data in the Cloud[J]. Journal of Computer Research and Development, 2015, 52(10): 2353-2362. DOI: 10.7544/issn1000-1239.2015.20150544
    [8]Dai Hua, Yang Geng, Xiao Fu, Zhou Qiang, He Ruiliang. An Energy-Efficient and Privacy-Preserving Range Query Processing in Two-Tiered Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2015, 52(4): 983-993. DOI: 10.7544/issn1000-1239.2015.20140066
    [9]Ding Youwei, Qin Xiaolin, Liu Liang, Wang Taochun. An Energy Efficient Algorithm for Big Data Processing in Heterogeneous Cluster[J]. Journal of Computer Research and Development, 2015, 52(2): 377-390. DOI: 10.7544/issn1000-1239.2015.20140126
    [10]Chen Wei, Xu Ruomei, Li Yuling. A Privacy-Preserving Integrity-Verification-Based Top-k Query Processing[J]. Journal of Computer Research and Development, 2014, 51(12): 2585-2592. DOI: 10.7544/issn1000-1239.2014.20140666
  • Cited by

    Periodical cited type(1)

    1. 苏璞睿,冯登国. 2024年网络空间安全科技热点回眸. 科技导报. 2025(01): 102-117 .

    Other cited types(0)

Catalog

    Article views (212) PDF downloads (61) Cited by(1)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return