Filters








1,040 Hits in 9.4 sec

Trust management and adversary detection for delay tolerant networks

Erman Ayday, Hanseung Lee, Faramarz Fekri
2010 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE  
Especially, Byzantine attacks give serious damages to the network in terms of latency and data availability.  ...  Our main objective in this paper is to develop a robust trust mechanism and an efficient and low cost malicious node detection technique for DTNs.  ...  We also illustrated that the proposed scheme is far more effective than the voting-based techniques in detecting Byzantine nodes.  ... 
doi:10.1109/milcom.2010.5680245 fatcat:ty26l3l645b6hcnyfsiyb6kcje

On Federated and Proof Of Validation Based Consensus Algorithms In Blockchain

K. N. Ambili, M. Sindhu, M. Sethumadhavan
2017 IOP Conference Series: Materials Science and Engineering  
A successful implementation of blockchain as backbone of existing information technology systems is bound to eliminate various types of fraud and ensure quicker delivery of the item on trade.  ...  Almost all real world activities have been digitized and there are various client server architecture based systems in place to handle them. These are all based on trust on third parties.  ...  But both of them have nothing at stake problem wherein validators behave maliciously and vote for unworthy blocks knowingly because they have nothing to lose for their faults.  ... 
doi:10.1088/1757-899x/225/1/012198 fatcat:ptggsqqq4ze67jqaw6cv6g2teq

Sequential cooperative spectrum sensing in the presence of dynamic Byzantine attack for mobile networks

Jun Wu, Tiecheng Song, Yue Yu, Cong Wang, Jing Hu, Lixiang Li
2018 PLoS ONE  
Lastly, we carry out simulations on comparison of existing data fusion technologies and SCSS under dynamic Byzantine attack, and results verify the theoretical analysis and effectiveness of our proposed  ...  During such an assault, attackers can prevent reliable SUs from using the existing white space, or allure them to access the channels in use and cause excessive interference to PUs [5].  ...  Voting rule Voting rule (a.k.a. counting rule or K-out-of-N rule) is one of the simplest data fusion technologies.  ... 
doi:10.1371/journal.pone.0199546 pmid:29975727 pmcid:PMC6033420 fatcat:nhztf6akkrbpjelkklhzlzclwu

Secure and Trustable Distributed Aggregation Based on Kademlia [chapter]

Stéphane Grumbach, Robert Riemann
2017 IFIP Advances in Information and Communication Technology  
We propose an aggregation algorithm, which supports a large spectrum of potential applications including complex voting protocols.  ...  The distribution of data and computation limits the potential for data breaches, and reduces the need for institutional trust.  ...  Acknowledgments The authors thank Stéphane Frénot, Damien Reimert, Aurélien Faravelon, Pascal Lafourcade and Matthieu Giraud for fruitful discussions on distributed voting protocols and attack vectors.  ... 
doi:10.1007/978-3-319-58469-0_12 fatcat:zaxn5pb7zfhzhe23lhvuxffw6i

Byzantine fault tolerant public key authentication in peer-to-peer systems

Vivek Pathak, Liviu Iftode
2006 Computer Networks  
Authentication is done without trusted third parties, tolerates Byzantine faults and is eventually correct if more than a threshold of the peers are honest.  ...  We describe Byzantine Fault Tolerant Authentication, a mechanism for public key authentication in peer-to-peer systems.  ...  Byzantine agreement B asks the peer A for the challenges it received, and its responses to them. It then compares the proofs received from the peers and those received from A.  ... 
doi:10.1016/j.comnet.2005.07.007 fatcat:y7wawj6pcvhy3ouhk273xo7hlu

Scalable byzantine computation

Valerie King, Jared Saia
2010 ACM SIGACT News  
topics, or providing new insight on well-studied topics by organizing them in new ways.  ...  In particular, when the vote is close, the bad guys can make one good guy commit to the bit 0 and another good guy commit to the bit 1.  ...  I would like to thank Christian Cachin, Robert Haas and Rachid Guerraoui for their valuable comments and many interesting discussions.  ... 
doi:10.1145/1855118.1855136 fatcat:rguixn4g7rfxxam474upudq6mu

Creating a Novel Consensus Algorithm for Distributed Computing use Cases

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
creating consistency between them.  ...  Some common algorithms of this type are Proof of Work algorithm (PoW), the practical Byzantine fault tolerance algorithm (PBFT), the proof-of-stake algorithm (PoS) and the delegated proof-of-stake algorithm  ...  Based on these elections and voting are based and carried out. Even the recent definitions of the Paxos algorithm's functioning is based on single/basic Paxos functioning.  ... 
doi:10.35940/ijitee.a1059.1191s19 fatcat:gm43pg2ydvad3jotdkpsh73tbe

Blockguard: Adaptive Blockchain Security [article]

