Towards Secure Two-Party Computation from the Wire-Tap Channel
This addresses secure computation for cryptography, but appears incremental as it builds on existing wire-tap channel and coding methods.
The paper tackles secure two-party computation of linear functions in the semi-honest model by introducing a new protocol based on coding techniques, establishing a parallel between the wire-tap channel model and secure computation, and requiring binary intersecting codes or q-ary minimal codes.
We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or $q$-ary minimal codes, which are also studied in this paper.