Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
A new solution for the byzantine generals problem
Information and Control
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Understanding DCE
Wait-free clock synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Dynamic fault-tolerant clock synchronization
Journal of the ACM (JACM)
Lower bounds for convergence function based clock synchronization
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Maintaining authenticated communication in the presence of break-ins
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Proactive public key and signature systems
Proceedings of the 4th ACM conference on Computer and communications security
The proactive security toolkit and applications
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Maintaining Security in the Presence of Transient Faults
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Network randomization protocol: a proactive pseudo-random generator
SSYM'95 Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5
Proactive secure message transmission in asynchronous networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
TinySeRSync: secure and resilient time synchronization in wireless sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
Inner-Circle Consistency for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Clock synchronization in the Byzantine-recovery failure model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Secure time information in the internet key exchange protocol
Annales UMCS, Informatica - Security Systems
Clock synchronization issues in multi-cluster time-triggered networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
| Hi-index | 0.00 |
We present a convergence-function based clock synchronization algorithm, which is simple, efficient and fault-tolerant. The algorithm is tolerant of failures and allows recoveries, as long as less than a third of the processors are faulty 'at the same time'. Arbitrary (Byzantine) faults are tolerated, without requiring awareness of failure or recovery. In contrast, previous clock synchronization algorithms limited the total number of faults throughout the execution, which is not realistic, or assumed fault detection.The use of our algorithm ensures secure and reliable time services, a requirement of many distributed systems and algorithms. In particular, secure time is a fundamental assumption of proactive secure mechanisms, which are also designed to allow recovery from (arbitrary) faults. Therefore, our work is crucial to realize these mechanisms securely.