A Data Integrity Scheme Based on Homomorphic Hash Function for Multi-source Network Coding

The integrity scheme for a single source based on homomorphic signature cannot handle a combined message's signature from multiple sources with different private keys. The main reason is that the signature schemes will not hold the homomorphism if the unique secret key is replaced by distinct private keys. This also means the forwarding nodes could not generate a valid signature for a combined message without knowing the source keys. In this paper, taking advantage of vector Merge algorithm and homomorphic hash function, we propose an efficient data integrity scheme for multi-source securing network coding against pollution attacks. Firstly, each source node computes raw massage's hash values and uses a secure mechanism to sign the hash values, and then appends the hash values and its signatures to each message sending to forwarding nodes and sink nodes. The forwarder can verify the integrity of network coded data from different source nodes without knowing the sources private keys and generate the hash for the combined messages. The security of the scheme relies on the Discrete Logarithm problem and Co-Diffie-Hellman problem.

[1]  Dan Boneh,et al.  Preventing Pollution Attacks in Multi-Source Network Coding , 2010, IACR Cryptol. ePrint Arch..

[2]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[3]  Bogdan Warinschi,et al.  Efficient Network Coding Signatures in the Standard Model , 2012, Public Key Cryptography.

[4]  Dawn Xiaodong Song,et al.  Homomorphic Signature Schemes , 2002, CT-RSA.

[5]  Jonathan Katz,et al.  Secure Network Coding Over the Integers , 2010, IACR Cryptol. ePrint Arch..

[6]  Kamal Jain,et al.  Signatures for Network Coding , 2006 .

[7]  Ying Zhu,et al.  Multicast with network coding in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[8]  Yun Ling,et al.  Efficient multiple sources network coding signature in the standard model , 2013, Concurr. Comput. Pract. Exp..

[9]  Shyamkishor Kumar.  NETWORK CODING THE CASE OF MULTIPLE UNICAST SESSIONS , 2015 .

[10]  László Czap,et al.  Signatures for Multi-source Network Coding , 2010, IACR Cryptol. ePrint Arch..

[11]  Fang Zhao,et al.  Signatures for Content Distribution with Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[12]  Hong Yang,et al.  An Unconditionally Secure Authentication Code For Multi-Source Network Coding , 2012 .

[13]  Muriel Medard,et al.  On network coding for security , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[14]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[15]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[16]  R. Koetter,et al.  Network Coding for Efficient Wireless Unicast , 2006, 2006 International Zurich Seminar on Communications.

[17]  Yong Guan,et al.  An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[19]  Jonathan Katz,et al.  Signing a Linear Subspace: Signature Schemes for Network Coding , 2009, IACR Cryptol. ePrint Arch..

[20]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[21]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[22]  David Mazières,et al.  On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.