Paper 2019/1348

Network Time with a Consensus on Clock

Handan Kilinc Alper


Decentralized protocols which require synchronous communication usually achieve it with the help of the time that computer clocks show. These clocks are mostly adjusted by centralized systems such as Network Time Protocol (NTP) because these adjustments are indispensable to reduce the effects of random drifts on clocks. On the other hand, an attack on these systems (which has happened in the past) can cause corruption of the protocols which rely on the time data that they provide to preserve synchronicity. So, we are facing the dilemma of relying on a centralized solution to adjust our timers or risking the security of our decentralized protocols. In this paper, we propose a Global Universal Composable (GUC) model for the physical clock synchronization problem in the decentralized systems by modeling the notion of consensus on clocks. Consensus on clocks is agreed upon considering the local clocks of all parties in a protocol which are possibly drifted. In this way, we model the functionality that e.g. NTP provides in a decentralized manner. In the end, we give a simple but useful protocol relying on a blockchain network that realizes our model. Our protocol can be used by the full nodes of a blockchain that need synchronous clocks in the real world to preserve the correctness and the security of the blockchain protocol. One advantage of our protocol is that it does not cause any extra communication overhead on the underlying blockchain protocol.

Note: More clear proofs, frequency error data from the real clocks

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
consensus on clocksproof of stakeblockchainUC modelsynchronizationrelative time
Contact author(s)
handan @ web3 foundation
2021-06-07: last of 4 revisions
2019-11-22: received
See all versions
Short URL
Creative Commons Attribution


      author = {Handan Kilinc Alper},
      title = {Network Time with a Consensus on Clock},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1348},
      year = {2019},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.