CRSep 17, 2012
Security and Efficiency analysis of Fully Homomorphic Encryption (FHE) algorithm ZK111
arXiv:1209.3736v2
AI Analysis
This work addresses security and performance issues in FHE for cryptography applications, but it appears incremental as a follow-up analysis.
The paper analyzed the security and efficiency of the fully homomorphic encryption algorithm ZK111, finding it to be unconditionally secure but with quadratic time complexity O(n^2).
This is a summarized follow up of the unconditional security and quadratic time O(n^2) efficiency of ZK111.