An efficient signature-based scheme for securing network coding against pollution attacks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 2083-2091

  Yu, Zhen ^a   Wei, Yawen ^a   Ramkumar, Bhuvaneswari ^a   Guan, Yong ^a  

^a Iowa State University of Science and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION EFFICIENCY; NETWORK CODING;

APPLICATIONS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER APPLICATIONS; COMPUTER SYSTEMS; KETONES; POLLUTION; POLLUTION DETECTION; PROGRAMMING THEORY; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

COMPUTER NETWORKS;

EID: 51349130622     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.199     Document Type: Conference Paper

References (24)

1. R. Ahlswede. N. Cai. S. Li, and R. Yeung. "Network Information Flow", in IEEE Transactions on Information Theory, Vol 46, No. 4, pp. 1204-1216, 2000.
2. P. Barreto, H. Kim, B. Lynn, and M. Scott, "Efficient Algorithms for Pairing-Based Cryptosystems", in Proc. 22nd Annual International Cryptology Conference on Advances in Cryptology, LNCS, Vol. 2442, pp. 354-368, 2002.
3. M. Bellare, J. Garay. and T. Rabin, "Fast Batch Verification for Modular Exponentiation and Digital Signatures", in Proc. Advances in Cryptology (EUROCRYPT'98), LNCS, Vol. 1403, pp. 236-250, 1998.
4. D. Charles, K. Jian, and K. Lauter, "Signature for Network Coding". Technique Report MSR-TR-2005-159, Microsoft, 2005.
5. P. Chou, Y. Wu, and K. Jain, "Practical Network Coding", in Proc. Allerton Conference on Communication, Control, and Computing, 2003.
6. C. Fragouli, J. Boudec, and J. Widmer, "Network Coding: An Instant Primer", in ACM SIGCOMM Computer Communication Review, Vol. 36, No. 1, 2006.
7. S. Galbraith. K. Harrison, and D. Soldera, "Implementing the Tate Pairing", in Proc. 5th Algorithmic Number Theory Symposium (ANTS V). LNCS, Vol. 2369, pp. 324-337, 2002.
8. C. Gkantsidis and P. Rodriguez, "Network Coding for Large Scale File Distribution", in Proc. IEEE INFOCOM, 2005.
9. C. Gkantsidis and P. Rodriguez. "Cooperative Security for Network Coding File Distribution", in Proc. IEEE INFOCOM, 2006.
10. N. Gura, A. Patel, A. Wander, H. Eberle, and S. Shantz. "Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs", in Proc. 2004 Workshop on Cryptographic Hardware and Embedded Systems (CHES), 2004.
11. T. Ho, R. Koetter, M. Médard, R. Karger, and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting" in Proc. International Symposium on Information Theory (ISIT), 2003.
12. T. Ho, B. Leong, R. Koetter, M. Méard, M. Effros, and D. Karger, "Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding", in Proc. 2004 IEEE International Symposium on Infoimation Theoiy (ISIT). 2004.
13. S. Jaggi, M. Langberg. S. Katti, T. Ho, D. Katabi, and M. Méard, "Resilient Network Coding in the Presence of Byzantine Adversaries", in Proc. IEEE INFOCOM, 2007.
14. A. Joux, "The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems". in Proc. 5th Algorithmic Number Theory Symposium (ANTS V), LNCS, Vol. 2369, pp. 20-32, 2002.
15. M. Krohn, M. Freeman, and D. Mazieres, "On-the-fly Verification of Rateless Erase Codes for Efficient Content Distribution", in Proc. IEEE Symposium on Security and Privacy, 2004.
16. S. Li, R. Yeung, and N. Cai, "Linear Network Coding", in IEEE Transactions on Information Theory, Vol 49, No. 2. pp. 371381, 2003.
17. A. Menezes, T. Okamoto, and S. Vanstone, "Reducing Elliptic Curve Logorithms to Logorithms in a Finite Field", in IEEE Transactions on Information Theory, Vol 39, No. 5, pp. 1639-1646, 1993.
18. V. Miller, "Short Programs for Functions over Curve", unpublished manuscript, http://crypto.stanford.edu/miller/miller.pdf, 1986.
19. MIRACL, Multiprecision Integer and Rational Arithmetic C/C++ Library, http://www.shamus.ie/. Shamus Software Ltd.
20. D. Petrovic, K. Ramchandran. and J. Rabaey. "Overcoming Untuned Radios in Wireless Networks with Network Coding", in IEEE Transactions on Information Theory, Vol 52, No. 6, pp. 2649-2657. 2006.
21. S. Ratnasamy, B. karp. L. Yin, F. Yu, D. Estrin, R. Govindan and S. Shenker. "GHT: A Orographic Hash Table for Data-Centric Storage", in Proc. 1st ACM International Workshop on Wireless Sensor Networks and Applications, (WSNA '02). pp. 78-87, 2002.
22. W. Stallings, Cryptography and Network Security: Principles and Practice, Second Edition, Prentice Hall.
23. A. Liu, P. Kampanakis, and P. Ning, TinyECC: Elliptic Curve Cryptography for Sensor Networks, http://discovery.csc.ncsu.edu/software/TinyECC/.
24. H. Wang and Q. Li, "Efficient Implementation of Public Key Cryptosystems on MicaZ and TelosB Motes". Technical Report WM-CS-2006, College of William and Mary, 2006.