Coding Constructions for Efficient Oblivious Transfer from Noisy Channels

08/31/2020
by   Frédérique Oggier, et al.
0

We consider oblivious transfer protocols performed over binary symmetric channels in a malicious setting where parties will actively cheat if they can. We provide constructions purely based on coding theory that achieve an explicit positive rate, the essential ingredient being the existence of linear codes whose Schur products are asymptotically good.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2023

Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes

This work continues the study of linear error correcting codes against a...
research
11/14/2022

A Lego-Brick Approach to Coding for Network Communication

Coding schemes for several problems in network information theory are co...
research
10/30/2021

Explicit and Efficient Construction of (nearly) Optimal Rate Codes for Binary Deletion Channel and the Poisson Repeat Channel

Two of the most common models for channels with synchronisation errors a...
research
07/24/2022

Constructions of linear codes with two or three weights from vectorial dual-bent functions

Linear codes with a few weights are an important class of codes in codin...
research
07/28/2023

Provably secure KEM-based protocols over unauthenticated channels

In this paper we propose a number of KEM-based protocols to establish a ...
research
11/19/2019

Super-Nyquist Rateless Coding for Intersymbol Interference Channels

A rateless transmission architecture is developed for communication over...
research
05/13/2020

Stealth Communication with Vanishing Power over Binary Symmetric Channels

A framework for stealth communication with vanishing power (VP) is prese...

Please sign up or login with your details

Forgot password? Click here to reset