Secure list decoding

Hayashi, Masahito1,2,3

10.1109/ISIT.2019.8849779

2019

2157-8095

978-1-5386-9292-9

2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)

2019-July

2149-2153

7-12 July 2019

Paris, France

345 E 47TH ST, NEW YORK, NY 10017 USA

IEEE

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, 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.

list decoding anonymous auction security condition capacity region

通讯

英语

CPCI-S ; EI

JSPS[17H01280] ; JSPS[16KT0017]

Computer Science

Computer Science, Information Systems ; Computer Science, Theory & Methods

WOS:000489100302049

20194207537352

Channel capacity

Information Theory and Signal Processing:716.1 ; Data Processing and Image Processing:723.2

Web of Science

1.Nagoya Univ, Grad Sch Math, Nagoya, Aichi, Japan
2.Southern Univ Sci & Technol, Shenzhen Inst Quantum Sci & Engn, Shenzhen, Peoples R China
3.Natl Univ Singapore, Ctr Quantum Technol, Singapore, Singapore

Hayashi, Masahito. Secure list decoding[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE,2019:2149-2153.