Papers
Topics
Authors
Recent
Search
2000 character limit reached

Secure network coding with adaptive and active attack

Published 17 Nov 2023 in cs.IT and math.IT | (2311.10297v2)

Abstract: Ning Cai and the author jointly studied secure network codes over adaptive and active attacks, which were rarely studied until these seminal papers. This paper reviews the result for secure network code over adaptive and active attacks. We focus on two typical network models, a one-hop relay network and a unicast relay network.

Authors (1)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. N. Cai and R. Yeung, “Secure network coding,” Proc. 2002 IEEE Int. Symp. Information Theory (ISIT 2002), Lausanne, Swiss, July 2002, p. 323.
  2. N. Cai and R. W. Yeung, “Secure Network Coding on a Wiretap Network,” IEEE Trans. Inform. Theory, vol. 57, no. 1, 424 – 435 (2011).
  3. R. W. Yeung and N. Cai, “On the optimality of a construction of secure network codes,” Proc. 2008 IEEE Int. Symp. Information Theory (ISIT 2008), Toronto, ON, Canada, Jul. 6 – 11, 2008, pp. 166 – 170.
  4. T. Chan and A. Grant, “Capacity bounds for secure network coding,” Proc. Australian Commun. Theory Workshop, Christchurch, NZ, Jan. 30 – Feb. 1, 2008, pp. 95 – 100.
  5. S. El Rouayheb, E. Soljanin, and A. Sprintson, “Secure network coding for wiretap, networks of type II,” IEEE Trans. Inform. Theory, vol. 58, no. 3, pp. 1361 – 1371 (2012).
  6. J. Feldman, T. Malkin, C. Stein, and R. A. Servedio, “On the capacity of secure network coding,” Proc. 42nd Annu. Allerton Conf. Commun. Control Comput., Monticello, IL, Sep. 29 – Oct. 1, 2004.
  7. C.-K. Ngai, R. W. Yeung, and Z. Zhang, “Network generalized hamming weight,” Proc. Workshop Network Coding Theory Appl., Lausanne, Switzerland, 2009, pp. 48 – 53.
  8. K. Harada and H. Yamamoto, “Strongly secure linear network coding,” IEICE Trans. Fund., vol. E91-A, no. 10, pp. 2720 – 2728 (2008).
  9. N. Cai, “Valuable messages and random outputs of channels in linear network coding,” Proc. 2009 IEEE Int. Symp. Information Theory (ISIT 2009), Seoul, Korea, Jun. 28 – Jul. 3, 2009, pp. 413 – 417.
  10. N. Cai and T. Chan, “Theory of Secure Network Coding,” Proceedings of the IEEE, vol. 99, no. 3, 421 – 437 (2011).
  11. D. Silva and F. R. Kschischang, “Universal Secure Network Coding via Rank-Metric Codes,” IEEE Trans. Inform. Theory, vol. 57, no. 2, 1124 – 1135 (2011).
  12. J. Kurihara, R. Matsumoto, and T. Uyematsu, “Relative generalized rank weight of linear codes and its applications to network coding,” IEEE Trans. Inform. Theory, vol. 61, no. 7, pp. 3912 – 3936 (2013).
  13. R. Matsumoto and M. Hayashi, “Secure Multiplex Network Coding,” 2011 International Symposium on Networking Coding (2011): DOI: 10.1109/ISNETCOD.2011.5979076.
  14. R. Matsumoto and M. Hayashi, “Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages,” IEEE Trans. Inform. Theory, vol. 63, no. 6, pp. 3773 – 3782 (2017).
  15. M. Hayashi, M. Owari, G. Kato, and N. Cai, “Secrecy and Robustness for Active Attack in Secure Network Coding,” Proc. 2017 IEEE Int. Symp. Information Theory (ISIT 2017), Aachen, Germany, June, 25 – 30, 2017, pp. 1172 – 1177.
  16. M. Hayashi and N. Cai, “Asymptotically Secure Network Code for Active Attacks” IEEE Transactions on Communications, vol. 69, no. 5, pp. 3245 – 3259 (2021).
  17. M. Hayashi and N. Cai, “Secure non-linear network code over one-hop relay network,” IEEE Journal on Selected Areas in Information Theory vol. 2, no. 1, pp. 296 – 305 (2021).
  18. M. Hayashi, M. Owari, G. Kato, and N. Cai, “Reduction Theorem for Secrecy over Linear Network Code for Active Attacks,” Entropy, Information Theory, Probability and Statistics Section, Special Issue: Multiuser Information Theory III, 22 (9), 1053 (2020).
  19. N. Cai and M. Hayashi, “Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes,” IEEE Trans. Inform. Theory, vol. 66, no. 3, pp. 1428 – 1448 (2020).
  20. N. Cai and M. Hayashi, “Corrections to “Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes” [Mar 20 1428-1448],” IEEE Trans. Inform. Theory, vol. 66, no. 6, pp. 3954 – 3954 (2020).
  21. J. Wu, G.-L. Long, and M. Hayashi, “Quantum secure direct communication with private dense coding using a general preshared quantum state,” Physical Review Applied, vol. 17, 064011 (2022).
  22. C.-H. F. Fung, X. Ma, and H. F. Chau, “Practical issues in quantum-key-distribution postprocessing,” Phys. Rev. A, vol. 81, 012318 (2010).
  23. M. Hayashi, “Quantum-inspired secure wireless communication protocol under spatial and local Gaussian noise assumptions,” IEEE Access, vol. 10, 29040-29068 (2022).
  24. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network Information Flow,” IEEE Trans. Inform. Theory, vol. 46, no. 4, 1204 – 1216, (2000).
  25. S.-Y. R. Li, R. W. Yeung, and N. Cai, “Linear network coding,” IEEE Trans. Inform. Theory, vol. 49, pp. 371 – 381, 2003.
  26. H. Yao, D. Silva, S. Jaggi, and M. Langberg, “Network Codes Resilient to Jamming and Eavesdropping,” IEEE/ACM Transactions on Networking, vol. 22, no. 6, 1978 - 1987 (2014).
  27. K. Bhattad, and K. R. Narayanan, “Weakly secure network coding,” 1st Workshop on Network Coding, Theory, and App., April 2005.
  28. N. Cai and R. W. Yeung, “A Security Condition for Multi-Source Linear Network Coding,” Proc. 2007 IEEE Int. Symp. Information Theory (ISIT 2007), Nice, France, June 2007, p. 561 – 565.
  29. T. Cui, T. Ho, and J. Kliewer, “Achievable strategies for general secure network coding,” Information Theory and Applications Workshop (ITA), 2010.
  30. T. Cui, T. Ho, and J. Kliewer, “On Secure Network Coding With Nonuniform or Restricted Wiretap Sets,” IEEE Trans. Inform. Theory, vol. 59, pp. 166 – 176, (2013).
  31. T. S. Han, “Nonnegative entropy measures of multivariate symmetric correlations,” Inform. Contr., vol. 36, no. 2, pp. 133 – 156, 1978.
  32. L. H. Ozarow and A. D. Wyner, “Wire-tap channel II,” AT& T Bell Labs. Tech. J., vol. 63, pp. 2135 – 2157, 1984.
  33. A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612 -– 613, 1979.
  34. G. R. Blakley, “Safeguarding cryptographic keys,” Proc. Int. Workshop Manag. Requirement Knowl. (MARK), Jun. 1979, pp. 313–317.
  35. G. R. Blakley and G. A. Kabatianski, “Ideal perfect threshold schemes and MDS codes,” Proc. 1995 IEEE Int. Symp. Information Theory (ISIT 1995), Whistler, BC, Canada, September, 17 – 22, 1995, pp. 77843.
  36. Q. Zhang, S. Kadhe, M. Bakshi, S. Jaggi, and A. Sprintson, “Coding against a limited-view adversary: The effect of causality and feedback,” Proc. 2015 IEEE Int. Symp. Information Theory (ISIT 2015), Hong Kong, Jun. 2015, pp. 2530 -– 2534.
  37. S. Song and M. Hayashi, “Capacity of Quantum Private Information Retrieval with Colluding Servers,” IEEE Trans. Inform. Theory, vol. 67, no. 7, pp. 5491 – 5508 (2021).
  38. M. Hayashi and S. Song, “Unified Approach to Secret Sharing and Symmetric Private Information Retrieval With Colluding Servers in Quantum Systems,” IEEE Trans. Inform. Theory, vol. 69, no. 10, pp. 6537 – 6563 (2023).
  39. H. F. MacNeish, “Euler Squares,” Annals of Mathematics, vol. 23, no. 3, pp. 221-227 (1922).
  40. H. B. Mann, “The construction of orthogonal Latin squares,” Ann. Math. Statist. vol. 13 pp. 418-423 (1942).
  41. R. C. Bose and S. S. Shrikhande, “On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler,” Transactions of the American Mathematical Society, vol. 95, no. 2, pp. 191-209 (1960)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up