Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika. Supplement, 2016, Issue 9, Pages 76–80
DOI: https://doi.org/10.17223/2226308X/9/30 (Mi pdma259) 		 
Mathematical Foundations of Computer Security

Undeniable onion routing protocol with message creation time verification

N. I. Anisenya

Tomsk State University, Tomsk
Full-text PDF (562 kB)
References:
PDF
HTML
DOI: https://doi.org/10.17223/2226308X/9/30
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.
Document Type: Article
UDC: 004.75
Language: Russian
Citation: N. I. Anisenya, “Undeniable onion routing protocol with message creation time verification”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 76–80
Citation in format AMSBIB
\Bibitem{Ani16}
\by N.~I.~Anisenya
\paper Undeniable onion routing protocol with message creation time verification
\jour Prikl. Diskr. Mat. Suppl.
\yr 2016
\issue 9
\pages 76--80
\mathnet{http://mi.mathnet.ru/pdma259}
\crossref{https://doi.org/10.17223/2226308X/9/30}
Linking options:
  • https://www.mathnet.ru/eng/pdma259
  • https://www.mathnet.ru/eng/pdma/y2016/i9/p76
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:116
    Full-text PDF :56
    References:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024