Towards Secure Two-Party Computation from the Wire-Tap Channel

被引:47
作者
Chabanne, Herve [1 ,2 ,3 ]
Cohen, Gerard [2 ,3 ]
Patey, Alain [1 ,2 ,3 ]
机构
[1] Morpho, Paris, France
[2] Telecom ParisTech, Paris, France
[3] Morpho & Telecom ParisTech Res Ctr, Ident & Secur Alliance, Paris, France
来源
INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2013 | 2014年 / 8565卷
关键词
Secure Two-Party Computation; Secure Function Evaluation; Wire-Tap Channel; Oblivious transfer; Coset coding; Intersecting codes; Minimal codewords; Minimal linear codes;
D O I
10.1007/978-3-319-12160-4_3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce a new tentative protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure two-party computation. This leads us to our protocol, that combines linear coset coding and oblivious transfer techniques. Our construction requires the use of binary intersecting codes or q-ary minimal codes, which are also studied in this paper.
引用
收藏
页码:34 / 46
页数:13
相关论文
共 25 条
[1]  
[Anonymous], 2009, P 12 INT C INF SEC C, DOI [10.1007/978-3-642-14423-3_16, DOI 10.1007/978-3-642-14423-3_16]
[2]   Minimal vectors in linear codes [J].
Ashikhmin, A ;
Barg, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (05) :2010-2017
[3]  
Bonisoli A., 1983, ARS COMBINATORIA, V18, P181
[4]   Oblivious transfers and intersecting codes [J].
Brassard, G ;
Crepeau, C ;
Santha, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1769-1780
[5]  
Bringer J., 2013, WORKSH APPL HOM CRYP
[6]   LINEAR INTERSECTING CODES [J].
COHEN, G ;
LEMPEL, A .
DISCRETE MATHEMATICS, 1985, 56 (01) :35-43
[7]   UPPER-BOUNDS ON GENERALIZED DISTANCES [J].
COHEN, G ;
LITSYN, S ;
ZEMOR, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) :2090-2092
[8]  
Cohen Gerard D., 2013, Cryptography and Coding. 14th IMA International Conference, IMACC 2013. Proceedings: LNCS 8308, P85, DOI 10.1007/978-3-642-45239-0_6
[9]   INTERSECTING CODES AND INDEPENDENT FAMILIES [J].
COHEN, GD ;
ZEMOR, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) :1872-1881
[10]  
Cramer R., 2012, SECURE MULT IN PRESS