首页> 外文期刊>Journal of network and computer applications >Privacy-preserving composite modular exponentiation outsourcing with optimal checkability in single untrusted cloud server
【24h】

Privacy-preserving composite modular exponentiation outsourcing with optimal checkability in single untrusted cloud server

机译:在单个不受信任的云服务器中具有最佳可检查性的保护隐私的组合模块化幂运算外包

获取原文
获取原文并翻译 | 示例
           

摘要

Outsourcing computing allows users with resource-constrained devices to outsource their complex computation workloads to cloud servers, which is more economical for cloud customers. However, since users lose direct control of the computation task, possible threats need to be addressed, such as data privacy and the correctness of results. Modular exponentiation is one of the most basic and time-consuming operations but widely applied in the field of cryptography. In this paper, we propose two new and efficient algorithms for secure outsourcing of single and multiple composite modular exponentiations. Unlike the algorithms based on two untrusted servers, we outsource modular exponentiation operation to only a single server, eliminating the possible collusion attack with two servers. Moreover, we put forward a new mathematical division method, which hides the base and exponent of the outsourced data, without exposing sensitive information to the cloud server. In addition, compared with other state-of-the-art algorithms, our scheme shows a remarkable improvement in checkability, enabling the user to detect any misbehavior with the optimal probability close to 1. Finally, we use our proposed algorithms as a subroutine to realize Shamir's Identity-Based Signature Scheme and Identity-Based Multi Signatures Scheme.
机译:外包计算允许具有资源受限设备的用户将其复杂的计算工作负载外包给云服务器,这对于云客户而言更为经济。但是,由于用户无法直接控制计算任务,因此需要解决可能的威胁,例如数据隐私和结果的正确性。模幂运算是最基本,最耗时的操作之一,但已广泛应用于密码学领域。在本文中,我们提出了两种新的高效算法,用于安全外包单个和多个复合模块化指数。与基于两个不受信任的服务器的算法不同,我们将模块化指数运算仅外包给单个服务器,从而消除了两个服务器之间可能发生的合谋攻击。此外,我们提出了一种新的数学除法,该方法隐藏了外包数据的基础和指数,而没有将敏感信息暴露给云服务器。此外,与其他最新算法相比,我们的方案显示出可检查性的显着提高,使用户能够以接近1的最佳概率检测到任何不当行为。最后,我们使用我们提出的算法作为以下子例程实现Shamir的基于身份的签名方案和基于身份的多重签名方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号