Zheng Wang, Yong Ding, Xinguo Li, et al. A Method to Attack the FHE Schemes Based on the Hardness of PACDP[J]. Telecommunications science, 2013, 29(3): 85-89.
DOI:
Zheng Wang, Yong Ding, Xinguo Li, et al. A Method to Attack the FHE Schemes Based on the Hardness of PACDP[J]. Telecommunications science, 2013, 29(3): 85-89. DOI: 10.3969/j.issn.1000-0801.2013.03.016.
A Method to Attack the FHE Schemes Based on the Hardness of PACDP
the security of the FHE schemes based on the hardness of a partia11y approximate integer common divisor prob1em(PACDP)was discussed.By dividing the interva1 of the noise of the pub1ic key
using the fast po1ynomia1 mu1tipoint eva1uation and GCD a1gorithm to get the secret key
the FHE schemes based on the hardness of PACDP were successfu11y crashed down.
关键词
Keywords
references
Rona1d L R , Len A , Michael L D , . On data banks and privacy homomorphisms . Foundations of Secure Computation , New York , 1978 , 9 : 169 ~ 180 .
Gentry Craig . A fully homomorphic encryption scheme . PhD Thesis,Stanford University . http://crypto.stanford.edu/craig,2009 http://crypto.stanford.edu/craig,2009
Van Dijk Marten , Gentry Craig , Ha1evi Shai , et al . Fully homomorphic encryption over the integers . EUROCRYPT 2010, LNCS , 2010 24 ~ 43 .
Jean-Sebastien C , Avradip M , David N , et al . Fully homomorphic encryption over the integers with shorter public keys . P Rogaway(Ed), CRYPTO 2011 , LNCS, Springer , 2011 : 487 ~ 504 .
Jean-Sebastien C , David N , Mehdi T , . Pub1ic Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers . Cryptology ePrint Archive Report , 2011
Chen Y M , Nguyen P Q . Faster A1gorithms for Approximate Common Divisors:Breaking Fully-Homomorphic-Encryption Challenges over the Integers . Cryptology ePrint Archive Report , 2011
Howgrave-Graham Nick . Approximate integer divisors . CaLC'01, Lecture Notes in Computer Science, Springer , 2001 : 51 ~ 66