Geodesic
Undeniable onion routing protocol with message creation time verification
Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 76-80 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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. 
@article{PDMA_2016_9_a29,
     author = {N. I. Anisenya},
     title = {Undeniable onion routing protocol with message creation time verification},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {76--80},
     year = {2016},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2016_9_a29/}
}
TY  - JOUR
AU  - N. I. Anisenya
TI  - Undeniable onion routing protocol with message creation time verification
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2016
SP  - 76
EP  - 80
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/PDMA_2016_9_a29/
LA  - ru
ID  - PDMA_2016_9_a29
ER  - 
%0 Journal Article
%A N. I. Anisenya
%T Undeniable onion routing protocol with message creation time verification
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2016
%P 76-80
%N 9
%U http://geodesic.mathdoc.fr/item/PDMA_2016_9_a29/
%G ru
%F PDMA_2016_9_a29
N. I. Anisenya. Undeniable onion routing protocol with message creation time verification. Prikladnaya Diskretnaya Matematika. Supplement, no. 9 (2016), pp. 76-80. http://geodesic.mathdoc.fr/item/PDMA_2016_9_a29/

[1] Anisenya N. I., “Razrabotka bezopasnogo protokola raspredelennoi sistemy provedeniya sorevnovanii CTF”, Prikladnaya diskretnaya matematika, 2015, no. 2(28), 59–70