Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model

被引:19
作者
Pinto, Adriana C. B. [1 ]
Dowsley, Rafael [1 ]
Morozov, Kirill [2 ]
Nascimento, Anderson C. A. [1 ]
机构
[1] Univ Brasilia, Dept Elect Engn, BR-70910900 Brasilia, DF, Brazil
[2] Natl Inst Adv Ind Sci & Technol, Res Ctr Informat Secur, Takamatsu, Kagawa, Japan
关键词
Generalized erasure channel; information-theoretic security; interactive hashing; oblivious transfer; oblivious transfer capacity; PRIVACY AMPLIFICATION; EXTRACTORS;
D O I
10.1109/TIT.2011.2158898
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Information-theoretically secure string oblivious transfer (OT) can be constructed based on discrete memoryless channel (DMC). The oblivious transfer capacity of a channel characterizes-similarly to the (standard) information capacity-how efficiently it can be exploited for secure oblivious transfer of strings. The OT capacity of a generalized erasure channel (GEC)-which is a combination of a (general) DMC with the erasure channel-has been established by Ahlswede and Csizar at ISIT'07 in the case of passive adversaries. In this paper, we present the protocol that achieves this capacity against malicious adversaries for GEC with erasure probability at least 1/2. Our construction is based on the protocol of Crepeau and Savvides from Eurocrypt'06 which uses interactive hashing (IH). We solve an open question posed by the above paper, by basing it upon a constant round IH scheme (previously proposed by Ding et al. at TCC'04). As a side result, we show that the Ding et al. IH protocol can deal with transmission errors.
引用
收藏
页码:5566 / 5571
页数:6
相关论文
共 34 条
[1]  
Ahlswede R., P ISIT 2007, P2061
[2]  
[Anonymous], 1988, P STOC 1988, P20
[3]  
[Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems
[4]  
[Anonymous], 2007, THESIS MCGILL U MONT
[5]  
Beaver D, 1995, LECT NOTES COMPUT SC, V963, P97
[6]   Generalized privacy amplification [J].
Bennett, CH ;
Brassard, G ;
Crepeau, C ;
Maurer, UM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (06) :1915-1923
[7]   PRIVACY AMPLIFICATION BY PUBLIC DISCUSSION [J].
BENNETT, CH ;
BRASSARD, G ;
ROBERT, JM .
SIAM JOURNAL ON COMPUTING, 1988, 17 (02) :210-229
[8]   Oblivious transfer with a memory-bounded receiver [J].
Cachin, C ;
Crepeau, C ;
Marcil, J .
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, :493-502
[9]  
CARTER JL, 1979, J COMPUT SYST SCI, V18, P143, DOI 10.1016/0022-0000(79)90044-8
[10]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507