Secure Multiparty AES

被引：0

作者：

Damgard, Ivan ^{[1
]}

Keller, Marcel ^{[1
]}

机构：

[1] Aarhus Univ, Dept Comp Sci, DK-8000 Aarhus C, Denmark

来源：

FINANCIAL CRYPTOGRAPHY AND DATA SECURITY | 2010年 / 6052卷

关键词：

COMPUTATION; SECRET; SHARE;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400/255 expected elementary operations in expected 70 + 20/255 rounds to encrypt one 128-bit block with a 128-bit key. We implemented the variants using VIFF, a software framework for implementing secure multiparty computation (MPC). Tests with three players (passive security against at most one corrupted player) in a local network showed that one block can be encrypted in 2 seconds. We also argue that this result could be improved by an optimized implementation.

引用

页码：367 / 374

页数：8

共 13 条

[1] [Anonymous], FOCS
[2] [Anonymous], STOC
[3] [Anonymous], STOC
[4] Bogdanov D, 2008, LECT NOTES COMPUT SC, V5283, P192
[5] Bogetoft P, 2009, LECT NOTES COMPUT SC, V5628, P325, DOI 10.1007/978-3-642-03549-4_20
[6] Cramer R, 2005, LECT NOTES COMPUT SC, V3378, P342
[7] DAMGARD I, 2009, 2009614 CRYPT EPRINT
[8] Damgård I, 2009, LECT NOTES COMPUT SC, V5443, P160
[9] Geisler M., 2007, VIFF VIRTUAL IDEAL F
[10] Malkhi D, 2004, USENIX ASSOCIATION PROCEEDINGS OF THE 13TH USENIX SECURITY SYMPOSIUM, P287

← 1 2 →