# Secure list decoding

**Authors:** Masahito Hayashi

arXiv: 1901.02590 · 2020-06-23

## TL;DR

This paper introduces secure list decoding, a novel concept ensuring both the receiver's inability to uniquely identify the message and the sender's inability to estimate other list elements, enhancing privacy in applications like anonymous auctions.

## Contribution

It defines secure list decoding with new security conditions and discusses its potential for privacy-preserving communication protocols.

## Key findings

- Defines security conditions for secure list decoding
- Ensures privacy by preventing message identification and estimation
- Applicable to anonymous auction protocols

## Abstract

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, i.e., the receiver cannot uniquely identify the transmitted message even though the transmitted message is contained in the list. 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 the decoded list except for the transmitted message. This protocol can be used for anonymous auction, which realizes the anonymity for bidding.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1901.02590/full.md

## Figures

2 figures with captions in the complete paper: https://tomesphere.com/paper/1901.02590/full.md

## References

19 references — full list in the complete paper: https://tomesphere.com/paper/1901.02590/full.md

---
Source: https://tomesphere.com/paper/1901.02590