Secure distributed storage for information dissemination and retrieval at the tactical edge

R. Johnston, Sun-il Kim
{"title":"Secure distributed storage for information dissemination and retrieval at the tactical edge","authors":"R. Johnston, Sun-il Kim","doi":"10.1109/MILCOM.2015.7357419","DOIUrl":null,"url":null,"abstract":"Information (and its timely delivery) has always been one of the most critical tactical assets. Today, we have the technology to deploy data collection and retrieval systems all the way from mission headquarters down to the lowest levels of echelon. Due to the lower echelons proximity to the adversary, protecting the information is one of the most important issues in designing such systems. In this paper, we describe a secure distributed storage scheme to be used especially at and near the tactical edge. The scheme does so through a peer-to-peer overlay and storage protocol designed to run on existing networked systems. We utilize a structured overlay that is dynamically organized in a layered, hierarchical manner based on the existing military command structure (e.g. fire-team, squad, battalion, etc.). These layers are used as storage sites for pieces of data near the layer at which that data is needed. The data is generated and distributed via an information dispersal algorithm (IDA) utilizing an erasure code such as the common Cauchy Reed-Solomon (RS). Through the use of this IDA, the data pieces are organized across neighboring layers to maximize locality. This organization also prevents a compromise within one layer from compromising data in that layer. Multiple layers would have to be compromised for a single datum to become compromised. As a result, both security and survivability of the data is improved compared to the typical remote server-client model. We present an overview of this approach along with our experimental results on hardware performance of commercial off-the-shelf (COTS) mobile devices. The recorded overhead (encoding/ decoding times and associated data sizes) show that such a scheme can be utilized with little increase in overall latency.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2015 - 2015 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2015.7357419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Information (and its timely delivery) has always been one of the most critical tactical assets. Today, we have the technology to deploy data collection and retrieval systems all the way from mission headquarters down to the lowest levels of echelon. Due to the lower echelons proximity to the adversary, protecting the information is one of the most important issues in designing such systems. In this paper, we describe a secure distributed storage scheme to be used especially at and near the tactical edge. The scheme does so through a peer-to-peer overlay and storage protocol designed to run on existing networked systems. We utilize a structured overlay that is dynamically organized in a layered, hierarchical manner based on the existing military command structure (e.g. fire-team, squad, battalion, etc.). These layers are used as storage sites for pieces of data near the layer at which that data is needed. The data is generated and distributed via an information dispersal algorithm (IDA) utilizing an erasure code such as the common Cauchy Reed-Solomon (RS). Through the use of this IDA, the data pieces are organized across neighboring layers to maximize locality. This organization also prevents a compromise within one layer from compromising data in that layer. Multiple layers would have to be compromised for a single datum to become compromised. As a result, both security and survivability of the data is improved compared to the typical remote server-client model. We present an overview of this approach along with our experimental results on hardware performance of commercial off-the-shelf (COTS) mobile devices. The recorded overhead (encoding/ decoding times and associated data sizes) show that such a scheme can be utilized with little increase in overall latency.
在战术边缘为信息传播和检索提供安全的分布式存储
信息(及其及时传递)一直是最关键的战术资产之一。今天,我们有技术部署数据收集和检索系统,从任务总部一直到最低层次的梯队。由于较低层次接近对手,保护信息是设计此类系统时最重要的问题之一。在本文中,我们描述了一种安全的分布式存储方案,特别是在战术边缘和接近战术边缘。该方案通过一个点对点覆盖和存储协议来实现,该协议旨在在现有的网络系统上运行。我们利用基于现有军事指挥结构(例如火力队、班、营等)的分层、分层方式动态组织的结构化覆盖层。这些层被用作需要该数据的层附近的数据块的存储站点。数据通过利用诸如常见的Cauchy Reed-Solomon (RS)之类的擦除码的信息分散算法(IDA)生成和分发。通过使用该IDA,数据块跨相邻层组织,以最大化局部性。这种组织还可以防止一层内的泄露危及该层中的数据。如果要破坏单个数据,就必须破坏多个层。因此,与典型的远程服务器-客户机模型相比,数据的安全性和可生存性都得到了改进。我们概述了这种方法以及我们在商用现货(COTS)移动设备硬件性能上的实验结果。记录的开销(编码/解码时间和相关的数据大小)表明,这种方案可以在很少增加总体延迟的情况下使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书