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, 2014, Issue 7, Pages 89–91 (Mi pdma153)  

This article is cited in 1 scientific paper (total in 1 paper)

Mathematical Foundations of Computer Security

Covert timing channel over HTTP cache-control headers

D. N. Kolegov, O. V. Broslavsky, N. E. Oleksov

Tomsk State University, Tomsk
Full-text PDF (400 kB) Citations (1)
References:
Abstract: The problem of detecting covert channels is known for a long time, but the detection of such channels over HTTP protocol, as one of the most used protocols, is still interesting for researchers. Known examples of covert timing channels over HTTP require changing the structure of HTTP request or modifying the web server, so it is important to discover covert channel for which there is no need to do it. Some of such channels are covert timing channels based on the cache-control headers family of HTTP protocol. The purpose of the work is the development and implementation of the covert timing channels over HTTP cache-control headers Last-Modified and ETag. As a result of the work, it is found that theoretical maximum speed of the channels based on Last-Modified (via Last-Modified value, If-Modified-Since and If-Unmodified-Since headers) is 1 bit/s. That speed is reachable in practice if latency between remote hosts allows to do the request via HTTP and to get the response in 1 second. Accuracy of implementations of the channels is 99.82 % with 1 bit/s speed. Theoretical maximum speed of the channels based on ETag header (via ETag value, If-Match and If-None-Match headers) with default configuration of web server is the same as for Last-Modified covert channels. But usage of PHP language features allows to speed up channel to 1 bit per $(2L+T)$ seconds, where $L$ is a latency between remote hosts and $T$ is a time that is needed for auxiliary operations (as matching headers, storing bits, calculating sleep time etc.). These covert channels' implementations were tested on 2 bit/s speed and showed 99.55 % accuracy.
Keywords: computer security, covert timing channels, HTTP.
Document Type: Article
UDC: 004.94
Language: Russian
Citation: D. N. Kolegov, O. V. Broslavsky, N. E. Oleksov, “Covert timing channel over HTTP cache-control headers”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 89–91
Citation in format AMSBIB
\Bibitem{KolBroOle14}
\by D.~N.~Kolegov, O.~V.~Broslavsky, N.~E.~Oleksov
\paper Covert timing channel over HTTP cache-control headers
\jour Prikl. Diskr. Mat. Suppl.
\yr 2014
\issue 7
\pages 89--91
\mathnet{http://mi.mathnet.ru/pdma153}
Linking options:
  • https://www.mathnet.ru/eng/pdma153
  • https://www.mathnet.ru/eng/pdma/y2014/i7/p89
  • This publication is cited in the following 1 articles:
    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:331
    Full-text PDF :149
    References:45
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024