适用于物联网通信的无证书聚合签密算法

iming at the problem of low computational efficiency of the current certificateless aggregation signcryption (CLASC) scheme, this paper proposed an aggregate signcryption scheme which is suitable for the Internet of things without bilinear pairings. Compared with the current best scheme[15], the efficiency of the scheme is increased by nearly 6 times. The scheme only needs (2n+1) times of dot multiplication operation in the aggregate signcryption stage, and (5n+1) times of dot multiplication operation in the aggregate unsigncryption stage. Based on the discrete logarithm problem, the scheme satisfied confidentiality and the unforgeability under the random oracle model. In the aggregate signcryption verification phase, there is no need to provide the third partys secret information, so the scheme satisfies public verifiability. Finally, it also pointed out that the scheme can achieve higher security at lower computation speed and is more suitable for Internet of things.