Shishir Rai, Kendric Hood, Mikhail Nesterenko, Gokarna Sharma
2019 arXiv   pre-print
For in-committee consensus, our algorithms may use various available byzantine-robust fault tolerant algorithms (BFT). We implement synchronous BFT, asynchronous BFT and proof-of-work consensus.  ...  It is therefore possible that all Byzantine peers may eventually be detected and removed from the network. To counter this, our adversary may shuffle Byzantine peers.  ...  In SBFT and PBFT, non-leader Byzantine peers have little influence over the performance of the algorithm, while Byzantine leaders are detected by the consensus algorithm.  ... 
arXiv:1907.13232v1 fatcat:plbicnr46vcf3cfwdfjqcyc55e

Comparison of proof-of-work based blockchains against federated consensus and proof-of-validation based blockchains [article]

Ambili K. N, Jimmy Jose
2019 IACR Cryptology ePrint Archive  
, Tendermint, along the parameters like peer to peer network setup and maintenance, cryptocurrency involved, details of transaction execution and validation, block creation, block validation and consensus  ...  protocol and application development.  ...  M Sethumadhavan, Head of Department, TIFAC Core in Cyber Security, Amrita Vishwa Vidyapeetham, Ettimadai, Coimbatore and Dr.  ... 
dblp:journals/iacr/NJ19a fatcat:a6ewdvlljbdi3bmxfdlnypbcye

SoK: Understanding BFT Consensus in the Age of Blockchains [article]

Gang Wang
2021 IACR Cryptology ePrint Archive  
We aim that this paper can provide system researchers and developers a concrete view of the current design landscape and help them find solutions to concrete problems.  ...  We explore both general principles and practical schemes to achieve consensus under Byzantine settings.  ...  Similarly, according to the detectability during the process execution, a Byzantine failure can be roughly categorized into detectable and non-detectable Byzantine faults [56] [57] .  ... 
dblp:journals/iacr/Wang21c fatcat:wggbkbi25fg43fieebp4qzlk3m

SISSLE in consensus-based Ripple: Some Improvements in Speed, Security and Last Mile Connectivity [article]

Mayank Mundhra, Chester Rebeiro
2021 arXiv   pre-print
It solves the Byzantine General's Problem with its Ripple Protocol Consensus Algorithm (RPCA), where each server maintains a list of servers, called the Unique Node List (UNL), that represents the network  ...  respectively, and ≥ 3.16x and 51.70x speedup and success rate in consensus respectively.  ...  We assume that there is no path via them. We eliminate them. All nodes now discussed are genuine and non-faulty. Case 1: If N is in the UNL of X, then N is connected to X.  ... 
arXiv:2008.01742v3 fatcat:3f5ntsjhwzgt5gqm4kts3f5u3a

Secured Routing in Mobile Ad hoc Networks (MANETs)

S. Maharaja, R. Jeyalakshmi, A.V. Sabarish Kanna, M. Deva Priya
2019 International Journal of Scientific Research in Computer Science Engineering and Information Technology  
Various attacks are prevalent in MANET, out of which Byzantine attack plays a vital role.  ...  A node or group of nodes present in the routing path between the source and the destination may be compromised due to Byzantine attack.  ...  Perlman 1988 [18] has carried out a study on Byzantine attacks in the networking layer, which incurs more networking cost and processing overhead.  ... 
doi:10.32628/cseit195275 fatcat:24jkoix77rgdhbeckkon3x4txi

Customizable Fault Tolerance forWide-Area Replication

Yair Amir, Brian Coan, Jonathan Kirsch, John Lane
2007 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)  
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems.  ...  We present a new Byzantine fault-tolerant protocol that establishes a reliable virtual communication link between logical machines.  ...  When a forwarder detects that a peer is faulty, it locally broadcasts a message indicating that the peer should be skipped by other forwarders.  ... 
doi:10.1109/srds.2007.40 dblp:conf/srds/AmirCKL07 fatcat:hqfhzvtbsbehbmran5p2m5rlya

Secure Distributed Training at Scale [article]

Eduard Gorbunov, Alexander Borzunov, Michael Diskin, Max Ryabinin
2022 arXiv   pre-print
Training in presence of such peers requires specialized distributed training algorithms with Byzantine tolerance.  ...  ., HPC clusters) that are not available to small research groups and independent researchers.  ...  We thank Sai Praneeth Karimireddy for useful discussions and suggestions, Lie He for providing the code with CEN-TEREDCLIP, William Cappelletti for pointing out several relevant papers, Gennady Pekhimenko  ... 
arXiv:2106.11257v3 fatcat:jyrpw5rjnnagjaiaxg7saf55ki

Customizable Fault Tolerance forWide-Area Replication

Yair Amir, Brian Coan, Jonathan Kirsch, John Lane
2007 Symposium on Reliable Distributed Systems. Proceedings  
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems.  ...  We present a new Byzantine fault-tolerant protocol that establishes a reliable virtual communication link between logical machines.  ...  When a forwarder detects that a peer is faulty, it locally broadcasts a message indicating that the peer should be skipped by other forwarders.  ... 
doi:10.1109/srds.2007.4365685 fatcat:h6qfb4iev5afvjla4a76ww4ofa
« Previous Showing results 1 — 15 out of 1,040 results