Invertible Extractors and Wiretap Protocols

被引:29
作者
Cheraghchi, Mahdi [1 ]
Didier, Fredric [2 ]
Shokrollahi, Amin [3 ]
机构
[1] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
[2] Google Inc, Zurich, Switzerland
[3] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, Lausanne, Switzerland
基金
欧洲研究理事会; 瑞士国家科学基金会;
关键词
Active intrusion; exposure resilient cryptography; extractors; network coding; wiretap channel; DETERMINISTIC EXTRACTORS; RAMANUJAN GRAPHS; ENCRYPTION; SECURITY; ERROR; CODES;
D O I
10.1109/TIT.2011.2170660
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information about the message, while knowledge of the entire encoding reveals the message using the decoder. In this paper, the notion of efficiently invertible extractors is studied and it is shown that a wiretap protocol can be constructed from such an extractor. Then, invertible extractors for symbol-fixing, affine, and general sources are constructed and used to create wiretap protocols with asymptotically optimal trade-offs between their rate (ratio of the length of the message versus its encoding) and resilience (ratio of the observed positions of the encoding and the length of the encoding). The results are further applied to create wiretap protocols for challenging communication problems, such as active intruders who change portions of the encoding, network coding, and intruders observing arbitrary Boolean functions of the encoding. As a by-product of the constructions, new explicit extractors for a restricted family of affine sources over large fields is obtained (that in particular generalizes the notion of symbol-fixing sources) which is of independent interest. These extractors are able to extract the entire source entropy with zero error.
引用
收藏
页码:1254 / 1274
页数:21
相关论文
共 57 条
[1]   Network information flow [J].
Ahlswede, R ;
Cai, N ;
Li, SYR ;
Yeung, RW .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1204-1216
[2]  
[Anonymous], [No title captured]
[3]  
BENNETT CH, 1986, LECT NOTES COMPUT SC, V218, P468
[4]  
Bourgain J., 2008, COMMUNICATION
[5]   On the construction of affine extractors [J].
Bourgain, Jean .
GEOMETRIC AND FUNCTIONAL ANALYSIS, 2007, 17 (01) :33-57
[6]  
Cai N., 2002, P IEEE INT S INF THE
[7]  
Canetti R., 1999, LECT NOTES COMPUTER, V1666, P503
[8]  
Charles D. X., 2007, J CRYPTOLOGY
[9]  
Chor B., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P396, DOI 10.1109/SFCS.1985.55
[10]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892