Communication-Efficient MPC for General Adversary Structures
暂无分享,去创建一个
[1] Martin Hirt,et al. Efficient General-Adversary Multi-Party Computation , 2013, ASIACRYPT.
[2] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[3] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[4] Ueli Maurer. Secure multi-party computation made simple , 2006, Discret. Appl. Math..
[5] Martin Hirt,et al. Efficient Multi-party Computation with Dispute Control , 2006, TCC.
[6] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[7] Matthias Fitzi,et al. General Adversaries in Unconditional Multi-party Computation , 1999, ASIACRYPT.
[8] Adam D. Smith,et al. Multiparty computation unconditionally secure against Q^2 adversary structures , 1999, ArXiv.
[9] Donald Beaver,et al. Quorum-Based Secure Multi-party Computation , 1998, EUROCRYPT.
[10] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .
[11] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[12] Ueli Maurer,et al. MPC vs. SFE : Unconditional and Computational Security , 2008, ASIACRYPT.
[13] Ueli Maurer,et al. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.