当前位置: X-MOL 学术Int. J. Parallel. Program › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Secure Provenance Scheme for Detecting Consecutive Colluding Users in Distributed Networks
International Journal of Parallel Programming ( IF 1.5 ) Pub Date : 2018-09-25 , DOI: 10.1007/s10766-018-0601-y
Idrees Ahmed , Abid Khan , Adeel Anjum , Mansoor Ahmed , Muhammad Asif Habib

Data provenance is becoming extremely important these days for distributed environment, due to the ease in sharing and modifying data stored (e.g. cloud storage systems). However, the protection of provenance chain has been greatly understudied problem. This paper presents a secure provenance scheme for a distributed environment, designed to ensure data confidentiality, integrity, and non-repudiation. Specifically, the proposed scheme is designed to detect attacks on a provenance chain launched by multiple concurrent adversaries, such as forged provenance records and provenance record shuffling attacks. Moreover, the proposed scheme detects the provenance record, which has been perturbed and identifies the malicious or compromised user. We then evaluate our scheme empirically and analytically with the state of the art to demonstrate its security and performance in terms of computational and storage overheads.

中文翻译:

一种用于检测分布式网络中连续串通用户的安全来源方案

由于易于共享和修改存储的数据(例如云存储系统),如今数据来源对于分布式环境变得极为重要。然而,来源链的保护问题一直未被充分研究。本文提出了一种分布式环境的安全来源方案,旨在确保数据的机密性、完整性和不可否认性。具体而言,所提出的方案旨在检测由多个并发对手发起的对来源链的攻击,例如伪造来源记录和来源记录改组攻击。此外,所提出的方案检测出处记录,该记录已被扰动并识别恶意或受感染用户。
更新日期:2018-09-25
down
wechat
bug