Jiangsu Teachers University of Technology

Displaying 1-5 of 5 results

  • White Papers // Feb 2012

    Attack on Fully Homomorphic Encryption Over the Integers

    This paper presents a heuristic attack on the fully homomorphic encryption over the integers by using lattice reduction algorithm. The authors' result shows that the FHE in [DGHV10] is not secure for some parameter settings. They also present an improvement scheme to avoid the lattice attack in this paper. Rivest,...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Dec 2011

    Fully Homomorphic Encryption Based on Approximate Matrix GCD

    The authors first introduce Approximate Matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, they define a variant of AMGCD and design a new Fully Homomorphic Encryption scheme (FHE) based on the variant AMGCD, whose security depends on the hardness assumption of the variant AMGCD...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Jun 2011

    Cryptanalysis of the Smart-Vercauteren and Gentry-Halevi's Fully Homomorphic Encryption

    In this paper, the authors first analyze the security of the fully homomorphic encryption schemes based on principal ideal lattice in [SV10, GH11] by using block lattice reduction algorithm. The result implies that their schemes are insecure for lattice dimensions n=2048, and even for n=8192 if they suppose the random...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Mar 2011

    New Fully Homomorphic Encryption Over the Integers

    This paper presents a new fully homomorphic encryption scheme over the integers, which is different from the fully homomorphic encryption scheme in [vDGHV10], but the somewhat homomorphic encryption is similar to that in [vDGHV10]. By using the self-loop bootstrappable technique, a ciphertext is refreshed to a new ciphertext with same...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Mar 2011

    Multiplicative Learning With Errors and Cryptosystems

    The authors introduce a new concept, called Multiplicative Learning With Errors (MLWE), which is a corresponding multiplicative version of the additive Learning With Errors (LWE), and show the equivalence between the decisional version and the search version for MLWE such that p is a product of sufficiently large smoothing prime...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Jun 2011

    Cryptanalysis of the Smart-Vercauteren and Gentry-Halevi's Fully Homomorphic Encryption

    In this paper, the authors first analyze the security of the fully homomorphic encryption schemes based on principal ideal lattice in [SV10, GH11] by using block lattice reduction algorithm. The result implies that their schemes are insecure for lattice dimensions n=2048, and even for n=8192 if they suppose the random...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Mar 2011

    Multiplicative Learning With Errors and Cryptosystems

    The authors introduce a new concept, called Multiplicative Learning With Errors (MLWE), which is a corresponding multiplicative version of the additive Learning With Errors (LWE), and show the equivalence between the decisional version and the search version for MLWE such that p is a product of sufficiently large smoothing prime...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Mar 2011

    New Fully Homomorphic Encryption Over the Integers

    This paper presents a new fully homomorphic encryption scheme over the integers, which is different from the fully homomorphic encryption scheme in [vDGHV10], but the somewhat homomorphic encryption is similar to that in [vDGHV10]. By using the self-loop bootstrappable technique, a ciphertext is refreshed to a new ciphertext with same...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Dec 2011

    Fully Homomorphic Encryption Based on Approximate Matrix GCD

    The authors first introduce Approximate Matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, they define a variant of AMGCD and design a new Fully Homomorphic Encryption scheme (FHE) based on the variant AMGCD, whose security depends on the hardness assumption of the variant AMGCD...

    Provided By Jiangsu Teachers University of Technology

  • White Papers // Feb 2012

    Attack on Fully Homomorphic Encryption Over the Integers

    This paper presents a heuristic attack on the fully homomorphic encryption over the integers by using lattice reduction algorithm. The authors' result shows that the FHE in [DGHV10] is not secure for some parameter settings. They also present an improvement scheme to avoid the lattice attack in this paper. Rivest,...

    Provided By Jiangsu Teachers University of Technology