Secure list decoding

被引:0
作者
Hayashi, Masahito [1 ,2 ,3 ]
机构
[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
来源
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2019年
关键词
list decoding; anonymous auction; security condition; capacity region;
D O I
10.1109/isit.2019.8849779
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2149 / 2153
页数:5
相关论文
共 16 条
[1]   CHANNEL CAPACITIES FOR LIST CODES [J].
AHLSWEDE, R .
JOURNAL OF APPLIED PROBABILITY, 1973, 10 (04) :824-836
[2]   Generalized privacy amplification [J].
Bennett, CH ;
Brassard, G ;
Crepeau, C ;
Maurer, UM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) :1915-1923
[3]  
Elias P., 1957, P WESCON CONV REC, P94
[4]   A pseudorandom generator from any one-way function [J].
Hästad, J ;
Impagliazzo, R ;
Levin, LA ;
Luby, M .
SIAM JOURNAL ON COMPUTING, 1999, 28 (04) :1364-1396
[5]  
Hayashi M., ARXIVQUANTPH0603031
[6]  
Hayashi M., ARXIV190102590
[7]  
Hayashi M, 2017, IEEE INT SYMP INFO
[8]   Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification [J].
Hayashi, Masahito .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (06) :3989-4001
[9]   .Efficient protocols achieving the commitment capacity of noisy correlations [J].
Imai, Hideki ;
Morozov, Kirill ;
Nascimento, Anderson C. A. ;
Winter, Andreas .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :1432-+
[10]   The Operational Meaning of Min- and Max-Entropy [J].
Koenig, Robert ;
Renner, Renato ;
Schaffner, Christian .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (09) :4337-4347