The function-evaluation tag has no wiki summary.
2
votes
1answer
71 views
What's efficient MPC protocol for determining if sum's bigger than y?
My secure multi-party computation (MPC) in need is simply to determine if a sum of two private variable is bigger than a given value $y$, as
$f(x_0, x_1) = [(x_0 + x_1) > y]$
in which the value ...
5
votes
2answers
255 views
Alternatives to FHE for secure function evaluation
As a followup to a previous question I asked which was more related to Fully Homomorphic Encryption (FHE), what other cryptographic methods are available for computing a private function on public ...
2
votes
2answers
184 views
Background for modular arithmetic function
I'm investigating this function:
$a := ((b\cdot c) \bmod k) - (b \cdot c)/k$
where $/$ indicates integer division.
Two things I've noticed:
It's equivalent to multiplying a·b, and then ...
10
votes
2answers
258 views
Why use a 1-2 Oblivious Transfer instead of a 1 out of n Oblivious Transfer?
When initiating an oblivious transfer, why would someone use a 1-2 oblivious transfer rather than going for an 1 out of n oblivious transfer? Perhaps a slight time overhead for the extra message ...