Padding for orthogonality: Efficient subspace authentication for network coding

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1026-1034

  Zhang, Peng ^a   Jiang, Yixin ^a   Lin, Chuang ^a   Yao, Hongyi ^b   Wasef, Albert ^c   Shenz, Xuemin ^c  

^a TSINGHUA UNIVERSITY   (China)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION MECHANISMS; LOW-BANDWIDTH; ORTHOGONALITY; POLLUTION ATTACK; PUBLIC KEYS; SIGNATURE SCHEME; STORE AND FORWARD; SYMMETRIC KEYS; VERIFICATION PROCESS;

AUTHENTICATION; INFORMATION THEORY; POLLUTION;

NETWORK CODING;

EID: 79960873240     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934876     Document Type: Conference Paper

References (27)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. on Iriformation Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. D. Lun, M. Medard, R. Koetter, and M. Effros, "Further results on coding for reliable communication over packet networks;" in Proc. of IEEE International Symposium on Information Theory, Sept. 2005.
3. Y. Wu, P. A. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding," IEEE Trans. on Communications, vol. 54, no. 11, Nov. 2005.
4. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. of IEEE International Symposium on Iriformation Theory, Jun. 2003.
5. C. Gkantsidis and P. Rodriguez, "Network coding for large scale file distribution," in Proc. of IEEE INFOCOM, Mar. 2005.
6. Z. Liu, C. Wu, B. Li, and S. Zhao, "UUSee: Large-scale operational on-demand streaming with random network coding," in Proc. of IEEE INFOCOM, Mar. 2010.
7. S. Chachulski, M. Jennings, S. Katti, and D. Katabi, "Trading structure for randomness in wireless opportunistic routing," in Proc. of ACM SIGCOMM, Aug. 2007.
8. T. Ho, B. Leong, R. Koetter, M. Medard, M. Effros, and D. Karger, "Byzantine modification detection in multicast networks using randomized network coding," in Proc. of IEEE IEEE International Symposium on Information Theory, Jun. 2004.
9. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Medard, "Resilient network coding in the presence of byzantine adversaries," in Proc. of IEEE INFOCOM, May 2007.
10. M. Krohn, M. Freedman, and D. Mazieres, "On-the-fly verification of rateless erasure codes for efficient content distribution," in Proc. of IEEE Symposium on Security and Privacy, May 2004.
11. C. Gkantsidis and P. Rodriguez, "Cooperative security for network coding file distribution," in Proc. of IEEE INFOCOM, Apr. 2006.
12. Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An efficient signature-based scheme for securing network coding against pollution attacks," in Proc. of IEEE INFOCOM, Apr. 2008.
13. F. Zhao, T. Kalker, M. Medard, and K. J. Han, "Signatures for content distribution with network coding," in Proc. of IEEE IEEE International Symposium on Iriformation Theory, Jun. 2007.
14. D. Boneh, D. Freeman, J. Katz, and B. Waters, "Signing a linear subspace: Signature schemes for network coding," in Proc. of International Coriference on Practice and Theory in Public Key Cryptography, 2009.
15. Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An efficient scheme for securing XOR network coding against pollution attacks," in Proc. of IEEE INFOCOM, Apr. 2009.
16. S. Agrawal and D. Boneh, "Homomorphic MACs: MAC-based integrity for network coding," in Proc. of International Conference on Applied Cryptography and Network Security, Jun. 2009.
17. Y. Li, H. Yao, M. Chen, S. Jaggi, and A. Rosen, "RIPPLE authentication for network coding," in Proc. of IEEE INFOCOM, Mar. 2010.
18. E. Kehdi and B. Li, "Null keys: limiting malicious attacks via null space properties of network coding," in Proc. of IEEE INFOCOM, Apr. 2009.
19. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. P inkas, "Multicast security: A taxonomy and some efficient constructions," in Proc. of IEEE INFOCOM, Mar. 1999.
20. P. A. Chou, Y. Wu, and K. Jain, "P ractical network coding," in Proc. of the Allenon Conference, Oct. 2003.
21. D. Boneh and M. Franklin, "An efficient public key traitor tracing scheme," in Proc. of CRYPTO"99, Aug. 1999.
22. J. Katz and Y. Lindell, Introduction to modern cryptography. Chapman & HaIVCRC, 2008.
23. P. L. Montgomery, "Modular multiplication without trial division," Mathematics of Computation, vol. 44, no. 170, pp. 519-521, 1985.
24. Y. Fan, Y. Jiang, H. Zhu, and X. Shen, "An efficient privacy-preserving scheme against traffic analysis in network coding," in Proc. of IEEE INFOCOM, Apr. 2009.
25. P. Zhang, Y. Jiang, C. Lin, Y. Fan, and X. Shen, "P-Coding: Secure network coding against eavesdropping attacks," in Proc. of IEEE INFOCOM, Mar. 2010.
26. Y. Jiang, Y. Fan, X. Shen, and C. Lin, "A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding," Computer Networks, vol. 53, no. 18, pp. 3089-3101, Dec. 2009.
27. A. Yun, J. H. Cheon, and Y. Kim, "On homomorphic signatures for network coding," IEEE Trans. on Computers, vol. 59, no. 9, pp. 1295- 1296, Mar. 2010.