4 citations · 4 across the 1 of their papers we have counts for
1 paper
Anselme Tueno, Florian Kerschbaum, Stefan Katzenbeisser +2
We consider the problem of securely computing the kth-ranked element in a sequence of n private integers distributed among n parties. The kth-ranked element (e.g., minimum, maximum…