A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Security Topology Control Method for Wireless Sensor Networks with Node-Failure Tolerance Based on Self-Regeneration
2010
EURASIP Journal on Wireless Communications and Networking
The nodes will be failure by fault, intrusion, and the battery exhaustion. Node-failure tolerance is an acceptable method to improve the networks' lifetime. ...
tolerance presented by Wang et al. [9], this paper focuses on two key problems: how to get a tolerant topology and how to sustain this tolerant topology when all deployed nodes will be failure ultimately ...
Related work
Reference
Security protocol structure
Mutual authentication
Broadcast authentication
Intrusion tolerance
Security algorithm
SPINS [12]
n o
h a v e
n o
Eschenauer and Gligor ...
doi:10.1155/2010/201416
fatcat:t6uywqghw5drblz4l44wuybzaq
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
2005
IEEE Transactions on Dependable and Secure Computing
Fault-tolerant clock synchronization techniques are potential candidates to address this problem. ...
This paper presents a novel fault-tolerant clock synchronization scheme for clusters of nodes in sensor networks, where the nodes in each cluster can communicate through broadcast. ...
We refer to the maximum number of malicious nodes that one algorithm can tolerate as its degree of fault-tolerance. ...
doi:10.1109/tdsc.2005.36
fatcat:hf2a2meirjcuvjpx3ncvgbghca
Automatically increasing the fault-tolerance of distributed systems
1988
Proceedings of the seventh annual ACM Symposium on Principles of distributed computing - PODC '88
The design of fault-tolerant distributed systems is a costly and diflicult task. Its cost and difficulty increase dramatically with the severity of failures that a system must tolerate. ...
We seek to simplify this task by developing methods to automatically translate protocols tolerant of "benign" failures to ones tolerant of more "severe" failures. ...
general omission failures was optimal with respect to fault-tolerance. ...
doi:10.1145/62546.62588
dblp:conf/podc/NeigerT88
fatcat:edhcevtzhfemdeq2db6ejuyk3q
A DoS and fault-tolerant authentication protocol for group communications in ad hoc networks
2007
Computer Communications
The reliability features include efficient Denial of Service tolerance for broadcasting refreshment messages, fault-tolerance for recovering lost refreshment messages, robustness for resisting the clock ...
The simulation results demonstrate the robustness of the proposed protocol under severe Denial of Service attack and poor wireless channel quality. ...
Fault-tolerant key recovery mechanism The RefreshKey message can also be used to recover the lost CKs for fault-tolerant and key recovery mechanism shown in Algorithm 4. ...
doi:10.1016/j.comcom.2007.04.012
fatcat:znm5er6f3fh2tajhnvu6vpc66m
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
[chapter]
2009
Lecture Notes in Computer Science
We evaluate its robustness and performance both analytically and via simulations. ...
Since all GKA protocols involve multiple rounds, robustness to player failures is important and desirable. ...
By inspecting the formula for deriving the secret key in the BD GKA protocol we can observe that each player derives the same key because the set of gadgets broadcasted in the second round of the protocol ...
doi:10.1007/978-3-642-00730-9_5
fatcat:jlqszzob5vgglauy27cbiftfna
Optimal clock synchronization
1985
Proceedings of the fourth annual ACM symposium on Principles of distributed computing - PODC '85
The solution is also optimal with respect to the number of faulty processes that can be tolerated to achieve this accuracy. ...
failures with and without message authentication. ...
We are grateful to Abha Moitra, Jennifer Lundelius, and the referees for their helpful comments and suggestions. ...
doi:10.1145/323596.323603
dblp:conf/podc/SrikanthT85
fatcat:leeotfh2mjhibgwmzle47k2pwm
Optimal clock synchronization
1987
Journal of the ACM
The solution is also optimal with respect to the number of faulty processes that can be tolerated to achieve this accuracy. ...
failures with and without message authentication. ...
We are grateful to Abha Moitra, Jennifer Lundelius, and the referees for their helpful comments and suggestions. ...
doi:10.1145/28869.28876
fatcat:lfutiskgtrgnfdjou7eeup5mmy
Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks
2011
Journal of Network and Computer Applications
Unlike existing intrusion-fault tolerant solutions, our protocol is based on a distributed and in-network verification scheme, which does not require any referring to the base station. ...
In this paper, we present a new intrusion-fault tolerant routing scheme offering a high level of reliability through a secure multi-path routing construction. ...
To guarantee parent authentication, each sensor uses a local one way chain providing sequence numbers for its local broadcasts (one hop broadcasts). ...
doi:10.1016/j.jnca.2011.03.022
fatcat:4pnqsgt7ofecjoecjtzlomzcta
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference
2011
IEEE Communications Surveys and Tutorials
Here, we address this omission by surveying the literature on adversarial fault tolerance with an eye towards results with a theoretical flavor. ...
algorithmically under such models. ...
In this context, the problem has sometimes been referred to by the lengthy designations of reliable broadcast tolerating Byzantine adversarial behavior or reliable broadcast tolerating Byzantine faults ...
doi:10.1109/surv.2011.041311.00156
fatcat:n2dspej4vfck7krz5owzyda5wu
Fault-tolerant Clock Synchronization using Precise Time Protocol Multi-Domain Aggregation
2021
Zenodo
window to achieve secure and fault-tolerant operation. ...
We consider IPSec and MACsec complementary to the fault tolerance algorithms and mechanism discussed in this work. ...
doi:10.5281/zenodo.5849985
fatcat:f55wmvdcibeztk2nxj4sq62ztm
The Design of a COTS Real-Time Distributed Security Kernel
[chapter]
2002
Lecture Notes in Computer Science
It aims at building a new style of protocols to achieve intrusion tolerance, which for the most part execute in insecure, arbitrary failure environments, and resort to the TTCB only in crucial parts of ...
We discuss essentially three things in this paper: (1) The TTCB is a simple component providing a small set of basic secure services. ...
Acknowledgements The authors would like to thank António Casimiro, Pedro Martins, Nuno Miguel Neves and Lau Cheuk Lung for valuable discussions on several issues of this paper. ...
doi:10.1007/3-540-36080-8_21
fatcat:wmqud6a3mfbvhajlmqk36vz2va
Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks
2013
IEEE Transactions on Mobile Computing
The key to its efficiency is the fact that it tolerates dynamic message omissions, which allows an efficient utilization of the wireless broadcasting medium. ...
Finally, the protocol was prototyped and subject to a comparative performance evaluation against two well-known Byzantine fault-tolerant consensus protocols. ...
This was only possible because the protocol is able to tolerate dynamic transmission faults. ...
doi:10.1109/tmc.2012.225
fatcat:dz4vdhu5hzhhbltmucfbzaefyy
Page 1542 of Mathematical Reviews Vol. , Issue 88c
[page]
1988
Mathematical Reviews
This primitive is a gen- eral tool for deriving fault-tolerant algorithms in the presence of arbitrary failures.”
88c:68009 68M10 68N25 68Q05
Upfal, Eli (1-STF); Wigderson, Avi (1-IBM2)
How to share memory ...
It was derived using a broadcast primitive that provides properties of message authentication and thus restricts the disruptive behavior of faulty processes. ...
Reaching Efficient Byzantine Agreements in Bipartite Networks
2022
IEEE Access
With this, the Byzantine agreement is extended to fully connected bipartite networks and some bipartite bounded-degree networks. ...
INDEX TERMS Byzantine agreement, broadcast primitive, bipartite network, bounded degree network. ...
ACKNOWLEDGMENT The authors would like to thank the reviewers for their valuable comments. ...
doi:10.1109/access.2022.3175998
fatcat:anjjvfxm4fhbfoad7rhfwyvndi
Reaching Efficient Byzantine Agreements in Bipartite Networks
[article]
2022
arXiv
pre-print
With this, the Byzantine agreement is extended to fully connected bipartite networks and some bipartite bounded-degree networks. ...
It shows that efficient real-world Byzantine agreement systems can be built with the provided algorithms with sufficiently high system assumption coverage. ...
Meanwhile, in [9] , the authenticated broadcast can be simulated by unauthenticated broadcast primitive, with which a bunch of authenticated BA algorithms can be converted into corresponding unauthenticated ...
arXiv:2203.03963v1
fatcat:e5v73ml7incs7mkhsdth5j7fqm
« Previous
Showing results 1 — 15 out of 2,022 results