Ge Luo
ABSTRACT
To consider construction of strongly secure network coding scheme without universality, this paper focuses on properties of MDS(maximum distance separable) codes, especially, Reed-Solomon codes. Our scheme applies Reed-Solomon codes in coset coding scheme to achieve the security based on the classical underlying network coding. Comparing with the existing scheme, MRD(maximum rank distance) code and a necessary condition based on MRD are not required in the scheme. Furthermore, considering the conditions between the code for security and the underlying network code, the scheme could be applied for more situations on fields.
- Ahlswede, R., Cai, N., Li, S. Y., & Yeung, R. W. (2000). Network information flow. IEEE Transactions on information theory, 46(4), 1204--1216. Google Scholar
Digital Library
- Li, S. Y., Yeung, R. W., & Cai, N. (2003). Linear network coding. IEEE transactions on information theory, 49(2), 371--381. Google ScholarDigital Library
- Cai, N., & Yeung, R. W. (2002). Secure network coding. In Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on (p. 323). IEEE..Google Scholar
- Feldman, J., Malkin, T., Stein, C., & Servedio, R. A. (2004, September). On the capacity of secure network coding. In Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing (pp. 63--68).Google Scholar
- El Rouayheb, S. Y., & Soljanin, E. (2007, June). On wiretap networks II. In2007 IEEE International Symposium on Information Theory (pp. 551--555). IEEE.Google ScholarCross Ref
- Ozarow, L. H., & Wyner, A. D. (1984). Wire-Tap Channel II. AT&T Bell Laboratories technical journal, 63(10), 2135--2157.Google Scholar
- L. H. Ozarow and A. D. Wyner, "Wire-tap channel II," in Proc. EUROCRYPT 84 Workshop on Adv. Cryptology: Theory and Appl. Cryptograph.Tech., New York, 1985, pp. 33--51, Springer-Verlag. Google ScholarDigital Library
- K. Bhattad and K. R. Narayanan, "Weakly secure network coding," in Proc. NetCod 2005, Riva del Garda, Italy, Apr. 2005.Google Scholar
- Silva, D., & Kschischang, F. R. (2009, June). Universal weakly secure network coding. In Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on (pp. 281--285). IEEE.Google Scholar
- Silva, D., & Kschischang, F. R. (2011). Universal secure network coding via rank-metric codes. IEEE Transactions on Information Theory, 57(2), 1124--1135. Google ScholarDigital Library
- Harada, K., & Yamamoto, H. (2008). Strongly secure linear network coding.IEICE transactions on fundamentals of electronics, communications and computer sciences, 91(10), 2720--2728. Google ScholarDigital Library
- Silva, D., & Kschischang, F. R. (2008, July). Security for wiretap networks via rank-metric codes. In 2008 IEEE International Symposium on Information Theory (pp. 176--180). IEEE.Google ScholarCross Ref
- Matsumoto, R., & Hayashi, M. (2011). Universal strongly secure network coding with dependent and non-uniform messages. arXiv preprint arXiv:1111.4174.Google Scholar
- B Kurosawa, K., Ohta, H., & Kakuta, K. (2013, November). How to construct strongly secure network coding scheme. In International Conference on Information Theoretic Security (pp. 1--17). Springer International Publishing.Google Scholar
- Nishiara, M., & Takizawa, K. (2009). Strongly secure secret sharing scheme with ramp threshold based on Shamir's polynomial interpolation scheme.IEICE Trans. Fundamentals (Japanese Edition), 92, 1009--1013.Google Scholar
- Kurihara, J., Uyematsu, T., & Matsumoto, R. (2012, July). Explicit construction of universal strongly secure network coding via MRD codes. InInformation Theory Proceedings (ISIT), 2012 IEEE International Symposium on (pp. 1483--1487).IEEE.Google Scholar
- Wicker, S. B., & Bhargava, V. K. (1999). Reed-Solomon codes and their applications. John Wiley & Sons. Google ScholarDigital Library
- Xu, Y., & Zhang, T. (2002). Variable shortened-and-punctured Reed-Solomon codes for packet loss protection. IEEE transactions on broadcasting, 48(3), 237--245.Google Scholar
- Zhang, Z., & Zhuang, B. (2009, October). An application of the relative network generalized Hamming weight to erroneous wiretap networks. InInformation Theory Workshop, 2009. ITW 2009. IEEE (pp. 70--74). IEEE.Google Scholar
Recommendations
A class of constacyclic codes are generalized Reed–Solomon codes
AbstractMaximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed–Solomon (GRS) codes. The square of a linear code ...
Generic Reed-Solomon Codes Achieve List-Decoding Capacity
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingIn a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization of MDS codes. An order-ℓ MDS code, denoted by MDS(ℓ), has the property that any ℓ subspaces formed from columns of its generator matrix intersect as ...
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes
AbstractSelf-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS (NMDS) codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual NMDS codes. In this paper, we ...
Comments