首页> 外文期刊>Cluster computing >Identity-based proof of retrievability meets with identity-based network coding
【24h】

Identity-based proof of retrievability meets with identity-based network coding

机译:Identity-based proof of retrievability meets with identity-based network coding

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

摘要

Abstract Network coding and cloud storage are two quite different areas in their nature and were studied independently in the past years. In recent years, researchers had proposed many identity-based network coding (IB-NC) schemes for network coding, and identity-based proof-of-retrievability (IB-PoR) protocols for cloud storage. The common feature lies in that both IB-NC scheme and IB-PoR protocol avoid the tedious management of public key certificates. In this paper, for the first time, we reveal an intrinsic relationship between IB-NC scheme and IB-PoR protocol. More specifically, we will first present how to generally construct an IB-PoR protocol from any IB-NC scheme. In the opposite direction, because of the impossibility of black-box construction proposed by Chen et al. in their classical work, we propose a new notion named admissible IB-PoR protocol and describe how to obtain IB-NC scheme from any admissible IB-PoR protocol. We remark that our constructions are systematic and hence one can naturally get a series of IB-NC schemes or IB-PoR protocols, which will greatly enrich the current constructions for both network coding and cloud storage. Furthermore, we analyze and prove the security of the transformed scheme, which is based on the underlying one. Finally, in order to show the power of our general transformations, we propose two concrete instantiations and present the detailed simulations, which are based on recently proposed schemes.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号