Efficiency optimisation signature scheme for time-critical multicast data origin authentication

A great challenge of providing authentication to time-critical multicast data is the existence of low end-to-end delay in many applications such as pay-TV and the power grid scenarios. Consequently, to balance security and efficiency is still a difficult issue. The group of secret keys reused scheme of TV-HORS still cannot meet the requirements of low time delay of computation. To describe the relationship between security and efficiency for the time-critical multicast communication scenarios, we present a Game Model of Multicast Data Origin Authentication, in this paper. By analysing our model with Shannon's information and game theory, we propose an optimised re-keying scheme, contraposing the TV-HORS scheme. The advantage of breaking the security goal is negligible, even in the lowest risk-level parameter. The experiment results show that our scheme does significantly promote the efficiency of TV-HORS scheme and is the most efficient multicast data origin authentication signature scheme.

[1]  Ran Canetti,et al.  Efficient and Secure Source Authentication for Multicast , 2001, NDSS.

[2]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[3]  Qinghua Li,et al.  Multicast Authentication in the Smart Grid With One-Time Signature , 2011, IEEE Transactions on Smart Grid.

[4]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5]  Klara Nahrstedt,et al.  Time Valid One-Time Signature for Time-Critical Multicast Data Authentication , 2009, IEEE INFOCOM 2009.

[6]  Ralph C. Merkle,et al.  A Certified Digital Signature , 1989, CRYPTO.

[7]  Zhonghong Sun,et al.  Fairness in the presence of semi-rational parties in rational two-party secure computation , 2013, Int. J. Grid Util. Comput..

[8]  Jianfeng Ma,et al.  From security to vulnerability: Data authentication undermines message delivery in smart grid , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[9]  Huaxiong Wang,et al.  Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks , 2003, Selected Areas in Cryptography.

[10]  Jianfeng Ma,et al.  Game Model of Rekeying Strategies , 2012 .

[11]  William D. Neumann HORSE: an extension of an r-time signature scheme with fast signing and verification , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[12]  Ran Canetti,et al.  Efficient authentication and signing of multicast streams over lossy channels , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[13]  Moni Naor,et al.  Multicast security: a taxonomy and some efficient constructions , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[14]  C E Shannon,et al.  The mathematical theory of communication. 1963. , 1997, M.D. computing : computers in medical practice.

[15]  Adrian Perrig,et al.  The BiBa one-time signature and broadcast authentication protocol , 2001, CCS '01.

[16]  Xiaofeng Chen,et al.  Efficient online/offline signcryption without key exposure , 2013, Int. J. Grid Util. Comput..

[17]  Jianfeng Ma,et al.  Authentication and Integrity in the Smart Grid: An Empirical Study in Substation Automation Systems , 2012, Int. J. Distributed Sens. Networks.

[18]  Alexander Apostolov Testing of complex IEC 61850 based substation automation systems , 2008 .

[19]  Jonathan Katz,et al.  Bridging Game Theory and Cryptography: Recent Results and Future Directions , 2008, TCC.

[20]  Leonid Reyzin,et al.  Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying , 2002, ACISP.

[21]  Avishai Wool,et al.  One-Time Signatures Revisited: Have They Become Practical? , 2005, IACR Cryptol. ePrint Arch..