Secure list decoding

01/09/2019
by   Masahito Hayashi, et al.
0

In this paper, we propose a new concept of secure list decoding. While the conventional list decoding requires that the list contains the transmitted message, secure list decoding requires the following additional security conditions. The first additional security condition is the impossibility of the correct decoding. This condition can be trivially satisfied when the transmission rate is larger than the channel capacity. The other additional security condition is the impossibility for the sender to estimate another element of decoded list except for the transmitted message. This protocol can be used for anonymous auction, which realizes the anonymity for bidding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/22/2021

Secure list decoding and its application to bit-string commitment

We propose a new concept of secure list decoding, which is related to bi...
research
09/13/2019

LDPC Codes Achieve List Decoding Capacity

We show that Gallager's ensemble of Low-Density Parity Check (LDPC) code...
research
01/16/2019

Low-Complexity Joint Channel Estimation and List Decoding of Short Codes

A pilot-assisted transmission (PAT) scheme is proposed for short blockle...
research
10/18/2018

Ratio List Decoding

We extend the notion of list decoding to ratio list decoding which invo...
research
07/03/2019

An Encoding-Decoding algorithm based on Padovan numbers

In this paper, we propose a new of coding/decoding algorithm using Padov...
research
03/13/2018

Correct Undetected Errors with List Decoding in ARQ Error-control Systems

Undetected errors are important for linear codes, which are the only typ...
research
09/08/2020

Tight List-Sizes for Oblivious AVCs under Constraints

We study list-decoding over adversarial channels governed by oblivious a...

Please sign up or login with your details

Forgot password? Click here to reset