Danilo Pianini
Giovanni Ciatto
Stefano Mariani
Andrea Omicini
ABSTRACT
Aggregate Computing is a promising paradigm for coordinating large numbers of possibly situated devices, typical of scenarios related to the Internet of Things, smart cities, drone coordination, and mass urban events. Currently, little work has been devoted to study and improve security in aggregate programs, and existing works focus solely on application-level countermeasures. Those security systems work under the assumption that the underlying computational model is respected; however, so-called Byzantine behaviour violates such assumption. In this paper, we discuss how Byzantine behaviours can hinder an aggregate program, and exploit application-level protection for creating bigger disruption. We discuss how the blockchain technology can mitigate these attacks by enforcing behaviours consistent with the expected operational semantics, with no impact on the application logic.
- Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, Srinivasan Muralidharan, Chet Murthy, Binh Nguyen, Manish Sethi, Gari Singh, Keith Smith, Alessandro Sorniotti, Chrysoula Stathakopoulou, Marko Vukolić, Sharon Weed Cocco, and Jason Yellick. 2018. Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains. In 13th EuroSys Conference (EuroSys '18). ACM, Article 30, 15 pages. Google Scholar
Digital Library
- Pierre-Louis Aublin, Rachid Guerraoui, Nikola Knežević, Vivien Quéma, and Marko Vukolić. 2015. The Next 700 BFT Protocols. ACM Transactions on Computer Systems 32, 4 (Jan. 2015), 1--45. arXiv:1710.03346 Google ScholarDigital Library
- Giorgio Audrito, Ferruccio Damiani, Mirko Viroli, and Roberto Casadei. 2016. Run-Time Management of Computation Domains in Field Calculus, See {16}, 192--197.Google Scholar
- Jonathan Bachrach, Jacob Beal, and James McLurkin. 2010. Composable continuous-space programs for robotic swarms. Neural Computing and Applications 19, 6 (2010), 825--847. Google ScholarDigital Library
- Adam Back. 2002. Hashcash - A Denial of Service Counter-Measure. http://www.hashcash.org/hashcash.pdfGoogle Scholar
- Jacob Beal, Danilo Pianini, and Mirko Viroli. 2015. Aggregate Programming for the Internet of Things. IEEE Computer 48, 9 (2015), 22--30.Google ScholarDigital Library
- Jacob Beal, Kyle Usbeck, Joseph Loyall, Mason Rowe, and James Metzler. 2016. Adaptive Task Reallocation for Airborne Sensor Sharing, See {16}, 168--173.Google Scholar
- Jacob Beal, Mirko Viroli, Danilo Pianini, and Ferruccio Damiani. 2017. Self-Adaptation to Device Distribution in the Internet of Things. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 12, 3, Article 12 (Sept. 2017), 29 pages. Google ScholarDigital Library
- S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. 2005. Gossip algorithms: design, analysis and applications. In IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3. IEEE, 1653--1664.Google Scholar
- Christian Cachin and Marko Vukolić. 2017. Blockchain Consensus Protocols in the Wild. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Andréa W. Richa (Ed.), Vol. 91. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, Article 1, 16 pages.Google Scholar
- Roberto Casadei, Alessandro Aldini, and Mirko Viroli. 2018. Towards Attack-Resistant Aggregate Computing Using Trust Mechanisms. Science of Computer Programming 167 (2018), 114--137.Google ScholarCross Ref
- Roberto Casadei, Giancarlo Fortino, Danilo Pianini, Wilma Russo, Claudio Savaglio, and Mirko Viroli. 2019. Modelling and Simulation of Opportunistic IoT Services with Aggregate Computing. Future Generation Computer Systems 91 (Feb. 2019), 252--262.Google Scholar
- Roberto Casadei, Danilo Pianini, and Mirko Viroli. 2016. Simulating Large-scale Aggregate MASs with Alchemist and Scala. In 2016 Federated Conference on Computer Science and Information Systems, FedCSIS 2016, Gdańsk, Poland, September 11-14, 2016. (ACSIS), Vol. 8. Polish Information Processing Society, 1495--1504.Google Scholar
- Jin-Hee Cho, Ananthram Swami, and Ray Chen. 2011. A survey on trust management for mobile ad hoc networks. IEEE Communications Surveys & Tutorials 13, 4 (2011), 562--583.Google ScholarCross Ref
- John R. Douceur. 2002. The Sybil Attack. In 1st International Workshop on Peer-to-Peer Systems (IPTPS '01). Springer, 251--260. http://dl.acm.org/citation.cfm?id=687813 Revised Papers. Google ScholarDigital Library
- Sameh Elnikety, Peter R. Lewis, and Christian Müller-Schloer (Eds.). 2016. 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W 2016). IEEE.Google Scholar
- Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems (TOPLAS) 4, 3 (July 1982), 382--401. Google ScholarDigital Library
- Félix Gómez Mármol and Gregorio Martínez Pérez. 2009. Security threats scenarios in trust and reputation models for distributed systems. computers & security 28, 7 (2009), 545--556. Google ScholarDigital Library
- Satoshi Nakamoto. 2008. Bitcoin: A Peer-to-Peer Electronic Cash System. http://bitcoin.org/bitcoin.pdfGoogle Scholar
- Danilo Pianini, Jacob Beal, and Mirko Viroli. 2016. Improving Gossip Dynamics Through Overlapping Replicates. In Coordination Models and Languages (LNCS), Alberto Lluch Lafuente and José Proença (Eds.), Vol. 9686. Springer, 192--207.Google Scholar
- Danilo Pianini, Mirko Viroli, and Jacob Beal. 2015. Protelis: practical aggregate programming. In 30th Annual ACM Symposium on Applied Computing (SAC 2015). ACM Press, 1846--1853. Google ScholarDigital Library
- Fred B. Schneider. 1990. Implementing Fault-tolerant Services Using the State Machine Approach: A Tutorial. Comput. Surveys 22, 4 (Dec. 1990), 299--319. Google ScholarDigital Library
- Robert W. Shirey. 2007. Internet Security Glossary, Version 2. RFC 4949.Google Scholar
- Mirko Viroli, Giorgio Audrito, Ferruccio Damiani, Danilo Pianini, and Jacob Beal. 2016. A Higher-order Calculus of Computational Fields. CoRR abs/1610.08116 (2016), 39. http://arxiv.org/abs/1610.08116Google Scholar
- Mirko Viroli, Jacob Beal, Ferruccio Damiani, Giorgio Audrito, Roberto Casadei, and Danilo Pianini. 2018. From Field-Based Coordination to Aggregate Computing. In Coordination Models and Languages, Giovanna Di Marzo Serugendo and Michele Loreti (Eds.). LNCS, Vol. 10852. Springer, 252--279.Google Scholar
- Mirko Viroli, Roberto Casadei, and Danilo Pianini. 2016. On execution platforms for large-scale aggregate computing. In 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing. ACM, 1321--1326. Google ScholarDigital Library
- Marko Vukolić. 2016. The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication. In Open Problems in Network Security. LNCS, Vol. 9591. Springer, 112--125.Google Scholar
- Gavin Wood. 2014. Ethereum: a secure decentralised generalised transaction ledger. http://ethereum.github.io/yellowpaper/paper.pdfGoogle Scholar
- Zibin Zheng, Shaoan Xie, Hong-Ning Dai, Xiangping Chen, and Huaimin Wang. 2017. An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends. In 2017 IEEE International Congress on Big Data. IEEE, 557--564.Google ScholarCross Ref
Index Terms
- Transparent Protection of Aggregate Computations from Byzantine Behaviours via Blockchain
Recommendations
Byzantine Fault Tolerance For Distributed Ledgers Revisited
The problem of Byzantine Fault Tolerance (BFT) has received a lot of attention in the last 30 years. Due to the popularity of Proof of Stake (PoS) blockchains in recent years, several BFT protocols have been deployed in the large scale of Internet ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityClassic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
The Adversary Capabilities in Practical Byzantine Fault Tolerance
Security and Trust ManagementAbstractThe problem of Byzantine Fault Tolerance (BFT) has received a lot of attention in the last 30 years. The seminal work by Fisher, Lynch, and Paterson (FLP) shows that there does not exist a deterministic BFT protocol in complete asynchronous ...
Comments