Research On The Construction Of Leakage-resilient Digital Signature Schemes

Traditional cryptography considers the security of cryptosystems when the at-tackers have no access to the secret key.However,due to the imperfect implementation of cryptosystems,adversaries are able to obtain secret state of the systems via side-channel attacks,which are not considered in the traditional security notions of cryptographic primi-tives,and thus break their security.Leakage-resilient cryptography was proposed to prevent adversaries from doing so.There are fruitful literatures about leakage-resilient encryption.However,few works about signature schemes in leakage setting are proposed.In this work,we focus on the transformations between different types of digital signature primitives in leak-age setting,including strongly unforgeable signature,identity-based signature,certificateless signature,dual form signature and ring signature.More precisely,we make the following contributions in this paper.Firstly,we present a key-modification-free generic construction in both the bounded leakage model and the auxiliary input model.Furthermore,we review the folklore generic constructions of identity-based signature and certificateless signature,and show that if the un-derlying primitives are leakage-resilient,so are the resulting identity-based signature scheme and certificateless signature scheme.The leakage rate follows the minimum one of the un-derlying primitives.We also show some instantiations of these generic constructions.Secondly,we extend the framework of Dual Form Signatures proposed by Gerbush et al.to the leakage setting.Applying this framework,we present a dual form signature scheme based on static assumptions with leakage bound?n-1-2c?log p₂where n is a positive integer greater than or equal to 2 and c is a fixed positive constant,which can be easily extended to the continual leakage model as well.Finally,we propose a new black-box construction of ring signature under this new model and two concrete constructions with leakage bound??n-1?log q-??log k??,whose security is reduced to the intractability of computational Diffie-Hellman problem and leakage-resilient hard relation.