Undeniable onion routing protocol with message creation time verification | Applied Discrete Mathematics. Supplement. 2016. № 9.

HomeIssuesUndeniable onion routing protocol with message creation time verification | Applied Discrete Mathematics. Supplement. 2016. № 9.

Undeniable onion routing protocol with message creation time verification

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.

Download file
Counter downloads: 206

Keywords

distributed protocols, protected computing, fault-tolerant systems, распределённые протоколы, защищённые вычисления, отказоустойчивые системы

Authors

NameOrganizationE-mail
Anisenya N. I.Tomsk State Universityanisenya@gmail.com
Всего: 1

References

Undeniable onion routing protocol with message creation time verification | Applied Discrete Mathematics. Supplement. 2016. № 9.

Undeniable onion routing protocol with message creation time verification | Applied Discrete Mathematics. Supplement. 2016. № 9.

Download full-text version
Counter downloads: 1385