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

摘要： 现有基于身份的多代理多签名方案要么缺乏形式化的安全证明，要么在随机预言模型下可证明安全。但是随机预言模型依赖现实世界无法实现的随机预言机，而标准模型不采用随机预言机，能实现完全透明的安全模拟。以Paterson的签名机制为基础，该文提出一种新的基于身份多代理多签名方案，并且结合（多）代理（多）签名敌手模型和Paterson定义的标准安全模型，定义了基于身份多代理多签名的标准模型。在此模型下，新方案的安全性被规约为多项式时间敌手求解计算Diffie-Hellman问题，实现了可证明安全性。

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