New answers tagged

1

I don't think there are some guidelines as such. However, different approaches have been considered. A common consideration across several implementations that aim at making these things more accessible in practice (e.g. TF-Encrypted, or PySyft) is to consider a third trusted party that distributes the necessary preprocessing material before the computation ...


0

A very different answer might also be helpful (depending on your application): The idea is to use distributed homomorphic encryption, like distributed El Gamal encryption. Say we are working in a group with generator $g$. Each of your persons $i$ chooses a secret key $y_i$ and shares the public key $Y_i=g^{y_i}$ with the other participants. They each compute ...


2

I have $n$ persons, each holding a secret integer $x_i$ ($i$ from $1$ to $n$) and I'm looking for a way for them to jointly compute the sum of these secrets without revealing to each other their individual secrets. A simple application of arithmetic secret-sharing based secure multi-party computation ("arithmetic GMW") can do that. The protocol ...


4

So the gist of my question here is about the usage of my field size, that I use for modulo. Well, the first thing to notice is the definition of a 'field' (which is a term from mathematics); I don't feel like getting into a discussion of what a field is (look it up in Wikipedia if you're interested), however addition and multiplication modulo a composite (...


Top 50 recent answers are included