Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages

@article{Matsumoto2017UniversalSM,
  title={Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages},
  author={R. Matsumoto and M. Hayashi},
  journal={IEEE Transactions on Information Theory},
  year={2017},
  volume={63},
  pages={3773-3782}
}
  • R. Matsumoto, M. Hayashi
  • Published 2017
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • We consider the random linear precoder at the source node as a secure network coding. We prove that it is strongly secure in the sense of Harada and Yamamoto and universal secure in the sense of Silva and Kschischang, while allowing arbitrary small but nonzero mutual information to the eavesdropper. Our security proof allows statistically dependent and non-uniform multiple secret messages, while all previous constructions of weakly or strongly secure network coding assumed independent and… CONTINUE READING
    19 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Network Network Coding-Based Post-Quantum Cryptography.
    • PDF
    Network Coding-Based Post-Quantum Cryptography
    • 1
    Secrecy and robustness for active attack in secure network coding
    • 15
    • PDF
    Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution
    • 1
    • PDF
    Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
    • PDF
    Secure network code over one-hop relay network
    • 1
    • PDF
    Secure Quantum Network Coding on Butterfly Network
    • 11
    • PDF

    References

    SHOWING 1-10 OF 46 REFERENCES
    Universal weakly secure network coding
    • 57
    • Highly Influential
    Secure Multiplex Network Coding
    • 26
    • PDF
    Theory of Secure Network Coding
    • N. Cai, T. Chan
    • Mathematics, Computer Science
    • Proceedings of the IEEE
    • 2011
    • 76
    Weakly Secure Network Coding
    • 251
    • PDF
    Secure multiplex coding with a common message
    • R. Matsumoto, M. Hayashi
    • Computer Science, Mathematics
    • 2011 IEEE International Symposium on Information Theory Proceedings
    • 2011
    • 10
    • PDF
    Universal Secure Network Coding via Rank-Metric Codes
    • 144
    • Highly Influential
    • PDF
    Strongly Secure Linear Network Coding
    • 48
    • PDF
    How to attain the ordinary channel capacity securely in wiretap channels
    • 19
    A Security Condition for Multi-Source Linear Network Coding
    • N. Cai, R. Yeung
    • Computer Science
    • 2007 IEEE International Symposium on Information Theory
    • 2007
    • 58
    • PDF
    Secure network coding
    • N. Cai, R. Yeung
    • Mathematics
    • Proceedings IEEE International Symposium on Information Theory,
    • 2002
    • 516