...
首页> 外文期刊>IEEE transactions on dependable and secure computing >Multi-Client Cloud-Based Symmetric Searchable Encryption
【24h】

Multi-Client Cloud-Based Symmetric Searchable Encryption

机译:基于多客户的云的对称搜索可搜索加密

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

摘要

We propose a multi-client Symmetric Searchable Encryption (SSE) scheme based on the single-user protocol [3]. The scheme allows any user to generate a search query by interacting with any theta - 1 (theta is a threshold parameter) 'helping' users. It preserves the privacy of a database content against the server assuming a leakage of up to theta - 1 users' keys to the server while hiding the query from the theta - 1 'helping users'. To achieve the query privacy, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the 'helping' users. We present a concrete construction of our randomizable distributed PRF. By distributing the utilized keys among the users, the need for a constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against a user key exposure. We extended our scheme to support user revocation in two different scenarios. In addition, we give a solution for fast update of the encryption key with the overhead significantly smaller than the re-encryption and re-uploading the database. Moreover, our scheme is secure against passive and active collusion between the server and a subset of users.
机译:我们提出了一种基于单用户协议[3]的多客户对称可搜索的加密(SSE)方案。该方案允许任何用户通过与任何THETA-1交互来生成搜索查询(THETA是阈值参数)'帮助'用户。假设从THETA-1'帮助用户'隐藏查询的情况下,假设泄漏到服务器的服务器对服务器的泄漏保留数据库内容的隐私。为了实现查询隐私,我们设计了一个新的分布式键 - 同性恋伪音功能(PRF),它从“帮助”用户中隐藏PRF输入(搜索关键字)。我们提出了我们随机分布式PRF的具体建设。通过在用户中分发利用密钥,消除了对数据所有者的常量在线存在以向用户提供服务,同时为用户键曝光提供弹性。我们扩展了我们的计划,以支持两个不同场景中的用户撤销。此外,我们提供了快速更新加密密钥的解决方案,其开销明显小于重新加密并重新上传数据库。此外,我们的计划是防止服务器和用户子集之间的被动和主动勾结的安全。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号