ID 原文 译文
20335 群组签密既能实现群组签名，又能实现群组加密，但是现有的群组签密方案的发送者和接收者基本上在同一个密码系统中，不能满足现实环境的需求，而且基本上采用的是公钥加密技术，公钥加密技术在加密长消息时效率较低。 Group signcryption is a cryptosystem which can realize group signature and group encryption.However, the message sender and receiver of existing group signcryption schemes are basically in the same cryptosystem, which does not meet the needs of the real environment and the public key encryption technology is basically used, public key encryption technology in encrypted long message efficiency is too low.
20336 因此该文提出由基于身份的密码体制(IBC)到无证书密码体制(CLC)的异构密码系统的混合群组签密方案。 Therefore,this paper proposes a hybrid group signcryption scheme based on heterogeneous cryptosystem from Identity-Based Cryptosystem (IBC) to CertificateLess Cryptosystem (CLC).
20337 在该方案中，私钥生成器(PKG)和密钥生成中心(KGC)能够分别在IBC密码体制和CLC密码体制中产生自己的系统主密钥；而且群组成员只有协作才能解签密，提高了方案的安全性； In the scheme, The Private Key Generator(PKG) in the IBC cryptosystem and Key Generation Center (KGC) in the CLC cryptosystem generate their own system master keys, and group members can only solve signcryption through collaboration, which improves the security of the scheme.
20338 同时在无需更换群组公钥和其他成员私钥的情况下，用户可以动态地加入该群组。 Meanwhile, the user can dynamically join the group without changing the group public key and other members’ private key.
20339 所提方案采用了混合签密，具有可加密任意长消息的能力。 The scheme uses hybrid signcryption and has the ability to encryptany long message.
20340 在随机预言模型下，证明了该文方案在计算Diffie-hellman困难问题下具有保密性和不可伪造性。 It is proved that the scheme satisfies confidentiality and unforgeability in computing the Diffie-hellman hard problem in the random oracle model.
20341 通过理论和数值实验分析表明该方案具有更高的效率和可行性。 Theoretical and numerical analysis shows that the scheme is more efficient and feasible.
20342 为满足未来移动通信网络中多样化的业务需求，为用户提供定制化服务的同时提升网络经济效益，该文提出一种基于在线拍卖的网络切片资源分配算法。 In order to meet the diversified service requirements in future mobile communication networks and provide users with customized services while improving network economic efficiency, a resource allocation algorithm of network slicing based on online auction is proposed.
20343 根据业务类型将用户的服务请求转化为相应投标信息，以最大化拍卖参与者的社会福利为目标，将切片资源分配问题建模为基于多业务的在线赢家确定问题。 The algorithm transforms the service requests of users into the corresponding bidding information according to the service types. For maximizing the social welfare of the auction participants, the slicing resource allocation problem is modeled as a multi-service based online winner determination problem.
20344 结合资源分配与价格更新策略，实现基于在线拍卖的资源优化配置。 Combined with the resource allocation and price updating strategy, the optimal resources allocation based on online auction is achieved.