Secure multi-party computation made simple

被引：58

作者：

Maurer, U ^{[1
]}

机构：

[1] ETH, Dept Comp Sci, CH-8092 Zurich, Switzerland

来源：

DISCRETE APPLIED MATHEMATICS | 2006年 / 154卷 / 02期

关键词：

secure multi-party computation; verifyable secret sharing; adversary structures;

D O I：

10.1016/j.dam.2005.03.020

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Known secure multi-party computation protocols are quite complex, involving non-trivial mathematical structures and sub-protocols. The purpose of this paper is to present a very simple approach to secure multi-party computation with straight-forward security proofs. This approach naturally yields protocols secure for mixed (active and passive) Corruption and general (as opposed to threshold) adversary structures, confirming the previously proved tight bounds in a simpler framework. Due to their simplicity, the described protocols are well-suited for didactic purposes, which is a main goal of this paper. (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：370 / 381

页数：12

共 23 条

[1]

Beaver D., 1991, Journal of Cryptology, V4, P75, DOI 10.1007/BF00196771

[2]

BEAVER D, 1998, LECT NOTES COMPUTER, V1403, P25

[3]

Ben-Or M., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P1, DOI 10.1145/62212.62213

[4]

BERMAN P, 1989, P 30 ANN S FDN COMP, P410, DOI DOI 10.1109/SFCS.1989.63511

[5] Security and composition of multiparty cryptographic protocols [J].

Canetti, R .

JOURNAL OF CRYPTOLOGY, 2000, 13 (01) :143-202

[6]

Chaum D., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P11, DOI 10.1145/62212.62214

[7]

Cramer R, 2000, LECT NOTES COMPUT SC, V1807, P316

[8]

Cramer R, 1999, LECT NOTES COMPUT SC, V1592, P311

[9]

Fehr S, 2002, LECT NOTES COMPUT SC, V2442, P565

[10] An optimal probabilistic protocol for synchronous Byzantine agreement [J].

Feldman, P ;

Micali, S .

SIAM JOURNAL ON COMPUTING, 1997, 26 (04) :873-933

← 1 2 3 →