Secure list decoding
This addresses secure communication and anonymity in protocols such as auctions, but appears incremental as it builds on existing list decoding concepts.
The paper introduces secure list decoding, which adds security conditions to conventional list decoding: the receiver cannot uniquely identify the transmitted message even if it is in the list, and the sender cannot estimate other elements in the list except the transmitted message, with applications like anonymous auctions.
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.