lightphe 0.0.11__tar.gz → 0.0.22__tar.gz

{lightphe-0.0.11 → lightphe-0.0.22}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: lightphe
-Version: 0.0.11
+Version: 0.0.22
 Summary: A Lightweight Partially Homomorphic Encryption Library for Python
 Home-page: https://github.com/serengil/LightPHE
 Author: Sefik Ilkin Serengil
@@ -23,13 +23,12 @@ License-File: LICENSE
 [![Tests](https://github.com/serengil/LightPHE/actions/workflows/tests.yml/badge.svg)](https://github.com/serengil/LightPHE/actions/workflows/tests.yml)
 [![License](http://img.shields.io/:license-MIT-green.svg?style=flat)](https://github.com/serengil/LightPHE/blob/master/LICENSE)
 [![arXiv](https://img.shields.io/badge/arXiv-2408.05219-b31b1b.svg?logo=arXiv)](https://arxiv.org/abs/2408.05219)
-<!-- [![DOI](http://img.shields.io/:DOI-10.48550/arXiv.2408.05219-blue.svg?style=flat)](https://arxiv.org/abs/2408.05219) -->
 
 [![Blog](https://img.shields.io/:blog-sefiks.com-blue.svg?style=flat&logo=wordpress)](https://sefiks.com)
 [![YouTube](https://img.shields.io/:youtube-@sefiks-red.svg?style=flat&logo=youtube)](https://www.youtube.com/@sefiks?sub_confirmation=1)
 [![Twitter](https://img.shields.io/:follow-@serengil-blue.svg?style=flat&logo=x)](https://twitter.com/intent/user?screen_name=serengil)
 
-[![Support me on Patreon](https://img.shields.io/endpoint.svg?url=https%3A%2F%2Fshieldsio-patreon.vercel.app%2Fapi%3Fusername%3Dserengil%26type%3Dpatrons&style=flat)](https://www.patreon.com/serengil?repo=lightphe)
+[![Patreon](https://img.shields.io/:become-patron-f96854.svg?style=flat&logo=patreon)](https://www.patreon.com/serengil?repo=lightphe)
 [![GitHub Sponsors](https://img.shields.io/github/sponsors/serengil?logo=GitHub&color=lightgray)](https://github.com/sponsors/serengil)
 [![Buy Me a Coffee](https://img.shields.io/badge/-buy_me_a%C2%A0coffee-gray?logo=buy-me-a-coffee)](https://buymeacoffee.com/serengil)
 
@@ -37,7 +36,7 @@ License-File: LICENSE
 
 <p align="center"><img src="https://raw.githubusercontent.com/serengil/LightPHE/master/icons/phi.png" width="200" height="240"></p>
 
-LightPHE is a lightweight partially homomorphic encryption library for python. It is a hybrid homomoprhic encryption library wrapping many schemes such as [`RSA`](https://sefiks.com/2023/03/06/a-step-by-step-partially-homomorphic-encryption-example-with-rsa-in-python/), [`ElGamal`](https://sefiks.com/2023/03/27/a-step-by-step-partially-homomorphic-encryption-example-with-elgamal-in-python/), [`Exponential ElGamal`](https://sefiks.com/2023/03/27/a-step-by-step-partially-homomorphic-encryption-example-with-elgamal-in-python/), [`Elliptic Curve ElGamal`](https://sefiks.com/2018/08/21/elliptic-curve-elgamal-encryption/) ([`Weierstrass`](https://sefiks.com/2016/03/13/the-math-behind-elliptic-curve-cryptography/), [`Koblitz`](sefiks.com/2016/03/13/the-math-behind-elliptic-curves-over-binary-field/) and [`Edwards`](https://sefiks.com/2018/12/19/a-gentle-introduction-to-edwards-curves/) forms), [`Paillier`](https://sefiks.com/2023/04/03/a-step-by-step-partially-homomorphic-encryption-example-with-paillier-in-python/), [`Damgard-Jurik`](https://sefiks.com/2023/10/20/a-step-by-step-partially-homomorphic-encryption-example-with-damgard-jurik-in-python/), [`Okamoto–Uchiyama`](https://sefiks.com/2023/10/20/a-step-by-step-partially-homomorphic-encryption-example-with-okamoto-uchiyama-in-python/), [`Benaloh`](https://sefiks.com/2023/10/06/a-step-by-step-partially-homomorphic-encryption-example-with-benaloh-in-python-from-scratch/), [`Naccache–Stern`](https://sefiks.com/2023/10/26/a-step-by-step-partially-homomorphic-encryption-example-with-naccache-stern-in-python/), [`Goldwasser–Micali`](https://sefiks.com/2023/10/27/a-step-by-step-partially-homomorphic-encryption-example-with-goldwasser-micali-in-python/).
+LightPHE is a lightweight partially homomorphic encryption library for python. It is a hybrid homomoprhic encryption library wrapping many schemes such as [`RSA`](https://sefiks.com/2023/03/06/a-step-by-step-partially-homomorphic-encryption-example-with-rsa-in-python/), [`ElGamal`](https://sefiks.com/2023/03/27/a-step-by-step-partially-homomorphic-encryption-example-with-elgamal-in-python/), [`Exponential ElGamal`](https://sefiks.com/2023/03/27/a-step-by-step-partially-homomorphic-encryption-example-with-elgamal-in-python/), [`Elliptic Curve ElGamal`](https://sefiks.com/2018/08/21/elliptic-curve-elgamal-encryption/) ([`Weierstrass`](https://sefiks.com/2016/03/13/the-math-behind-elliptic-curve-cryptography/), [`Koblitz`](sefiks.com/2016/03/13/the-math-behind-elliptic-curves-over-binary-field/) and [`Edwards`](https://sefiks.com/2018/12/19/a-gentle-introduction-to-edwards-curves/) forms), [`Paillier`](https://sefiks.com/2023/04/03/a-step-by-step-partially-homomorphic-encryption-example-with-paillier-in-python/), [`Damgard-Jurik`](https://sefiks.com/2023/10/20/a-step-by-step-partially-homomorphic-encryption-example-with-damgard-jurik-in-python/), [`Okamoto–Uchiyama`](https://sefiks.com/2023/10/20/a-step-by-step-partially-homomorphic-encryption-example-with-okamoto-uchiyama-in-python/), [`Benaloh`](https://sefiks.com/2023/10/06/a-step-by-step-partially-homomorphic-encryption-example-with-benaloh-in-python-from-scratch/), [`Naccache–Stern`](https://sefiks.com/2023/10/26/a-step-by-step-partially-homomorphic-encryption-example-with-naccache-stern-in-python/), [`Goldwasser–Micali`](https://sefiks.com/2023/10/27/a-step-by-step-partially-homomorphic-encryption-example-with-goldwasser-micali-in-python/), [`Sander-Young-Yung`](https://sefiks.com/2026/04/02/a-step-by-step-partially-homomorphic-sander-young-yung-example-in-python/), [`Boneh-Goh-Nissim`](https://sefiks.com/2026/04/02/a-step-by-step-somewhat-homomorphic-encryption-example-with-boneh-goh-nissim-in-python/).
 
 # Partially vs Fully Homomorphic Encryption
 
@@ -68,18 +67,20 @@ from lightphe import LightPHE
 
 In summary, LightPHE is covering following algorithms and these are partially homomorphic with respect to the operations mentioned in the following table.
 
-| Algorithm | Multiplicatively<br>Homomorphic | Additively<br>Homomorphic | Multiplication with a Plain Constant | Exclusively<br>Homomorphic | Regeneration<br>of Ciphertext |
-| --- | --- | --- | --- | --- | --- |
-| RSA | ✅ | ❌ | ❌ | ❌ | ❌ |
-| ElGamal | ✅ | ❌ | ❌ | ❌ | ✅ |
-| Exponential ElGamal | ❌ | ✅ | ✅ | ❌ | ✅ |
-| Elliptic Curve ElGamal | ❌ | ✅ | ✅ | ❌ | ❌ |
-| Paillier | ❌ | ✅ | ✅ | ❌ | ✅ |
-| Damgard-Jurik | ❌ | ✅ | ✅ | ❌ | ✅ |
-| Benaloh | ❌ | ✅ | ✅ | ❌ | ✅ |
-| Naccache-Stern | ❌ | ✅ | ✅ | ❌ | ✅ |
-| Okamoto-Uchiyama | ❌ | ✅ | ✅ | ❌ | ✅ |
-| Goldwasser-Micali | ❌ | ❌ | ❌ | ✅ | ❌ |
+| Algorithm | Multiplicatively<br>Homomorphic | Additively<br>Homomorphic | Scalar Multiplication | Bitwise-XOR Homomorphic | Bitwise-AND Homomorphic | Regeneration<br>of Ciphertext |
+| --- | --- | --- | --- | --- | --- | --- |
+| RSA | ✅ | ❌ | ❌ | ❌ | ❌ | ❌ |
+| ElGamal | ✅ | ❌ | ❌ | ❌ | ❌ | ✅ |
+| Exponential ElGamal | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Elliptic Curve ElGamal | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Paillier | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Damgard-Jurik | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Benaloh | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Naccache-Stern | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Okamoto-Uchiyama | ❌ | ✅ | ✅ | ❌ | ❌ | ✅ |
+| Goldwasser-Micali | ❌ | ❌ | ❌ | ✅ | ❌ | ✅  |
+| Sander-Young-Yung | ❌ | ❌ | ❌ | ❌ | ✅ | ✅ |
+| Boneh-Goh-Nissim | 1️⃣ | ✅ | ✅ | ❌ | ❌ | ✅ |
 
 # Building cryptosystem
 
@@ -96,203 +97,135 @@ algorithms = [
   "Benaloh",
   "Naccache-Stern",
   "Goldwasser-Micali",
-  "EllipticCurve-ElGamal"
+  "EllipticCurve-ElGamal",
+  "Sander-Young-Yung",
+  "Boneh-Goh-Nissim",
 ]
 
-phe = LightPHE(algorithm_name = algorithms[0])
-```
-
-# Encryption & Decryption
-
-Once you built your cryptosystem, you will be able to encrypt and decrypt messages with the built cryptosystem.
-
-```python
-# define plaintext
-m = 17
-
-# calculate ciphertext
-c = phe.encrypt(m)
-
-# proof of work
-assert phe.decrypt(c) == m
+cs = LightPHE(algorithm_name = algorithms[0])
 ```
 
 # Homomorphic Operations
 
-Once you have the ciphertext, you will be able to perform homomorphic operations on encrypted data without holding private key. For instance, Paillier is homomorphic with respect to the addition. In other words, decryption of the addition of two ciphertexts is equivalent to addition of plaintexts.
-
-### On-Prem Encryption
-
-This code snippet illustrates how to generate a random public-private key pair using the Paillier and encrypt a plaintext pair. The resulting ciphertext pair, c1 and c2, along with the public key, is then sent from the on-premises environment to the cloud.
+The following example demonstrates a simple workflow using LightPHE with an additively homomorphic cryptosystem (e.g. Paillier). First, we build the cryptosystem on-premises and define two plaintext values. Next, we encrypt the plaintexts, which can be done either on-premises or in the cloud, and does not require the private key. Homomorphic operations, such as addition and scalar multiplication, can then be performed on the ciphertexts—these operations can be offloaded to the cloud, leveraging its computational power without revealing the private key or the plaintext. Finally, the results are decrypted on-premises using the private key, verifying that the homomorphic operations on encrypted data produce the expected plaintext results.
 
 ```python
-def on_premise() -> Tuple[int, int, dict]:
-    """
-    Executes on-premise operations: initializes a cryptosystem by generating 
-    a random public-private key pair, then encrypts two plaintext values.
-
-    Returns:
-       result (tuple): A tuple containing:
-       - c1 (int): The first ciphertext
-       - c2 (int): The second ciphertext
-       - public_key (dict): The public key for the cryptosystem
-    """
-    # generate a random private-public key pair
-    phe = LightPHE(algorithm_name = "Paillier")
-
-    # define plaintexts
-    m1 = 10000 # base salary in usd
-    m2 = 500 # wage increase in usd
-
-    # calculate ciphertexts
-    c1 = phe.encrypt(m1).value
-    c2 = phe.encrypt(m2).value
-
-    return (c1, c2, phe.cs.public_key)
-```
+# build an additively homomorphic cryptosystem
+cs = LightPHE(algorithm_name = "Paillier")
 
-### Homomorphic Operations on Cloud
+# define plaintexts
+m1 = 10000 # base salary in usd
+m2 = 500 # wage increase in usd
 
-This code snippet demonstrates how to perform homomorphic addition on the cloud side without using the private key. However, the cloud is unable to decrypt c3 itself, even though it is the one that calculated it.
+# encrypt plaintexts - private key is not required.
+c1 = cs.encrypt(m1)
+c2 = cs.encrypt(m2)
 
-```python
-def cloud(c1: int, c2: int, public_key: dict) -> int:
-    """
-    Performs cloud-side operations: reconstructs a cryptosystem using the 
-    provided public key and executes a homomorphic addition on two ciphertexts.
-
-    Args:
-       c1 (int): The first ciphertext
-       c2 (int): The second ciphertext
-       public_key (dict): The public key of an existing cryptosystem
-    Retunrs:
-       c3 (int): The resulting ciphertext after homomorphic addition
-    """
-    # restore cryptosystem with just the public key
-    phe = LightPHE(algorithm_name = "Paillier", keys = public_key)
-
-    # cast c1 and c2 to ciphertext objects
-    c1 = phe.create_ciphertext_obj(c1)
-    c2 = phe.create_ciphertext_obj(c2)
-
-    # confirm that cloud cannot decrypt c1
-    with pytest.raises(ValueError, match="You must have private key"):
-      phe.decrypt(c1)
-
-    # confirm that cloud cannot decrypt c2
-    with pytest.raises(ValueError, match="You must have private key"):
-      phe.decrypt(c2)
-
-    # perform homomorphic addition
-    c3 = c1 + c2
-
-    # confirm that cloud cannot decrypt c3
-    with pytest.raises(ValueError, match="You must have private key"):
-      phe.decrypt(c3)
-    
-    return c3.value
-```
+# homomorphic addition - private key is not required
+c3 = c1 + c2
 
-### On-Prem Decryption And Proof of Work
-
-This code snippet demonstrates the proof of work. Even though c3 was calculated in the cloud by adding c1 and c2, on-premises can validate that its decryption must be equal to the addition of plaintexts m1 and m2.
+# homomorphic scalar multiplication - private key is not required
+k = 1.05 # increase something 5%
+c4 = k * c1
 
-```python
-# proof of work - private key required
-assert phe.decrypt(c3) == m1 + m2
+# decryption - private key is required
+assert cs.decrypt(c3) == m1 + m2
+assert cs.decrypt(c4) == k * m1
 ```
 
-In this homomorphic pipeline, the cloud's computational power was utilized to calculate c3, but it can only be decrypted by the on-premises side. Additionally, while we performed the encryption on the on-premises side, this is not strictly necessary; only the public key is required for encryption. Therefore, encryption can also be performed on the non-premises side. This approach is particularly convenient when collecting data from multiple edge devices and storing all of it in the cloud simultaneously.
+On the other hand, if you adopt a multiplicatively homomorphic cryptosystem (e.g. RSA or ElGamal), you can multiply ciphertexts without revealing the private key or the plaintext.
 
-### Scalar Multiplication
+```python
+# build a multiplicatively homomorphic cryptosystem
+cs = LightPHE(algorithm_name = "RSA")
 
-Besides, Paillier is supporting multiplying ciphertexts by a known plain constant. This code snippet demonstrates how to perform scalar multiplication on encrypted data using Paillier homomorphic encryption with the LightPHE library.
+# define plaintexts
+m1 = 17
+m2 = 21
 
-```python
-# increasing something 5%
-k = 1.05
+# encrypt plaintexts - private key is not required.
+c1 = cs.encrypt(m1)
+c2 = cs.encrypt(m2)
 
-# scalar multiplication - cloud (private key is not required)
-c4 = k * c1
+# homomorphic multiplication
+c3 = c1 * c2
 
-# proof of work on-prem - private key is required
-assert phe.decrypt(c4) == k * m1
+# decryption - private key is required
+assert cs.decrypt(c3) == m1 * m2
 ```
 
 ### Ciphertext Regeneration
 
-Similar to the most of additively homomorphic algorithms, Paillier lets you to regenerate ciphertext while you are not breaking its plaintext restoration. You may consider to do this re-generation many times to have stronger ciphertexts.
+The most of additively homomorphic algorithms allow you to regenerate ciphertext while you are not breaking its plaintext restoration. You may consider to do this re-generation many times to have stronger ciphertexts.
 
 ```python
-c1_prime = phe.regenerate_ciphertext(c1)
+c1_prime = cs.regenerate_ciphertext(c1)
 assert c1_prime.value != c1.value
-assert phe.decrypt(c1_prime) == m1
-assert phe.decrypt(c1) == m1
+assert cs.decrypt(c1_prime) == m1
+assert cs.decrypt(c1) == m1
 ```
 
-### Unsupported Operations
+### Elliptic Curve Cryptography
 
-Finally, if you try to perform an operation that algorithm does not support, then an exception will be thrown. For instance, Paillier is not homomorphic with respect to the multiplication or xor. To put it simply, you cannot multiply two ciphertexts. If you enforce this calculation, you will have an exception.
+ECC is a powerful public-key cryptosystem based on the algebraic structure of elliptic curves over finite fields. The library supports 3 elliptic curve forms (weierstrass (default), edwards and koblitz) and 100+ standard elliptic curve configurations.
 
-```python
-# pailier is not multiplicatively homomorphic
-with pytest.raises(ValueError, match="Paillier is not homomorphic with respect to the multiplication"):
-  c1 * c2
+In LightPHE, the [Elliptic Curve ElGamal](https://sefiks.com/2018/08/21/elliptic-curve-elgamal-encryption/) scheme is implemented, offering a secure and efficient homomorphic encryption option.
 
-# pailier is not exclusively homomorphic
-with pytest.raises(ValueError, match="Paillier is not homomorphic with respect to the exclusive or"):
-  c1 ^ c2
+```python
+forms = ["weierstrass", "edwards", "koblitz"]
+phe = LightPHE(
+    algorithm_name="EllipticCurve-ElGamal",
+    form="edwards",
+    # curve="ed448", # optinally you can specify the curve for given form
+)
 ```
 
-However, if you tried to multiply ciphertexts with RSA, or xor ciphertexts with Goldwasser-Micali, these will be succeeded because those cryptosystems support those homomorphic operations.
+One of the crucial factors that define the security level of an elliptic curve cryptosystem is the order of the curve. The order of a curve is the number of points on the curve, and it directly influences the strength of the encryption. A higher order typically corresponds to a stronger cryptosystem, making it more resistant to cryptographic attacks.
 
-### Elliptic Curve Cryptography
+Each curve in LightPHE has a specific order, which is carefully chosen to balance performance and security. By selecting an elliptic curve with a larger order, you increase the security of your cryptographic system, but this may come with a trade-off in computational efficiency. Therefore, choosing the appropriate curve order is a crucial decision based on your application’s security and performance requirements.
 
-ECC is a powerful public-key cryptosystem based on the algebraic structure of elliptic curves over finite fields. The library supports 3 elliptic curve forms (weierstrass, edwards and koblitz) and 100+ standard elliptic curve configurations.
+See [`curves`](https://github.com/serengil/LightECC#supported-curves) page for a list of all supported forms, curves and their details.
 
-Building an elliptic curve with LightPHE is very straightforward. Once the curve is initialized, you can perform operations such as point addition and scalar multiplication.
+### Vector Embeddings
 
-```python
-from lightphe import ECC
+LightPHE supports homomorphic encryption on vector embeddings. This is useful in privacy-preserving machine learning, secure aggregation, and confidential data processing.
 
-forms = ["weierstrass", "edwards", "koblitz"]
+```python
+# build an additively homomorphic cryptosystem (e.g. Paillier)
+cs = LightPHE("Paillier")
 
-# construct an elliptic curve
-ed = ECC(form_name="edwards")
+# define plain embeddings
+t1 = [1.005, 2.05, 3.6, 4, 4.02, 3.5]
+t2 = [5, 6.2, 7.5, 8.02, 8.02, 4.5]
+t3 = [1.03, 2.04, 3.05, 7.02, 2.01, 1.06]
 
-# Base Point
-G = ed.G
+# encrypt embeddings
+c1, c2 = cs.encrypt(t1), cs.encrypt(t2)
 
-_2G = G + G
-_3G = _2G + G
-_5G = _3G + _2G
+# perform addition of two encrypted embeddings
+c4 = c1 + c2
 
-_20G = 4 * G
-_19G = _20G - G
-```
+# perform scalar multiplication on an embedding
+c5 = 3 * c1
 
-In LightPHE, the [Elliptic Curve ElGamal](https://sefiks.com/2018/08/21/elliptic-curve-elgamal-encryption/) scheme is implemented, offering a secure and efficient homomorphic encryption option.
+# perform element-wise multiplication between an encrypted embedding and plain embedding
+c6 = c1 * t3
 
-```python
-forms = ["weierstass", "edwards", "koblitz"]
+# encrypted dot product (likewise cosine similarity)
+c7 = c1 @ t3
 
-phe = LightPHE(
-    algorithm_name="EllipticCurve-ElGamal",
-    form=forms[1],
-)
+# proof of work
+assert np.allclose(cs.decrypt(c4), [a + b for a, b in zip(t1, t2)], rtol=1e-2)
+assert np.allclose(cs.decrypt(c5), [a * 3 for a in t1], rtol=1e-2)
+assert np.allclose(cs.decrypt(c6), [a * b for a, b in zip(t1, t3)], rtol=1e-2)
+assert np.allclose(cs.decrypt(c7)[0], sum([a * b for a, b in zip(t1, t3)]), rtol=1e-2)
 ```
 
-One of the crucial factors that define the security level of an elliptic curve cryptosystem is the order of the curve. The order of a curve is the number of points on the curve, and it directly influences the strength of the encryption. A higher order typically corresponds to a stronger cryptosystem, making it more resistant to cryptographic attacks.
-
-Each curve in LightPHE has a specific order, which is carefully chosen to balance performance and security. By selecting an elliptic curve with a larger order, you increase the security of your cryptographic system, but this may come with a trade-off in computational efficiency. Therefore, choosing the appropriate curve order is a crucial decision based on your application’s security and performance requirements.
-
-See [`curves`](https://github.com/serengil/LightPHE/tree/master/lightphe/elliptic_curve_forms) page for a list of all supported forms, curves and their details.
-
 # Contributing
 
 All PRs are more than welcome! If you are planning to contribute a large patch, please create an issue first to get any upfront questions or design decisions out of the way first.
 
-You should be able run `make test` and `make lint` commands successfully before committing. Once a PR is created, GitHub test workflow will be run automatically and unit test results will be available in [GitHub actions](https://github.com/serengil/LightPHE/actions/workflows/tests.yml) before approval. Besides, workflow will evaluate the code with pylint as well.
+You should be able run `make test` and `make lint` commands successfully before committing. Once a PR is created, GitHub test workflow will be run automatically and unit test results will be available in [GitHub actions](https://github.com/serengil/LightPHE/actions/workflows/tests.yml) before approval.
 
 # Support
 
@@ -301,11 +234,11 @@ There are many ways to support a project - starring⭐️ the GitHub repo is jus
 You can also support this work on [Patreon](https://www.patreon.com/serengil?repo=lightphe), [GitHub Sponsors](https://github.com/sponsors/serengil) or [Buy Me a Coffee](https://buymeacoffee.com/serengil).
 
 <a href="https://www.patreon.com/serengil?repo=lightphe">
-<img src="https://raw.githubusercontent.com/serengil/LightPHE/master/icons/patreon.png" width="30%" height="30%">
+<img src="https://raw.githubusercontent.com/serengil/LightPHE/master/icons/patreon.png" width="30%">
 </a>
 
 <a href="https://buymeacoffee.com/serengil">
-<img src="https://raw.githubusercontent.com/serengil/LightPHE/master/icons/bmc-button.png" width="25%" height="25%">
+<img src="https://raw.githubusercontent.com/serengil/LightPHE/master/icons/bmc-button.png" width="25%">
 </a>
 
 Also, your company's logo will be shown on README on GitHub if you become sponsor in gold, silver or bronze tiers.
@@ -315,13 +248,22 @@ Also, your company's logo will be shown on README on GitHub if you become sponso
 Please cite LightPHE in your publications if it helps your research. Here is its BibTex entry:
 
 ```BibTeX
-@misc{serengil2024lightphe,
-   title     = {LightPHE: Integrating Partially Homomorphic Encryption into Python with Extensive Cloud Environment Evaluations}, 
-   author    = {Serengil, Sefik Ilkin and Ozpinar, Alper},
-   year      = {2024},
-   publisher = {arXiv},
-   url       = {https://arxiv.org/abs/2408.05219},
-   doi       = {10.48550/arXiv.2408.05219}
+@article{serengil2024lightphe,
+  title={LightPHE: Integrating Partially Homomorphic Encryption into Python with Extensive Cloud Environment Evaluations},
+  author={Serengil, Sefik Ilkin and Ozpinar, Alper},
+  journal={arXiv preprint arXiv:2408.05219},
+  note={doi: 10.48550/arXiv.2408.05219. [Online]. Available: \url{https://arxiv.org/abs/2408.05219}},
+  year={2025}
+}
+```
+
+```BibTeX
+@article{serengil2025vectorsimilarity,
+  title={Encrypted Vector Similarity Computations Using Partially Homomorphic Encryption: Applications and Performance Analysis},
+  author={Serengil, Sefik and Ozpinar, Alper},
+  journal={arXiv preprint arXiv:2503.05850},
+  note={doi: 10.48550/arXiv.2503.05850. [Online]. Available: \url{https://arxiv.org/abs/2503.05850}},
+  year={2025}
 }
 ```