DeepAI AI Chat
Log In Sign Up

Secure list decoding

by   Masahito Hayashi, et al.

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.


page 1

page 2

page 3

page 4


Secure list decoding and its application to bit-string commitment

We propose a new concept of secure list decoding, which is related to bi...

LDPC Codes Achieve List Decoding Capacity

We show that Gallager's ensemble of Low-Density Parity Check (LDPC) code...

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

A pilot-assisted transmission (PAT) scheme is proposed for short blockle...

Ratio List Decoding

We extend the notion of list decoding to ratio list decoding which invo...

An Encoding-Decoding algorithm based on Padovan numbers

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

Is the OWASP Top 10 list comprehensive enough for writing secure code?

The OWASP Top 10 is a list that is published by the Open Web Application...

Tight List-Sizes for Oblivious AVCs under Constraints

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