Corpus ID: 17536448

A New Approach for Algebraically Homomorphic Encryption

@article{Armknecht2008ANA,
  title={A New Approach for Algebraically Homomorphic Encryption},
  author={Frederik Armknecht and A. Sadeghi},
  journal={IACR Cryptol. ePrint Arch.},
  year={2008},
  volume={2008},
  pages={422}
}
  • Frederik Armknecht, A. Sadeghi
  • Published 2008
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • The existence of an efficient and provably secure algebraically homomorphic scheme (AHS), i.e., one that supports both addition and multiplication operations, is a long stated open problem. All proposals so far are either insecure or not provable secure, inefficient, or allow only for one multiplication (and arbitrary additions). As only very limited progress has been made on the existing approaches in the recent years, the question arises whether new methods can lead to more satisfactory… CONTINUE READING
    38 Citations
    Group homomorphic encryption: characterizations, impossibility results, and applications
    • 40
    • PDF
    An RNS variant of fully homomorphic encryption over integers
    Fully homomorphic encryption using ideal lattices
    • C. Gentry
    • Mathematics, Computer Science
    • STOC '09
    • 2009
    • 4,345
    • PDF
    Design and implementation of low-depth pairing-based homomorphic encryption scheme
    • 2
    • PDF
    Additively Homomorphic Encryption with d-Operand Multiplications
    • 79
    • PDF

    References

    SHOWING 1-10 OF 42 REFERENCES
    Multiparty Computation from Threshold Homomorphic Encryption
    • 360
    • PDF
    Additively Homomorphic Encryption with d-Operand Multiplications
    • 79
    • PDF
    Non-interactive cryptocomputing for NC/sup 1/
    • T. Sander, A. Young, M. Yung
    • Computer Science
    • 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
    • 1999
    • 260
    Secure Games with Polynomial Expressions
    • 49
    • PDF
    Evaluating 2-DNF Formulas on Ciphertexts
    • 1,439
    • PDF
    A robust and verifiable cryptographically secure election scheme
    • Josh Benaloh, M. Fischer
    • Computer Science
    • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
    • 1985
    • 466
    • PDF
    Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
    • 30
    • PDF