• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Li Zengpeng, Ma Chunguang, Zhao Minghao. Leveled Fully Homomorphic Encryption Against Adaptive Key Recovery Attacks[J]. Journal of Computer Research and Development, 2019, 56(3): 496-507. DOI: 10.7544/issn1000-1239.2019.20170443
Citation: Li Zengpeng, Ma Chunguang, Zhao Minghao. Leveled Fully Homomorphic Encryption Against Adaptive Key Recovery Attacks[J]. Journal of Computer Research and Development, 2019, 56(3): 496-507. DOI: 10.7544/issn1000-1239.2019.20170443

Leveled Fully Homomorphic Encryption Against Adaptive Key Recovery Attacks

More Information
  • Published Date: February 28, 2019
  • A major open problem is to protect leveled homomorphic encryption from adaptive attacks that allow an adversary to learn the private key. In order to achieve the goal of preventing key recovery attacks on fully homomorphic encryption (FHE), Li Zengpeng et al (PROVSEC’16) proposed an multiple secret keys fully homomorphic encryption scheme under the learning with errors (LWE) assumption to prevent key recovery attacks on FHE, which did not use the notion of “valid ciphertexts” of Loftus et al (SAC’11). However, utilizing the information of noise, the attacks can still recover the information of the secret key. Li Zengpeng et al.’s scheme cannot provide an efficient method to protect the secret key. In this paper, Inspired by the work of Li Zengpeng et al (EPRINT’16), we first give a new method of key recovery attacks to Li Zengpeng et al.’s scheme; then, we propose a new FHE scheme with multiple secret keys which differs from EPRINT’16, and prove our new scheme against key recovery attacks. Our main idea is to adopt the dual version of encryption algorithm and generate a “one-time” secret key every time, so that even if an attacker can learn some bits of the one-time private key from each decryption query and cannot obtain some bits of noise, the scheme still does not allow them to compute a valid private key.
  • Related Articles

    [1]Fu Liguo, Pang Jianmin, Wang Jun, Zhang Jiahao, Yue Feng. Formal Model of Correctness and Optimization on Binary Translation[J]. Journal of Computer Research and Development, 2019, 56(9): 2001-2011. DOI: 10.7544/issn1000-1239.2019.20180513
    [2]Zhou Zhibin, Wang Guojun, Liu Qin, Jia Weijia. A RFID Anonymous Grouping Proof Protocol Using Dual-Layer Verification[J]. Journal of Computer Research and Development, 2018, 55(12): 2674-2684. DOI: 10.7544/issn1000-1239.2018.20170787
    [3]Fu Yanyan, Zhang Min, Chen Kaiqu, Feng Dengguo. Proofs of Data Possession of Multiple Copies[J]. Journal of Computer Research and Development, 2014, 51(7): 1410-1416.
    [4]Li Tao, Zhang Jingzhong. Machine Proofs in Geometry Based on Complex Number Method[J]. Journal of Computer Research and Development, 2013, 50(9): 1963-1969.
    [5]Ma Yanfang, Zhang Min, Chen Yixiang. Formal Description of Software Dynamic Correctness[J]. Journal of Computer Research and Development, 2013, 50(3): 626-635.
    [6]Wang Yong, Fang Juan, Ren Xingtian, and Lin Li. Formal Verification of TCG Remote Attestation Protocols Based on Process Algebra[J]. Journal of Computer Research and Development, 2013, 50(2): 325-331.
    [7]Wang Changjing. Verifying the Correctness of Loop Optimization Based on Extended Logic Transformation System μTS[J]. Journal of Computer Research and Development, 2012, 49(9): 1863-1873.
    [8]Jing Shuxu, He Fazhi, Cai Xiantao, Cheng Yuan. A Method for Object Reference in Collaborative Modeling System[J]. Journal of Computer Research and Development, 2011, 48(11): 2031-2038.
    [9]Si Tiange, Tan Zhiyong, and Dai Yiqi. A Security Proof Method for Multilevel Security Models[J]. Journal of Computer Research and Development, 2008, 45(10): 1711-1717.
    [10]Wang Guilin, Qing Sihan. Security Notes on Two Cheat-Proof Secret Sharing Schemes[J]. Journal of Computer Research and Development, 2005, 42(11): 1924-1927.

Catalog

    Article views (1181) PDF downloads (308) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return