适用于物联网环境的椭圆曲线短签密方案

Efficient Short Signcryption from Pairings in Internet of Things

相比基本签密方案,短签密计算量与通信量小,密文长度短,实现效率高,更适合于物联网资源受限的应用环境。基于双线性对运算提出了一个高效的椭圆曲线短签密方案,在Random Oracle模型下分析了方案ind-cca2模型下的机密性、uf-cma模型下的不可伪造性及不可否认性与可公开验证性,对比分析了方案的运算量与通信量。方案能以更低的系统开销实现较高的安全性,特别适合于物联网动态、异构、资源受限的网络环境。

Compared with basic signcryption schemes, short signcryption proves to be more efficient and applicable to the Internet of things with its lower cost in computing and communication and shorter signcryption text. An efficient elliptic curve short signcryption scheme based on bilinear pairings was proposed with detailed analyses on provable security in Random Oracle, including confidentiality in ind-cca2 model, unforgeability in uf-cma model, non-repudiation and public verifiability. According to the efficiency comparison with other typical signcryption schemes, the new scheme can achieve the same security with much lower cost in computation and communication and thus proves to be suitable for the dynamic, heterogeneous and resource-constrained applications in the Internet of things.