Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
暂无分享,去创建一个
K. Srinathan | C. Pandu Rangan | Ashish Choudhury | Arpita Patra | C. P. Rangan | Ashish Choudhury | K. Srinathan | A. Patra
[1] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[2] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[3] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[4] Matthias Fitzi,et al. Trading Correctness for Privacy in Unconditional Multi-Party Computation ? Corrected Version ?? , 1998 .
[5] Matthias Fitzi,et al. Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract) , 1998, CRYPTO.
[6] Matthias Fitzi,et al. General Adversaries in Unconditional Multi-party Computation , 1999, ASIACRYPT.
[7] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[8] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.
[9] Matthias Fitzi,et al. Byzantine Agreement Secure against General Adversaries in the Dual Failure Model , 1999, DISC.
[10] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[11] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[12] Yongge Wang,et al. Perfectly Secure Message Transmission Revisited , 2002, IEEE Transactions on Information Theory.
[13] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[14] Matthew K. Franklin,et al. Secure Communication in Minimal Connectivity Models , 1998, Journal of Cryptology.
[15] K. Srinathan,et al. Possibility and complexity of probabilistic reliable communication in directed networks , 2006, PODC '06.