Filters








2,944 Hits in 4.8 sec

Networks of Trusted Execution Environments for Data Protection in Cooperative Vehicular Systems [chapter]

Philippe Boos, Marc Lacoste
2020 Zenodo  
Both types of protocols reach an intermediate level of security, with variations in byzantine tolerance and types of threats.  ...  We identify three main families of consensus protocols and analyze their architectures, performance, and security, including improvements brought by the TEE.  ...  We thank Ahmad-Reza Sadeghi and David Koisser for their help and insightful comments on the paper.  ... 
doi:10.5281/zenodo.3949844 fatcat:psp4pu5ofvg5njtwa7bbwwuk5e

Research on Progress of Blockchain Consensus Algorithm: A Review on Recent Progress of Blockchain Consensus Algorithms

Huanliang Xiong, Muxi Chen, Canghai Wu, Yingding Zhao, Wenlong Yi
2022 Future Internet  
It has broad application prospects and has attracted extensive attention from academia and industry.  ...  and possible shortcomings of different consensus algorithms, and based on this, studies the future development trend of consensus algorithms for reference.  ...  Every node in the system may become a decision maker. If the current decision maker violates the blockchain protocol, the decision-making identity will be cancelled.  ... 
doi:10.3390/fi14020047 fatcat:egjkcrn63jbwvdtnwcg2iq46uq

The Applications of Blockchain in Artificial Intelligence

Ruonan Wang, Min Luo, Yihong Wen, Lianhai Wang, Kim-Kwang Raymond Choo, Debiao He, Wenxiu Ding
2021 Security and Communication Networks  
There has been increased interest in applying artificial intelligence (AI) in various settings to inform decision-making and facilitate predictive analytics.  ...  supporting trusted AI decision and decentralized AI.  ...  In FI, AI technology is mainly used to train models and make decisions.  ... 
doi:10.1155/2021/6126247 fatcat:7neic6vhnrfmhghhdjf634ozh4

Byzantine agreement with homonyms

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
The impossibility proofs use the fact that a Byzantine process can send multiple messages to the same recipient in a round.  ...  case, increasing the number of correct processes can actually make it harder to reach agreement.  ...  Eric Ruppert received funding from the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1145/1993806.1993810 dblp:conf/podc/Delporte-GalletFGKRT11 fatcat:cneitujhavcifhplnq6h4ymvsu

Byzantine agreement with homonyms

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2013 Distributed computing  
The impossibility proofs use the fact that a Byzantine process can send multiple messages to the same recipient in a round.  ...  case, increasing the number of correct processes can actually make it harder to reach agreement.  ...  Eric Ruppert received funding from the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1007/s00446-013-0190-3 fatcat:bodvget4cfeexagynedcti4x4q

Blockchain Technology Consensus Algorithms and Applications: A Survey

Samar Alsaqqa, Sufyan Almajali
2020 International Journal of Interactive Mobile Technologies  
Blockchain technology started with cryptocurrency and bitcoin applications for a safe and transparent environment.  ...  It has become one of the popular techniques for various transactions and applications in many different areas such as economy, business, and government.  ...  Fully private Blockchains: Not anyone can be a part of this network, it has a centralized database and structure; a single entity (organization) has the write permission and has the power to make decisions  ... 
doi:10.3991/ijim.v14i15.15893 fatcat:tqcjqol5vfds5najefiamvxeb4

Social learning for resilient data fusion against data falsification attacks

Fernando Rosas, Kwang-Cheng Chen, Deniz Gündüz
2018 Computational Social Networks  
Moreover, centralized decision-making and data fusion turn decision points into single points of failure, which are likely to be exploited by smart attackers.  ...  To tackle this serious security threat, we propose a novel scheme for enabling distributed decision-making and data aggregation through the whole network.  ...  Acknowledgements Fernando Rosas is supported by the European Union's H2020 research and innovation programme, under the Marie Skłodowska-Curie Grant Agreement No. 702981.  ... 
doi:10.1186/s40649-018-0057-7 pmid:30416937 pmcid:PMC6208803 fatcat:ektgo2mpcjbvhm63pi6dkwtu7m

Performance Evaluation of Various Block Chain Platforms

2019 International journal of recent technology and engineering  
Blockchain is a decentralized data processing and sharing platform that enables multiple domains that do not trust each other to cooperate, coordinate and collaborate in a rational decision making process  ...  It provides cryptocurrency anonymizer to make private transactions more secure and it deploys a novel delayed Proof of Work (dPoW) algorithm to arrive at a consensus.  ...  PoS(Proof-of-Stake), dBFT(delegated-Byzantine Fault Tolerance), LPoS(Leased Proof-of-Stake), DPoS(Delegated Proof of Stake), LFT(Loop Fault Tolerance), BFT (Byzantine Fault Tolerance), Chain based BFT,  ... 
doi:10.35940/ijrte.c1126.1083s19 fatcat:aggthkff7ragjpcfdkchksmf3q

