关键词: 基于身份密码学, 多代理多签名, 计算Diffie-Hellman问题, 标准模型

Abstract: There are a few Identity-Based Multi-Proxy Multi-Signature（IBMPMS） schemes in literatures. Some of them have no acceptable formal security proof, others are proven security in the random oracle model. But the random oracle model depends on a random oracle that cannot be implemented in the real world, while security game of the standard model is fully transparent. Based on the Paterson-signature scheme, a new IBMPMS scheme is put forwards. Combined the adversary models of （multi-）proxy （multi-）signature and the standard model proposed by Paterson, a standard model for IBMPMS schemes is defined. In the standard model, the security of the new IBMPMS scheme is deduced to a polynomial time adversary solving computational Diffie-Hellman problem, which indicates that the new IBMPMS scheme achieves provable security in the standard model.

Key words: identity-based cryptography, multi-proxy multi-signature, computational Diffie-Hellman problem, standard model