期刊文献+

可公开验证的属性基数据可恢复性证明方案 被引量:2

Attribute-based proof of retrievability with public verifiability
下载PDF
导出
摘要 数据可恢复性证明方案可以有效解决用户将数据存储在不诚实的服务器上时,需要对数据的完整性进行验证的问题。针对目前存在的大部分方案都是使用的基于身份的密码体制的问题,采用更直观灵活的基于属性的密码体制设计了基于属性的数据可恢复性证明方案。给出了方案的相关定义、安全模型和具体的构造,同时证明了方案的正确性和安全性。 When the user stores the data on a dishonest server,the integrity of the data needs to be verified,so the proof-of-retrievability(POR)system is proposed.Aiming at the problem of identity-based cryptosystem used in most of the existing solutions,a more intuitive and flexible attribute-based cryptosystem is adopted to design an attribute-based data recoverability proof scheme.This paper firstly proposed definition and model of an attribute-based proof of retrievability with public verifiability,then,constructed an attribute-based proof of retrievability with public verifiability,finally,it proves its correctness and security.
作者 任燕 唐春明 Ren Yan;Tang Chunming(School of Mathematics&Information Technology,Yuncheng University,Yuncheng Shanxi 044000,China;Key Laboratory of Information Security,School of Mathematics&Information Science,Guangzhou University,Guangzhou 510006,China)
出处 《计算机应用研究》 CSCD 北大核心 2020年第2期544-546,共3页 Application Research of Computers
基金 广东省信息安全技术重点实验室开放课题基金资助项目(GDXXAQ2016-05) 山西省自然科学基金资助项目(20161D021014) 山西省高等学校科技创新项目(2019L0860) 运城学院博士启动基金资助项目(2014-03).
关键词 云计算 基于属性密码学 数据可恢复证明 公开验证 cloud computing attribute-based cryptography proof-of-retrievability public verifiability
  • 相关文献

参考文献1

二级参考文献16

  • 1Juels A, Kaliski-Jr B S. Pors: Proofs of retrievability for large files. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007. Alexandria: ACM, 2007. 584-597.
  • 2Ateniese G, Burns R C, Curtmola R, et al. Provable data possession at untrusted stores. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007. Alexandria: ACM, 2007. 598-609.
  • 3Bowers K D, Juels A, Oprea A. Proofs of retrievability: Theory and implementation. In: Proceedings of the 2009 ACM Workshop on Cloud Computing Security, CCSW 2009. Chicago: ACM, 2009. 43-54.
  • 4Odis Y, Vadhan S P, Wichs D. Proofs of retrievability via hardness amplification. In: Reingold O, ed. Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009. Lecture Notes in Computer Science, vol. 5444. San Francisco: Springer-Verlag, 2009. 109-127.
  • 5Wang Q, Wang C, Li J, et al. Enabling public verifiability and data dynamics for storage security in cloud computing. In: Proceedings of the 14th European Symposium on Research in Computer Security, ESORICS 2009. Saint-Malo: Springer-Verlag, 2009. 355-370.
  • 6Shacham H, Waters B. Compact proofs of retrievability. In: Advances in Cryptology - ASIACRYPT 2008, 14th Interna- tional Conference on the Theory and Application of Cryptology and Information Security. Melbourne: Springer-Verlag, 2008. 90-107.
  • 7Goldreich O. Foundations of Cryptography: Basic Tools. Volume Basic Tools. Cambridge: Cambridge University Press, 2001.
  • 8Christopher Erway C, Kfip~ii A, Papamanthou C, et al. Dynamic provable data possession. In: Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009. Chicago: ACM, 2009. 213-222.
  • 9Boneh D, Boyen X, Shacham H. Short group signatures. In: Proceedings of CRYPTO 2004, LNCS series. Santa Barbara: Springer-Verlag, 2004. 41-55.
  • 10Bowers K D, Juels A, Oprea A. Hail: A high-availability and integrity layer for cloud storage. In: ACM Conference on Computer and Communications Security, CCS 2009. Chicago: ACM, 2009. 187-198.

共引文献9

同被引文献36

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部