Proceedings. International Conference on Distributed Computing Systems最新文献

BP-DEBUG: A Fault Debugging and Resolution Tool for Business Processes. BP-DEBUG：一个用于业务流程的故障调试和解决工具。

Proceedings. International Conference on Distributed Computing Systems Pub Date : 2022-07-01 Epub Date: 2022-10-13 DOI: 10.1109/icdcs54860.2022.00143

Muhammad Adeel Zahid, Basit Shafiq, Shafay Shamail, Ayesha Afzal, Jaideep Vaidya

引用次数: 0

Blockchain Based Auditable Access Control for Distributed Business Processes. 基于区块链的分布式业务流程可审计访问控制。

Proceedings. International Conference on Distributed Computing Systems Pub Date : 2020-11-01 Epub Date: 2021-02-23 DOI: 10.1109/ICDCS47774.2020.00015

Ahmed Akhtar, Basit Shafiq, Jaideep Vaidya, Ayesha Afzal, Shafay Shamail, Omer Rana

{"title":"Blockchain Based Auditable Access Control for Distributed Business Processes.","authors":"Ahmed Akhtar, Basit Shafiq, Jaideep Vaidya, Ayesha Afzal, Shafay Shamail, Omer Rana","doi":"10.1109/ICDCS47774.2020.00015","DOIUrl":"https://doi.org/10.1109/ICDCS47774.2020.00015","url":null,"abstract":"The use of blockchain technology has been proposed to provide auditable access control for individual resources. However, when all resources are owned by a single organization, such expensive solutions may not be needed. In this work we focus on distributed applications such as business processes and distributed workflows. These applications are often composed of multiple resources/services that are subject to the security and access control policies of different organizational domains. Here, blockchains can provide an attractive decentralized solution to provide auditability. However, the underlying access control policies may be overlapping in terms of the component conditions/rules, and simply using existing solutions would result in repeated evaluation of user's authorization separately for each resource, leading to significant overhead in terms of cost and computation time over the blockchain. To address this challenge, we propose an approach that formulates a constraint optimization problem to generate an optimal composite access control policy. This policy is in compliance with all the local access control policies and minimizes the policy evaluation cost over the blockchain. The developed smart contract(s) can then be deployed to the blockchain, and used for access control enforcement. We also discuss how the access control enforcement can be audited using a game-theoretic approach to minimize cost. We have implemented the initial prototype of our approach using Ethereum as the underlying blockchain and experimentally validated the effectiveness and efficiency of our approach.","PeriodicalId":74571,"journal":{"name":"Proceedings. International Conference on Distributed Computing Systems","volume":"2020 ","pages":"12-22"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICDCS47774.2020.00015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38968748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Threshold-Based Widespread Event Detection. 基于阈值的广泛事件检测。

Proceedings. International Conference on Distributed Computing Systems Pub Date : 2019-01-01 DOI: 10.1109/icdcs.2019.00047

You Zhou, Yian Zhou, Shigang Chen

{"title":"Threshold-Based Widespread Event Detection.","authors":"You Zhou, Yian Zhou, Shigang Chen","doi":"10.1109/icdcs.2019.00047","DOIUrl":"https://doi.org/10.1109/icdcs.2019.00047","url":null,"abstract":"Widespread event detection is a fundamental network function that has many important applications in cybersecurity, traffic engineering, and distributed data mining. This paper introduces a new probabilistic threshold-based event detection problem, which is to find all events that appear in any w-out-of-a monitors with probabilistic guarantee on false positives, where a is the total number of monitors and the threshold w(≤ a) is a positive integer parameter that can be arbitrarily set, according to specific application requirements. We develop an efficient threshold filter solution and its improved versions, which combine Bloom filters, counting Bloom filter, threshold filter and compressed filters in a series of encoding and filtering steps, providing tradeoff between detection accuracy and communication overhead. We theoretically optimize the system parameters in the proposed solutions to minimize the communication overhead under the constraint of probabilistic detection guarantee. Extensive simulations demonstrate the practical viability of the proposed solutions in their ability of finding widespread events in a large network with few false positives and low communication overhead.","PeriodicalId":74571,"journal":{"name":"Proceedings. International Conference on Distributed Computing Systems","volume":"2019 ","pages":"399-408"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/icdcs.2019.00047","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38560070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Achieving Strong Privacy in Online Survey. 实现在线调查的强隐私。

Proceedings. International Conference on Distributed Computing Systems Pub Date : 2017-01-01 Epub Date: 2017-07-17 DOI: 10.1109/icdcs.2017.247

You Zhou, Yian Zhou, Shigang Chen, Samuel S Wu

{"title":"Achieving Strong Privacy in Online Survey.","authors":"You Zhou, Yian Zhou, Shigang Chen, Samuel S Wu","doi":"10.1109/icdcs.2017.247","DOIUrl":"https://doi.org/10.1109/icdcs.2017.247","url":null,"abstract":"Thanks to the proliferation of Internet access and modern digital and mobile devices, online survey has been flourishing into data collection of marketing, social, financial and medical studies. However, traditional data collection methods in online survey suffer from serious privacy issues. Existing privacy protection techniques are not adequate for online survey for lack of strong privacy. In this paper, we propose a practical strong privacy online survey scheme SPS based on a novel data collection technique called dual matrix masking (DM2), which guarantees the correctness of the tallying results with low computation overhead, and achieves universal verifiability, robustness and strong privacy. We also propose a more robust scheme RSPS, which incorporates multiple distributed survey managers. The RSPS scheme preserves the nice properties of SPS, and further achieves robust strong privacy against joint collusion attack. Through extensive analyses, we demonstrate our proposed schemes can be efficiently applied to online survey with accuracy and strong privacy.","PeriodicalId":74571,"journal":{"name":"Proceedings. International Conference on Distributed Computing Systems","volume":"2017 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/icdcs.2017.247","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38325131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1