欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
多解密加密是在多用户的典型应用密码的分支。在多解密加密，一条消息以方法在多重 decrypter 的公共密钥下面被加密仅仅所有 decrypt ers 合作，消息能被读。然而，用标准途径的多解密加密的小实现导致重计算费用；作为接收装置组成长的长密文膨胀。这在无线环境消费宝贵带宽，例如活动特定的网络。在这篇论文，我们建议有效身份基于多解密加密计划，它仅仅需要一或零(如果预先计算的) 配对计算；密文包含仅仅元素不管接收装置是多少的三个组。而且，我们为计划给一个正式安全定义，；证明计划被选在随机的神谕模型安全的密文，；讨论怎么修改计划抵抗选择密文攻击。
英文摘要：
Multi-decrypter encryption is a typical application in multi-user cryptographic branches. In multi-decrypter encryption, a message is encrypted under multiple decrypters＇ public keys in the way that only when all the decrypters cooperate, can the message be read. However, trivial implementation of multi-decrypter encryption using standard approaches leads to heavy computation costs and long ciphertext which grows as the receiver group expands. This consumes much precious bandwidth in wireless environment, such as mobile ad hoc network. In this paper, we propose an efficient identity based multi-decrypter encryption scheme, which needs only one or zero （if precomputed） pairing computation and the ciphertext contains only three group elements no matter how many the receivers are. Moreover, we give a formal security definition for the scheme, and prove the scheme to be chosen ciphertext secure in the random oracle model, and discuss how to modify the scheme to resist chosen ciphertext attack.
同期刊论文项目
同项目期刊论文
How to compute modular exponentiation with large operators based on the right-to-left binary algorit
期刊信息
位置：