格上基于身份的云存储完整性检测方案

田苗苗; 高闯; 陈洁

doi:10.11959/j.issn.1000-436x.2019073

您当前的位置：

首页 >

文章列表页 >

格上基于身份的云存储完整性检测方案

学术论文 | 更新时间：2024-06-05

- 格上基于身份的云存储完整性检测方案
- Identity-based cloud storage integrity checking from lattices
- 通信学报 2019年40卷第4期页码：128-139
- 作者机构：
  
  1. 安徽大学计算机科学与技术学院，安徽合肥 230601
  2. 华东师范大学计算机科学与软件工程学院，上海 200062
- 作者简介：
  
  [ "田苗苗（1987– ），男，安徽阜阳人，博士，安徽大学副教授，主要研究方向为密码学与信息安全。" ]
  [ "高闯（1994– ），男，河南长垣人，安徽大学硕士生，主要研究方向为密码学与信息安全。" ]
  [ "陈洁（1985– ），男，江苏苏州人，博士，华东师范大学研究员，主要研究方向为密码学与信息安全。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61502443);国家自然科学基金资助项目(61772001);国家自然科学基金资助项目(61472142);国家自然科学基金资助项目(U1705264)
- DOI：10.11959/j.issn.1000-436x.2019073
  中图分类号： TP309
- 网络出版日期：2019-04，
  
  纸质出版日期：2019-04-25
- 稿件说明：
移动端阅览
田苗苗, 高闯, 陈洁. 格上基于身份的云存储完整性检测方案[J]. 通信学报, 2019,40(4):128-139.

Miaomiao TIAN, Chuang GAO, Jie CHEN. Identity-based cloud storage integrity checking from lattices[J]. Journal on communications, 2019, 40(4): 128-139.
田苗苗, 高闯, 陈洁. 格上基于身份的云存储完整性检测方案[J]. 通信学报, 2019,40(4):128-139. DOI： 10.11959/j.issn.1000-436x.2019073.

Miaomiao TIAN, Chuang GAO, Jie CHEN. Identity-based cloud storage integrity checking from lattices[J]. Journal on communications, 2019, 40(4): 128-139. DOI： 10.11959/j.issn.1000-436x.2019073.

摘要

随着云存储的快速发展，越来越多的用户将数据存储在云端。为了验证云端的用户数据是否损坏，一种有效的方法是采用云存储完整性检测方案。利用理想格上的小整数解问题，设计了一种基于身份的云存储完整性检测方案，并在随机预言模型下证明了所提方案可以抵抗云服务器的适应性选择身份攻击。为了验证方案的效率，通过实验将所提方案与现有的2种基于身份的云存储完整性检测方案分别进行了比较。实验结果显示，所提方案的标签在线生成时间降低了88.32%～93.74%，证据验证时间降低了98.81%～99.73%。

Abstract

With the rapid development of cloud storage

more and more users are storing their data in the cloud.To verify whether the users’ data stored in the cloud is corrupted

one effective method is to adopt cloud storage integrity checking schemes.An identity-based cloud storage integrity checking scheme was proposed on the small integer solution problem over ideal lattices

and it was proven to be secure against the adaptive identity attacks of clouds in the random oracle model.To validate the efficiency of the scheme

extensive experiments were conducted to make performance-comparisons between the scheme and the existing two identity-based cloud storage integrity checking schemes.The experimental results show that the online tag-generation time and the proof-verification time of the scheme are respectively reduced by 88.32%～93.74% and 98.81%～99.73%.

关键词

Keywords

references

BABCOCK C . 9 worst cloud security threats [N ] . 2014 . http://www.informationweek.com/cloud/infrastructure-as-a-service/9-worst-cloudsecurity-threats/d/d-id/1114085 http://www.informationweek.com/cloud/infrastructure-as-a-service/9-worst-cloudsecurity-threats/d/d-id/1114085 .

ATENIESE G , BURNS R , CURTMOLA R , et al . Provable data possession at untrusted stores [C ] // ACM Conference on Computer and communications security . ACM , 2007 : 598 - 609 .

JUELS A , KALISKI JR B S . Pors:proofs of retrievability for large files [C ] // ACM Conference on Computer and Communications Security . ACM , 2007 : 584 - 597 .

SHACHAM H , WATERS B . Compact proofs of retrievability [C ] // International Conference on the Theory and Application of Cryptology and Information Security . Springer , 2008 : 90 - 107 .

WANG Q , WANG C , REN K , et al . Enabling public auditability and data dynamics for storage security in cloud computing [J ] . IEEE Transactions on Parallel and Distributed Systems , 2011 , 22 ( 5 ): 847 - 859 .

WANG C , CHOW S S M , WANG Q , et al . Privacy-preserving public auditing for secure cloud storage [J ] . IEEE Transactions on Computers , 2013 , 62 ( 2 ): 362 - 375 .

XU Y , DING R , CUI J , et al . Intrusion-resilient public auditing protocol for data storage in cloud computing [C ] // Australasian Conference on Information Security and Privacy . Springer , 2018 : 399 - 416 .

WANG H , WU Q , QIN B , et al . Identity-based remote data possession checking in public clouds [J ] . IET Information Security , 2014 , 8 ( 2 ): 114 - 121 .

YU Y , ZHANG Y , MU Y , et al . Provably secure identity based provable data possession [C ] // International Conference on Provable Security . Springer , 2015 : 310 - 325 .

TIAN M , YE S , ZHONG H , et al . Identity-based proofs of storage with enhanced privacy [C ] // International Conference on Algorithms and Architectures for Parallel Processing . Springer , 2018 : 461 - 480 .

SHAMIR A , . Identity-based cryptosystems and signature schemes [C ] // Annual International Cryptology Conference . Springer , 1984 : 47 - 53 .

SHOR P W . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer [J ] . SIAM Journal on Computing , 1997 , 26 ( 5 ): 1484 - 1509 .

REGEV O , . Lattice-based cryptography [C ] // Annual International Cryptology Conference . Springer , 2006 : 131 - 141 .

XU W , FENG D , LIU J . Public verifiable proof of storage protocol from lattice assumption [C ] // International Conference on Intelligent Control,Automatic Detection and High-End Equipment . IEEE , 2012 : 133 - 137 .

MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures [C ] // Symposium on Foundations of Computer Science . IEEE , 2004 : 372 - 381 .

LIU H , CAO W . Public proof of cloud storage from lattice assumption [J ] . Chinese Journal of Electronics , 2014 , 23 ( 1 ): 186 - 190 .

ZHANG X , XU C , ZHANG Y , et al . Insecurity of a public proof of cloud storage from lattice assumption [J ] . Chinese Journal of Electronics , 2017 , 26 ( 1 ): 88 - 92 .

LIU Z , LIAO Y , YANG X , et al . Identity-based remote data integrity checking of cloud storage from lattices [C ] // International Conference on Big Data Computing and Communications . IEEE , 2017 : > 128 - 135 .

GORBUNOV S , VAIKUNTANATHAN V , WICHS D . Leveled fully homomorphic signatures from standard lattices [C ] // Annual ACM Symposium on Theory of Computing . ACM , 2015 : 469 - 477 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller [C ] // Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer , 2012 : 700 - 718 .

DUCAS L , MICCIANCIO D . Improved short lattice signatures in the standard model [C ] // Annual International Cryptology Conference . Springer , 2014 : 335 - 352 .

LYUBASHEVSKY V , MICCIANCIO D . Generalized compact knapsacks are collision resistant [C ] // International Colloquium on Automata,Languages,and Programming . Springer , 2006 : 144 - 155 .

PEIKERT C , ROSEN A . Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices [C ] // Theory of Cryptography Conference . Springer , 2006 : 145 - 166 .

REGEV O . New lattice-based cryptographic constructions [J ] . Journal of the ACM , 2004 , 51 ( 6 ): 899 - 942 .

GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions [C ] // Annual ACM Symposium on Theory of Computing . ACM , 2008 : 197 - 206 .

AGUILAR-MELCHOR C , BARRIER J , GUELTON S , et al . NFLlib:NTT-based fast lattice library [C ] // Cryptographers’ Track at the RSA Conference . Springer , 2016 : 341 - 356 .

GENISE N , MICCIANCIO D . Faster gaussian sampling for trapdoor lattices with arbitrary modulus [C ] // Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer , 2018 : 174 - 203 .

RUCKERT M , SCHNEIDER M . Estimating the Security of Lattice-based Cryptosystems [J ] .,2010,20101006:091355. IACR Cryptology ePrint Archive , 2010 , 20101006 :091355.

浏览量

783

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

格上基于身份的增量签名方案

基于格的可验证定时签名与应用

基于格的卫星网络轻量化后量子接入认证方案

面向连接关键词可搜索加密的查询恢复攻击

CDBS：基于CRYSTALS-Dilithium算法的盲签名方案