Game authority for robust and scalable distributed selfish-computer systems

Shlomi Dolev, Elad M. Schiller, Paul G. Spirakis, Philippas Tsigas
2010 Theoretical Computer Science  
., the Internet, and propose designing self-stabilizing and Byzantine fault-tolerant distributed game authorities.  ...  Alternatively, when they do not assume that, designers turn to noncooperative games and seek an outcome that corresponds to a rough consensus when no coordination is allowed.  ...  The legislative service A key decision that the legislative service makes is about the rules of the game.  ... 
doi:10.1016/j.tcs.2010.02.014 fatcat:4pno4mtqajge7h7cgfc2jufkv4

Game authority for robust andscalable distributed selfish-computer systems

Shlomi Dolev, Elad M. Schiller, Paul G. Spirakis, Philippas Tsigas
2007 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07  
., the Internet, and propose designing self-stabilizing and Byzantine fault-tolerant distributed game authorities.  ...  Alternatively, when they do not assume that, designers turn to noncooperative games and seek an outcome that corresponds to a rough consensus when no coordination is allowed.  ...  The legislative service A key decision that the legislative service makes is about the rules of the game.  ... 
doi:10.1145/1281100.1281171 dblp:conf/podc/DolevSST07 fatcat:ph6boc6ogbgplcb2klt53nh44m

Resilient Consensus-based Multi-agent Reinforcement Learning with Function Approximation [article]

Martin Figura, Yixuan Lin, Ji Liu, Vijay Gupta
2021 arXiv   pre-print
probability one, provided that there are at most H Byzantine agents in the neighborhood of each cooperative agent and the network is (2H+1)-robust.  ...  We show that in the presence of Byzantine agents, whose estimation and communication strategies are completely arbitrary, the estimates of the cooperative agents converge to a bounded consensus value with  ...  To distinguish between the parameters of cooperative and Byzantine agents, we make slight changes in the notation.  ... 
arXiv:2111.06776v2 fatcat:mte4ncfaq5dndc4ihvek4leao4

Individual Security and Network Design with Malicious Nodes [article]

Tomasz Janus, Mateusz Skomra, Marcin Dziubiński
2018 arXiv   pre-print
We propose a model of network design and defense with byzantine nodes to address this question.  ...  the presence of the byzantine nodes.  ...  The adversary and the byzantine nodes make choices that maximize their utility.  ... 
arXiv:1804.07287v1 fatcat:jkuewrfo4fexpavjtd7ysidmba

Distributed Ledger Technology Review and Decentralized Applications Development Guidelines

Claudia Antal, Tudor Cioara, Ionut Anghel, Marcel Antal, Ioan Salomie
2021 Future Internet  
Protocol and Network Tier contains solutions for digital assets registration, transactions, data structure, and privacy and business rules implementation and the creation of peer-to-peer networks, ledger  ...  replication, and consensus-based state validation.  ...  The Byzantine fault-tolerant protocols can be classified as Byzantine Agreement protocols and Proof Protocols [67] .  ... 
doi:10.3390/fi13030062 fatcat:puwa425jnrgndgyaymhh52gxwy

N-party BAR Transfer [chapter]

Xavier Vilaça, João Leitão, Miguel Correia, Luís Rodrigues
2011 Lecture Notes in Computer Science  
., in the presence of Byzantine, Altruistic, and Rational participants.  ...  We present an algorithm that solves the problem for N ≥ 2f + 1, where f is the maximum number of Byzantine processes in each of the producer and consumer sets.  ...  The consumer then signs this data structure with its private key and sends it as a proof of reception to the trusted observer (lines 226-228).  ... 
doi:10.1007/978-3-642-25873-2_27 fatcat:cw4qc2azpja6rbiutket77c62a

TRAP: The Bait of Rational Players to Solve Byzantine Consensus [article]

Alejandro Ranchal-Pedrosa, Vincent Gramoli
2022 arXiv   pre-print
It is impossible to solve the Byzantine consensus problem in an open network of n participants if only 2n/3 or less of them are correct.  ...  Finally, we show that a baiting strategy is necessary and sufficient to solve this, so-called rational agreement problem.  ...  Each player has a public key and a private key, and public keys are common knowledge. Robustness.  ... 
arXiv:2105.04357v2 fatcat:i3tjtictgjauhbmhuhkoeg5mk4
« Previous Showing results 1 — 15 out of 2,944 results