The paper proposes an information-theoretically secure three-party computation protocol using cut-and-choose, claiming malicious security with 2^{-s} cheating probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose
The paper proposes an information-theoretically secure three-party computation protocol using cut-and-choose, claiming malicious security with 2^{-s} cheating probability.