A certificateless signature for multi-source network coding

Abstract Comparison with traditional network routing technology, multi-source network coding allows the routers to encode the received data and has the merits of large throughput, strong robustness and fast speed. In addition, certificateless public key cryptosystem (CL-PKC) is both certificate-free and key escrow-free. From now, there is no certificateless signature suitable for multi-source network coding (MSNC-CLS). In view of its wide application in practice, we construct an MSNC-CLS by applying the technique of certificateless signature to the environments of multi-source network coding. In MSNC-CLS, the use of generation can defend the replay attacks and the homomorphism of hash function can simplify the verification process of intermediate nodes. Generation identifier can make the intermediate nodes judge the generation property of message, thus the intermediate nodes can decide whether they encode the message. Analysis shows MSNC-CLS can resist the pollution and forgery attacks; moreover, it has better computation performance than the existing schemes.

[1]  Tong Li,et al.  A Homomorphic Network Coding Signature Scheme for Multiple Sources and its Application in IoT , 2018, Secur. Commun. Networks.

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

[3]  Xie Qi.  Certificateless signature scheme without bilinear pairings , 2012 .

[4]  Kazuki Yoneyama,et al.  Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures , 2015, International Journal of Information Security.

[5]  Weixin Xie,et al.  Utilizing fully homomorphic encryption to implement secure medical computation in smart cities , 2017, Personal and Ubiquitous Computing.

[6]  Alireza Esfahani,et al.  An Efficient Null Space-Based Homomorphic MAC Scheme Against Tag Pollution Attacks in RLNC , 2016, IEEE Communications Letters.

[7]  Tao Jiang,et al.  Security Analysis and Improvements on Two Homomorphic Authentication Schemes for Network Coding , 2016, IEEE Transactions on Information Forensics and Security.

[8]  Weixin Xie,et al.  An Efficient Quantum Somewhat Homomorphic Symmetric Searchable Encryption , 2017 .

[9]  Wang Bin,et al.  Secure network coding against intra/inter-generation pollution attacks , 2013, China Communications.

[10]  Josep M. Miret,et al.  A hybrid approach to vector-based homomorphic tallying remote voting , 2015, International Journal of Information Security.

[11]  Tao Jiang,et al.  An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding , 2013, IEEE Transactions on Computers.

[12]  Xuemin Shen,et al.  Padding for orthogonality: Efficient subspace authentication for network coding , 2011, 2011 Proceedings IEEE INFOCOM.

[13]  Tian Hui,et al.  Power ramping schemes for M2M and H2H Co-existing scenario , 2013, China Communications.

[14]  Pla Information.  Strongly Secure Certificateless Signature Scheme without Pairings , 2010 .

[15]  Athina Markopoulou,et al.  Cooperative Defense Against Pollution Attacks in Network Coding Using SpaceMac , 2011, IEEE Journal on Selected Areas in Communications.

[16]  Nuttapong Attrapadung,et al.  Homomorphic Network Coding Signatures in the Standard Model , 2011, Public Key Cryptography.

[17]  Tao Jiang,et al.  Security analysis of a homomorphic signature scheme for network coding , 2015, Secur. Commun. Networks.