# Encryption to additive Shares

**URL:** <https://openfhe.discourse.group/t/encryption-to-additive-shares/157>\
**Category:** Library Questions\
**Created:** [October 12, 2022, 7:49pm UTC](https://openfhe.discourse.group/t/encryption-to-additive-shares/157 "2022-10-12T19:49:23Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![radhika](https://avatars.discourse-cdn.com/v4/letter/r/d6d6ee/32.png) [@radhika](https://openfhe.discourse.group/u/radhika)\
**Post date:** [October 12, 2022, 7:49pm UTC](https://openfhe.discourse.group/t/encryption-to-additive-shares/157/1 "2022-10-12T19:49:23Z")

</div>

Is there something like “Spooky encryption” in OpenFHE?

> **[spooky.pdf](https://cs.nyu.edu/~dodis/ps/spooky.pdf)**
>
> 681.47 KB

I have a situation where one party has a ciphertext and wants to convert it into additive shares without being able to decrypt the ciphertext because it is encrypted by the public key formed collectively by all the n-parties.

I think there is something like this in lattigo because it has the implementation of [https://eprint.iacr.org/2020/304.pdf](https://eprint.iacr.org/2020/304.pdf) but I am working in C++ and openfhe has additional optimisations for multiplication and error reductions implemented so I want to go ahead with it.

---

<div class="post-metadata">

**Author:** ![ypolyakov](https://yyz1.discourse-cdn.com/flex031/user_avatar/openfhe.discourse.group/ypolyakov/32/47_2.png) [@ypolyakov](https://openfhe.discourse.group/u/ypolyakov)\
**Post date:** [October 22, 2022, 5:08pm UTC](https://openfhe.discourse.group/t/encryption-to-additive-shares/157/2 "2022-10-22T17:08:20Z")

</div>

This discussion has migrated to [Distributed / Multiparty Bootstrapping](https://openfhe.discourse.group/t/distributed-multiparty-bootstrapping/166) More detailed information is available there.