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, 2015, Issue 8, Pages 96–99
DOI: https://doi.org/10.17223/2226308X/8/36
(Mi pdma210)
 

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

Mathematical Foundations of Computer Security

The capacity of a packet length covert channel

A. V. Epishkinaa, K. G. Kogosb

a National Engineering Physics Institute "MEPhI", Moscow
b National Engineering Physics Institute "MEPhI", Moscow
Full-text PDF (839 kB) Citations (1)
References:
Abstract: Covert channels are used for information hiding and realize one of the most serious security threat. Widespread IP networks allow for designing such channels on the basis of special properties of packet data transfer. Packet length covert channels are resistant to traffic encryption, but some difficulties to detect them are known. It makes significant an investigation of capacity limitation methods. This work presents a technique to estimate and limit the capacity of the covert channels based on the packet length modulation by traffic padding.
Keywords: covert channel, packet length, dummy packet, capacity limitation.
Document Type: Article
UDC: 004.62
Language: English
Citation: A. V. Epishkina, K. G. Kogos, “The capacity of a packet length covert channel”, Prikl. Diskr. Mat. Suppl., 2015, no. 8, 96–99
Citation in format AMSBIB
\Bibitem{EpiKog15}
\by A.~V.~Epishkina, K.~G.~Kogos
\paper The capacity of a~packet length covert channel
\jour Prikl. Diskr. Mat. Suppl.
\yr 2015
\issue 8
\pages 96--99
\mathnet{http://mi.mathnet.ru/pdma210}
\crossref{https://doi.org/10.17223/2226308X/8/36}
Linking options:
  • https://www.mathnet.ru/eng/pdma210
  • https://www.mathnet.ru/eng/pdma/y2015/i8/p96
  • 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:174
    Full-text PDF :84
    References:34
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024