Lightweight Identity-based Signature Scheme Without Bilinear Pairings
Dingyi Pei · Jisuanji gongcheng · 2012
Most available Identity-based signature schemes require expensive bilinear pairing operation,which leads to inefficient signature algorithm.In order to solve the problem,this paper proposes a new identity-based lightweight signature scheme without bilinear pairings.It is provably secure,and can resist chosen message attack in the random oracle model.Theoretical analysis shows that compared with other schemes,new scheme has lower computation cost and communication overhead,so it is suitable for secure communication protocols of key management and secure routing.