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} }
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
Topics from this paper
38 Citations
Group homomorphic encryption: characterizations, impossibility results, and applications
- Mathematics, Computer Science
- Des. Codes Cryptogr.
- 2013
- 40
- PDF
Design and implementation of low-depth pairing-based homomorphic encryption scheme
- Computer Science
- Journal of Cryptographic Engineering
- 2018
- 2
- PDF
How to Combine Homomorphic Encryption and Garbled Circuits - Improved Circuits and Computing the Minimum Distance Efficiently
- Mathematics
- 2009
- 24
- PDF
Additively Homomorphic Encryption with d-Operand Multiplications
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2008
- 79
- PDF
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design
- Computer Science
- J. Comput. Secur.
- 2013
- 37
- PDF
References
SHOWING 1-10 OF 42 REFERENCES
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
- Computer Science
- Public Key Cryptography
- 2001
- 956
- PDF
Additively Homomorphic Encryption with d-Operand Multiplications
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2008
- 79
- PDF
Non-interactive cryptocomputing for NC/sup 1/
- Computer Science
- 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- 1999
- 260
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)
- Computer Science
- CRYPTO
- 1996
- 192
A robust and verifiable cryptographically secure election scheme
- 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
- Computer Science
- IEEE Transactions on Information Theory
- 2008
- 30
- PDF