首页> 外文OA文献 >Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings
【2h】

Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings

机译:没有双线性定位的高效无证匿名多接收器加密方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

With the growing development of Internet technology and popularization of mobile devices, we easily access the Internet anytime and anywhere by mobile devices. It has brought great convenience for our lives. But it brought more challenges than traditional wired communication, such as confidentiality and privacy. In order to improve security and privacy protection in using mobile network, numerous multi-receiver identity-based encryption schemes have been proposed with bilinear pairing and probabilistic hap-to-point (HTP) function. To address the troubles of private key escrow in multi-receiver encryption scheme based on ID-PKC, recently, some certificateless anonymous multi-receiver encryption (CLAMRE) schemes are introduced. But previous CLAMRE schemes using the bilinear pairing are not suitable to mobile device because the use of bilinear pairing and probabilistic hash-to-point (HTP) function results in expensive operation costs in encryption or decryption. In this paper, we propose an efficient CLAMRE scheme using elliptic curve cryptography (ECC) without bilinear pairing and HTP hash function. Since our scheme does not use bilinear pairing and HTP operation during the encryption and decryption process, the proposed CLAMRE scheme has much less computation cost than the latest CLAMRE schemes. Performance analysis shows that runtime of our scheme is much less when the sender generates ciphertext, compared with existing schemes. Security analysis shows proposed CLAMRE scheme provides confidentiality of message and receiver anonymity under the random oracle model with the difficulties of decision Diffie-Hellman problem and against the adversaries defined in CL-PKC system.
机译:随着互联网技术和移动设备的普及,越来越多的发展,我们很容易通过移动设备访问互联网随时随地。它为我们的生活带来了极大的方便。但它带来了比传统的有线通信更多的挑战,如保密和隐私。为了提高在使用移动网络的安全和隐私保护,无数多接收基于身份的加密方案被提出与双线性配对和概率HAP对点(HTP)功能。为了解决私人密钥托管的基于身份的PKC多接收加密方案的烦恼,近日,(CLAMRE)方案引入了一些证书匿名多接收加密。但使用双线性对先前CLAMRE方案不适合于移动装置,因为使用双线性配对和概率散列至点(HTP)在加密或解密昂贵的操作成本函数的结果。在本文中,我们采用椭圆曲线加密(ECC),而双线性配对和HTP哈希函数提出了一种高效CLAMRE方案。由于在加密和解密过程中我们的方案不使用双线性配对和HTP操作上,建议CLAMRE方案具有比最新CLAMRE方案计算的成本要少得多。性能分析表明,运行时我们计划的是当要少得多发件人生成密文,与现有的方案相比。安全性分析表明提出CLAMRE机制提供决策的Diffie-Hellman问题的困难随机预言模型下,并针对CL-PKC系统中定义的对手的消息和接收匿名保密。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号