计算机研究与发展
計算機研究與髮展
계산궤연구여발전
Journal of Computer Research and Development
2015年
8期
1862-1872
,共11页
谭霜%何力%陈志坤%贾焰
譚霜%何力%陳誌坤%賈燄
담상%하력%진지곤%가염
云存储%格理论%公开验证%数据完整性验证%同态
雲存儲%格理論%公開驗證%數據完整性驗證%同態
운존저%격이론%공개험증%수거완정성험증%동태
cloud storage%lattice theory%public verification%provable data integrity%homomorphic
随着云存储技术的发展,用户可以从远程云中按需获取高质量的应用和服务,而不用担心本地的数据管理存储。由于用户在本地不再保留任何数据副本,故无法确保云中数据的完整性。为了解决这一问题,提出了一种面向于云存储环境的、基于格的数据完有性验证机制,该机制能有效地识别云存储中侵犯用户数据完整性的违规行为,且在随机预言机模型下被证明是安全的。另外,设计的协议还具有其他3种好的属性,即支持数据块级的动态操作、支持签名数据上的同态计算及支持多用户验证。最后,给出了现有的多种完整性验证机制之间的对比,以及基于格的数据完整性验证方法存在的一些问题及发展方向。
隨著雲存儲技術的髮展,用戶可以從遠程雲中按需穫取高質量的應用和服務,而不用擔心本地的數據管理存儲。由于用戶在本地不再保留任何數據副本,故無法確保雲中數據的完整性。為瞭解決這一問題,提齣瞭一種麵嚮于雲存儲環境的、基于格的數據完有性驗證機製,該機製能有效地識彆雲存儲中侵犯用戶數據完整性的違規行為,且在隨機預言機模型下被證明是安全的。另外,設計的協議還具有其他3種好的屬性,即支持數據塊級的動態操作、支持籤名數據上的同態計算及支持多用戶驗證。最後,給齣瞭現有的多種完整性驗證機製之間的對比,以及基于格的數據完整性驗證方法存在的一些問題及髮展方嚮。
수착운존저기술적발전,용호가이종원정운중안수획취고질량적응용화복무,이불용담심본지적수거관리존저。유우용호재본지불재보류임하수거부본,고무법학보운중수거적완정성。위료해결저일문제,제출료일충면향우운존저배경적、기우격적수거완유성험증궤제,해궤제능유효지식별운존저중침범용호수거완정성적위규행위,차재수궤예언궤모형하피증명시안전적。령외,설계적협의환구유기타3충호적속성,즉지지수거괴급적동태조작、지지첨명수거상적동태계산급지지다용호험증。최후,급출료현유적다충완정성험증궤제지간적대비,이급기우격적수거완정성험증방법존재적일사문제급발전방향。
Using the cloud storage technology ,users can outsource their data to the cloud .Such outsourcing meets the requirements of saving hardware costs and simplifying data management , because they no longer store any copies of the data in their local memory ,and users cannot fully ensure whether the outsourced data are intact overall .Further ,considering the client's constrained computing power and the large size of the outsourced data ,the client cannot take the extra time and effort to verify the data correctness in cloud environment .Therefore ,ensuring the integrity of the outsourced data would lead to many security threats .In order to solve this problem ,in this paper ,we present lattice‐based provable data integrity for checking the integrity of the data in the cloud .The proposed scheme not only detects any violations of client data in the cloud ,but also has been proven to be safe in a random oracle .In particular ,as opposed to schemes based on factoring or discrete log ,the proposed scheme resists the cryptanalysis by quantum algorithms .Moreover ,the proposed protocol has three other good attributes ,namely support for data dynamics ,computing on signed data ,and multi‐client verification .Finally ,we present a comparison of the existing data integrity verification mechanism ,as well as some open problems of lattice‐based provable data integrity .