|
Mathematical Foundations of Computer Security
Undeniable onion routing protocol with message creation time verification
N. I. Anisenya Tomsk State University, Tomsk
Abstract:
The problem of message routing in competitive environment of decentralized network is considered and demonstrated by the example of holding task-based CTF contest. Message creation time verification is introduced as an additional requirement of the protocol. An improvement of the undeniable onion routing protocol is described. It allows network participants to verify creation time for transferred messages.
Keywords:
distributed protocols, protected computing, fault-tolerant systems.
Citation:
N. I. Anisenya, “Undeniable onion routing protocol with message creation time verification”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 76–80
Linking options:
https://www.mathnet.ru/eng/pdma259 https://www.mathnet.ru/eng/pdma/y2016/i9/p76
|
|