Towards Secure Two-Party Computation from the Wire-Tap Channel
Herv\'e Chabanne, G\'erard Cohen, Alain Patey
TL;DR
This paper presents a novel protocol for secure two-party computation of linear functions leveraging coding techniques and the wire-tap channel model, enhancing security in the semi-honest setting.
Contribution
It introduces a new protocol based on coding and wire-tap channel concepts, utilizing linear coset coding and oblivious transfer, and studies specific binary and q-ary codes.
Findings
Protocol achieves secure computation of linear functions
Uses binary intersecting and q-ary minimal codes
Establishes a connection between wire-tap channels and secure computation
Abstract
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 -ary minimal codes, which are also studied in this paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Data Security · graph theory and CDMA systems