Security and Efficiency analysis of Fully Homomorphic Encryption (FHE) algorithm ZK111

2012/09/17 by Zaryab Khan, Khan, Zaryab
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.1209.3736

this paper has been withdrawn because of an incomplete description of the concept which needs further detailed description

openalex publication_date 2012/09/17 · arxiv created 2012/10/17 · arxiv updated 2012/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This is a summarized follow up of the unconditional security and quadratic time O(n²) efficiency of ZK111.

Related

• Practical Solutions in Fully Homomorphic Encryption -- A Survey Analyzing Existing Acceleration Methods
• The Beginner's Textbook for Fully Homomorphic Encryption
• FHEBench: Benchmarking Fully Homomorphic Encryption Schemes
• Taiyi: A high-performance CKKS accelerator for Practical Fully Homomorphic Encryption
• Attack on Fully Homomorphic Encryption over the Integers