<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Victor Bungey on Medium]]></title>
        <description><![CDATA[Stories by Victor Bungey on Medium]]></description>
        <link>https://medium.com/@vicbungey?source=rss-245debd895c1------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*YDxjFhhhwrcdwVuo.jpg</url>
            <title>Stories by Victor Bungey on Medium</title>
            <link>https://medium.com/@vicbungey?source=rss-245debd895c1------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 15:49:55 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@vicbungey/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Fully Homomorphic Encyption]]></title>
            <link>https://medium.com/@vicbungey/fully-homomorphic-encyption-157c8886fbfe?source=rss-245debd895c1------2</link>
            <guid isPermaLink="false">https://medium.com/p/157c8886fbfe</guid>
            <category><![CDATA[cybersecurity]]></category>
            <category><![CDATA[homomorphic-encryption]]></category>
            <category><![CDATA[cloud-security]]></category>
            <category><![CDATA[applied-cryptography]]></category>
            <category><![CDATA[cloud-computing]]></category>
            <dc:creator><![CDATA[Victor Bungey]]></dc:creator>
            <pubDate>Thu, 09 Jul 2026 04:49:43 GMT</pubDate>
            <atom:updated>2026-07-09T04:49:43.914Z</atom:updated>
            <content:encoded><![CDATA[<h3>Introduction</h3><p>The widespread adoption of digital data and the rise of cloud computing have created a powerful contradiction: while organizations and individuals increasingly rely on third-party platforms for storage and processing, the need for data privacy and security remains paramount. Traditional encryption methods, such as AES or RSA, effectively protect data <em>at rest</em> and <em>in transit</em> by scrambling it, but require decryption before any computation can be performed. This necessity tends to expose data in plaintext to the server which creates a significant security vulnerability which is open to manipulation or data exfiltration in the event of interception by adversaries, fundamentally limiting the utility of privacy-sensitive data in outsourced environments like the cloud.</p><p>To resolve this conflict, Fully Homomorphic Encryption (FHE) was introduced, an innovative cryptographic method that allows arbitrary computations to be performed directly on ciphertexts without ever needing to decrypt or reveal it. This capability ensures the confidentiality of data throughout its entire lifecycle, particularly when being processed in untrusted environments like public clouds. Currently, it has been demonstrated by many existing schemes that the theory is feasible but its efficiency needs to be improved in order to make it usable for real applications.</p><h3>Background</h3><p>Traditional encryption methods, both symmetric and asymmetric protect data when it is at rest or when is being transmitted (“in transit”), but for any processing on data the ciphertext needs to be decrypted, which creates a vulnerable window for potential breaches. The concept of Fully Homomorphic Encryption was first proposed by Rivest, Adleman, and Dertouzos in 1978, but a viable scheme remained an open problem for decades until the revolutionary work of Gentry in 2009. In his thesis, Gentry proposed the first adequate fully homomorphic encryption scheme by exploiting properties of ideal lattices.</p><p>Gentry’s construction is based on his bootstrapping theorem which provides that given a somewhat homomorphic encryption scheme (SWHE) that can evaluate homomorphically its own decryption circuit and an additional NAND gate, we can pass to a “levelled” fully homomorphic encryption scheme and so obtain a FHE scheme by assuming circular security. The purpose of using bootstrapping technique is to allow refreshment of ciphertexts and reduce noise after its growth.</p><p>Gentry’s construction is not a single algorithm but it is considered as a framework on which to build new fully homomorphic encryption schemes such as:</p><ul><li>Noise-based fully homomorphic encryption schemes which is robust and more secure, but has a drawback of not being efficient in terms of runtime and ciphertext size.</li><li>Free-noise fully homomorphic encryption schemes which do not need a technique of noise management to refresh ciphertexts, they also allow one to do infinity of operations on the same ciphertext without noise growing, it is known as faster than the previous one, involves simple operations to evaluate circuits on ciphertexts and do not require a noise management technique, but it suffers from security problems because the majority of designed schemes are cryptanalyzed today.</li><li>Verifiable fully homomorphic encryption scheme (VFHE), a smart scheme that we can use to outsource complex computations on sensible data to a remote cloud server. It allows the client to verify the correctness of its delegated computations.</li></ul><h3>Methodology</h3><p>Fully Homomorphic Encryption operates on the mathematical principle of a homomorphism, a mapping between two structures that preserves their operations.</p><p>In FHE, this means:</p><p>Dec(Enc(𝑎)⊕Enc(𝑏))=𝑎+𝑏</p><p>Dec(Enc(𝑎)⊗Enc(𝑏))=𝑎×𝑏</p><p>The core process involves several steps within a client-server model:</p><p><strong><em>Key Generation:</em> </strong>A user (client) generates a public/private key pair. The public encryption key and an evaluation key are sent to the third-party server, while the private decryption key is kept securely by the user(client).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/293/1*Vnd63a9UvgCKguExfKWyZg.png" /></figure><p>The algorithm takes an unary representation of the security parameter and outputs a public encryption of the security parameter and outputs a public encryption key <em>pk</em>, a secret decryption key sk and a public evaluation key <em>evk</em> if the concrete FHE need this key.</p><p><strong><em>Encryption:</em></strong> The client encrypts their sensitive data using the public key and sends the resulting ciphertexts to the server.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/203/1*UKCaFekRJJj5NbSsZtgbQg.png" /></figure><p>The algorithm takes a message <em>m</em> and the public key <em>pk</em> to output a ciphertext</p><p><strong><em>Homomorphic Operation:</em></strong> The server performs computations (any arbitrary function represented as an arithmetic or Boolean circuit) directly on the ciphertexts using the evaluation key, without ever needing to decrypt the underlying data. The operations add a small amount of “noise” to the ciphertext.</p><p><strong><em>Bootstrapping (Noise Management):</em></strong> To prevent the accumulation of noise from corrupting the data after too many operations, modern FHE schemes use bootstrapping. This process homomorphically evaluates the decryption circuit on the noisy ciphertext to “refresh” it and reduce the noise level, enabling further computations.</p><p><strong><em>Decryption:</em></strong> The server sends the encrypted result back to the client, who is the only party with the private key required to decrypt the final result into plaintext.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/261/1*DeKcXjOzC3HUXUfXe9joSg.png" /></figure><p>The client uses this algorithm that takes a ciphertext <em>c</em> and a secret key <em>sk</em> to output a message <em>m</em></p><p>Fully homomorphic encryption allows for data processing in an untrusted environment like in the public cloud without exposing sensitive, underlying information. Applying the above steps in an actual case study regarding the processing of data to the client from cloud, we highlight how the steps above can be used to ensure data is kept confidential with its integrity intact.</p><ul><li>Data of various organizations and individuals is sent after encryption done with the key to respective recipient is sent into the cloud</li><li>Businesses collect data from the field, encrypt it with their private keys and then send it to the server on cloud for processing</li><li>Cloud server stores the encrypted data obtained from the clients but has no access to the available data, operations such as computations can be performed on this encrypted data results obtained and the server has no idea on the actual contents of the data on which these operations are being done on.</li><li>Whenever the client requests data processing the server on cloud sends the encrypted results from the operations performed on the data to the recipients.</li><li>The clients then decrypt the encrypted result obtained from the cloud servers using their private key</li></ul><p>This shows that indeed FHE enforces sensitive data sharing among individual users or businesses</p><p>Some of the benefits that we get from using FHE include:</p><ul><li>One of the main advantages is that the data is always present in its encrypted form throughout the process, meaning data maintains its confidentiality at all times.</li><li>Fully Homomorphic Encryption permits both multiplication or addition operations on encrypted data which was initially impossible</li><li>As FHE protect data from leakage even highly sensitive data and operations related to sensitive data can also be performed over external party</li><li>FHE draws a line between the data usability, data accessibility and data security. The cloud server has accessibility and it can perform computations on the encrypted data while the client has the key(security) and is the only one who can decrypt the data back to plaintext using its secret private key</li><li>FHE is an application level cryptographic solution solution which runs on top of standard cloud compute and storage services and therefore there is no need to change any features of cloud for data privacy.</li></ul><h3>Challenges</h3><p>Despite its potential, the widespread adoption of FHE has been faced with challenges</p><ul><li>Performance Overhead: The primary challenge is the significant computational cost. FHE operations can be orders of magnitude slower than plaintext computations, making it impractical for many real-time, high-throughput applications.</li><li>While some kind of homomorphic operations were being done unknowingly, we may add some additional noise to the encrypted data. So, when this noise exceeds a limit, it becomes difficult to decrypt the encrypted text.</li><li>It requires a large scale of memory for the computations that it makes as compared to the memory it takes when plaintext operations are performed. This issue of large memory usage makes it seem impractical to handle various queries</li><li>Implementing FHE is complex which can be demanding and requires specialized cryptographic knowledge. The lack of user-friendly tools and libraries has been a barrier to general developers, though this is improving with community efforts and advanced libraries like Microsoft SEAL or HElib.</li><li>Ciphertext Expansion: Encrypted data in FHE schemes can be significantly larger than the original plaintext which leads to increased storage and bandwidth requirements.</li><li>Security Assumptions: Some aspects, such as the “circular security” assumption required for bootstrapping, remain active areas of research, though no practical attacks have been discovered yet.</li><li>FHE ensures the server cannot see the data, but it doesn’t automatically guarantee that the server performed the <em>correct</em> function. Proving computational correctness without revealing the data or proprietary functions presents a trade-off.</li></ul><h3>Applications in Fully Homomorphic Encryption</h3><p>With the rapid advancement of information technology and the widespread adoption of cloud computing across various industries, data security and privacy have emerged as the key concern in an ever changing threat landscape with adversaries always looking to identify gaps and exploit these two properties leading to losses in the event of a breach. FHE has garnered significant research and application interest due to its unique capability to perform arbitrary computations directly on encrypted data. This has unlocked numerous applications across sensitive industries which include:</p><ul><li><em>Use of FHE Blockchain </em><br>In blockchain technology, the execution of smart contracts typically requires the disclosure of all input parameters to allow other nodes in the network to verify the correctness of the contract execution, a process which fails to protect the privacy of the contract caller, especially in scenarios involving sensitive information, such as electronic voting, multi-party auctions, and healthcare contracts, where data providers may hesitate to submit their information. By applying the Fully homomorphic encryption to the workflow, data is encrypted using FHE algorithm libraries before being uploaded to the blockchain, and the encrypted data is then stored on the blockchain. <br>Smart contracts then process the data in its encrypted form through homomorphic operations, which ensures that the results of the contract execution remain encrypted. The encrypted results are then returned to the business layer and decrypted using the FHE algorithm library. This safeguards the privacy of contract information and the security of the data. This method not only protects data privacy but also expands the application scope of blockchain smart contracts, enabling them to function effectively in more scenarios that require privacy protection</li><li><em>Secure Cloud Computing</em><br>While cloud is being used for various purposes there has been a threat to the data stored over cloud as it is mostly managed by third parties rather than the owners themselves. There is always a chance for the adversary to get access this information. The introduction of FHE solves the issue on data security concerns minimizing the chances of the attacker ever getting a chance of accessing information by ensuring that data is encrypted at all times specifically while in transit and during processing as it allows us to perform operations on the encrypted data without needing to decrypt it. This enables users to safely outsource computation on their sensitive data to untrusted cloud providers, protecting information from insider threats or breaches.</li><li><em>Artificial Intelligence</em><br>FHE addresses the challenge of “data silos” in machine learning. Multiple parties can collaboratively train and optimize models on their combined, encrypted data without exposing the raw information. A notable example is the HE-transformer, an open-source tool released by Intel and Microsoft based on the SEAL library. It integrates with frameworks like TensorFlow and PyTorch to support secure AI operations.</li><li><em>Financial Services</em><br>Banks can securely analyze encrypted transaction data to detect complex money laundering networks or conduct credit risk assessments while complying with privacy regulations.There has been development of an intelligent early warning support system for financial crisis based on fully homomorphic encryption algorithm to solve the problems of data privacy and security in the traditional early warning system.</li></ul><h3>References</h3><ol><li>A. V. Kumar, K. Bhavana and C. Yamini, “Fully Homomorphic Encryption for Data Security Over Cloud,” 2022 6th International Conference on Electronics, Communication and Aerospace Technology, Coimbatore, India, 2022</li><li>F. Jin, Y. Zhu and X. Luo, “Verifiable Fully Homomorphic Encryption scheme,” 2012 2nd International Conference on Consumer Electronics, Communications and Networks (CECNet), Yichang, China, 2012</li><li>F. Kong, “An Intelligent Early Warning Support System for Financial Crisis based on Fully Homomorphic Encryption Algorithm,” 2024 International Conference on Distributed Systems, Computer Networks and Cybersecurity (ICDSCNC), Bengaluru, India, 2024</li><li>A. El-Yahyaoui and M. D. Ech-Chrif El Kettani, “A verifiable fully homomorphic encryption scheme to secure big data in cloud computing,” 2017 International Conference on Wireless Networks and Mobile Communications (WINCOM), Rabat, Morocco, 2017</li></ol><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=157c8886fbfe" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>