Perfectly Secure Message Transmission Revisited
暂无分享,去创建一个
[1] K. Srinathan,et al. Optimal Perfectly Secure Message Transmission , 2004, CRYPTO.
[2] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[5] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[6] K. Srinathan,et al. On perfectly secure communication over arbitrary networks , 2002, PODC '02.
[7] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.
[8] Keith M. Martin,et al. Combinatorial models for perfect secret sharing schemes , 1998 .
[9] Yongge Wang,et al. Secure Communication in Multicast Channels: The Answer to Franklin and Wright's Question , 2001, Journal of Cryptology.
[10] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[11] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.
[12] Nathan Linial,et al. Fault-Tolerant Computation in the Full Information Model , 1998, SIAM J. Comput..
[13] Yongge Wang,et al. Perfectly Secure Message Transmission Revisited , 2002, IEEE Transactions on Information Theory.
[14] Tal Rabin,et al. Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.
[15] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[16] Matthew K. Franklin,et al. Secure Hypergraphs: Privacy from Partial Broadcast , 2004, SIAM J. Discret. Math..
[17] F. MacWilliams,et al. Codes which detect deception , 1974 .
[18] Adi Shamir,et al. How to share a secret , 1979, CACM.
[19] Matthew K. Franklin,et al. Secure Communication in Minimal Connectivity Models , 2000, Journal of Cryptology.