Corpus ID: 55921287

Experiments on the Gentry-Halevi somewhat homomorphic scheme

@inproceedings{Mikus2011ExperimentsOT,
  title={Experiments on the Gentry-Halevi somewhat homomorphic scheme},
  author={M. Mikus},
  year={2011}
}
  • M. Mikus
  • Published 2011
  • We have implemented the somewhat homomorphic scheme from [16]. We examined this scheme in the same way as mentioned in [16] and extend the results for a wider set of parameters and also increased the number of repetitions for each test. We focused on the dependencies between the largest supported degree and various parameters of the cryptosystem, specially also the encryption parameter q. We show that the probability q significantly influences the overall effectiveness of the scheme and that… CONTINUE READING

    Figures and Tables from this paper

    References

    SHOWING 1-10 OF 37 REFERENCES
    Fully Homomorphic Encryption over the Integers
    • 1,492
    • PDF
    Additively Homomorphic Encryption with d-Operand Multiplications
    • 79
    • PDF
    Implementing Gentry's Fully-Homomorphic Encryption Scheme
    • 834
    • Highly Influential
    • PDF
    Improving Lattice Based Cryptosystems Using the Hermite Normal Form
    • 167
    New Fully Homomorphic Encryption over the Integers
    • Chunsheng Gu
    • Computer Science, Mathematics
    • IACR Cryptol. ePrint Arch.
    • 2011
    • 9
    • PDF
    Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
    • 735
    • PDF
    Fully homomorphic encryption using ideal lattices
    • C. Gentry
    • Mathematics, Computer Science
    • STOC '09
    • 2009
    • 4,348
    • PDF
    Sharing Decryption in the Context of Voting or Lotteries
    • 318
    • PDF
    The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence
    • M. Ajtai, C. Dwork
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2007
    • 18
    Verifiable Homomorphic Oblivious Transfer and Private Equality Test
    • 115
    • PDF