Secure network coding for distributed secret sharing with low communication cost

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 2404-2408

  Shah, Nihar B ^a   Rashmi, K V ^a   Ramchandran, Kannan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION COST; CRYPTOGRAPHIC PROTOCOLS; DIRECT COMMUNICATIONS; GENERAL NETWORKS; INFORMATION-THEORETIC LOWER BOUNDS; SECURE NETWORK CODING; THRESHOLD SECRET SHARING;

ALGORITHMS; COMMUNICATION; CRYPTOGRAPHY; INFORMATION THEORY; NETWORK CODING;

COMPLEX NETWORKS;

EID: 84890348734     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620657     Document Type: Conference Paper

References (13)

1. A. Shamir, "How to share a secret, " Communications of the ACM, vol. 22, no. 11, pp. 612-613, 1979.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation, " in ACM STOC, 1988.
3. T. Pedersen, "A threshold cryptosystem without a trusted party, " in Advances in Cryptology-EUROCRYPT, 1991, pp. 522-526.
4. M. Storer, K. Greenan, E. Miller, and K. Voruganti, "Potshards: A secure, recoverable, long-term archival storage system, " ACM Trans. on Storage, 2009.
5. D. Dolev, C. Dwork, O. Waarts, and M. Yung, "Perfectly secure message transmission, " Journal of the ACM, vol. 40, no. 1, pp. 17-47, 1993.
6. N. Cai and R. Yeung, "Secure network coding on a wiretap network, " IEEE Trans. on Inf. Th., Jan. 2011.
7. J. Feldman, T. Malkin, C. Stein, and R. Servedio, "On the capacity of secure network coding, " in Allerton Conf., 2004.
8. H. Yao, D. Silva, S. Jaggi, and M. Langberg, "Network codes resilient to jamming and eavesdropping, " in NetCod, 2010.
9. C. Ngai and R. Yeung, "Secure error-correcting (sec) network codes, " in NetCod, 2009.
10. T. Ho, M. Ḿedard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast, " IEEE Trans. Inf. Th., Oct. 2006.
11. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction, " IEEE Trans. Inf. Th., Jun. 2005.
12. N. B. Shah, K. V. Rashmi, and K. Ramchandran, "Secure network coding for distributed secret sharing with low communication cost. " Available: arXiv:1207. 0120
13. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for the MSR and MBR points via a product-matrix construction, " IEEE Trans. Inf. Th., Aug. 2011.