B. Barak, S. Halevi, A. Herzberg, and D. Naor. Clock synchronization with faults and recoveries. In Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pages 133--142, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Service and Protocol Architecture for the MAFTIA Middleware - Veríssimo, Neves (2001) (Correct)
....to be secure: message integrity and authenticity. The correctness of sites with clocks has to be assessed in order to avoid a malicious clock from desynchronizing others. A clock synchronization protocol for a homogeneous network that tolerates malicious faults has been presented by Barak et al. [8]. It relies on a completely connected network with links between any two processors, and can withstand up to one third of faulty processors at any time. Through the use of proactive secure mechanisms, an arbitrary number of faults is actually tolerated over the whole lifetime of the system. Such ....
Boaz Barak, Shai Halevi, Amir Herzberg, and Dalit Naor. Clock synchronization with faults and recoveries. In Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pages 133-142, 2000.
Guaranteed Delivery for Secure Electronic Commerce and Payments - Herzberg (2002) Self-citation (Herzberg) (Correct)
....protocols, with appropriate (reliable and secure) sources of real time. The protocol can be an authenticated version of the Network Time Protocol [Mi91,Mi00] For provable security resilient to corruptions of all clocks, as long as most clocks at any given period are not corrupted, use [BHHN00]. Again, in reality, the bound on the drift is only probabilistic; we believe our results are likely to hold under refined analysis taking this into account, and in this work we use the simpler assumption (that drift is always bounded by ) Designers can use the guaranteed delivery service to ....
....of every DA, as long as the number of corrupted delivery authorities during any time period of specific length (with M) is bounded by f. This requires, of course, that the underlying communication and clock synchronization mechanisms are also proactively secure, e.g. using the protocols of [BHHN00,CHH00]. 6. Applications of Guaranteed Delivery We now discuss how some important secure electronic commerce applications can take advantage of an underlying guaranteed delivery service, as illustrated in Figure 1. Consider first a simple electronic banking and brokerage application as illustrated in ....
Boaz Barak, Shai Ha-Levi, Amir Herzberg, Dalit Naor, Clock Synchronization with Faults and Recoveries, proceedings of the Nineteenth ACM Symposium on Principles of Distributed Computing (PODC 2000), July 16-19 2000, Portland, Oregon, pp. 133-142.
Proactive Secure Message Transmission in Asynchronous Networks - Backes, Cachin, Strobl (2003) (Correct)
No context found.
B. Barak, S. Halevi, A. Herzberg, and D. Naor. Clock synchronization with faults and recoveries. In Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pages 133--142, 2000.
A Secure and Scalable Digital Time-stamping Service - Tulone (Correct)
No context found.
B.Barak, S.Halevi, A.Herzberg, D.Naor. Clock synchronization with faults and recoveries. In Proc. of the 9th ACM Symp. on Principles of Distributed Computing (PODC '00), pp. 133-142, Jul 2000.
Proactive Secure Message Transmission in Asynchronous Networks - Backes, Cachin, Strobl (2003) (Correct)
No context found.
B. Barak, S. Halevi, A. Herzberg, and D. Naor. Clock synchronization with faults and recoveries. In Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pages 133--142, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC