Covert Channels in LAN's

@article{Girling1987CovertCI,
  title={Covert Channels in LAN's},
  author={C. G. Girling},
  journal={IEEE Transactions on Software Engineering},
  year={1987},
  volume={SE-13},
  pages={292-296}
}
  • C. G. Girling
  • Published 1987
  • Computer Science
  • IEEE Transactions on Software Engineering
    • An information transfer path that allows information to be transferred in a manner that violates the security policy of a trusted network is called a covert channel. 
    View on IEEE
    doi.org
    198 Citations
    Highly Influential Citations
    14
    Background Citations
    88
    Methods Citations
    33
    Results Citations
    3
    198 Citations
    Citation Type

    Citation Type

    Covert Channels in LAN Protocols
    • 88
    HIDE_DHCP: Covert Communications through Network Configuration Messages
    • 16
    • PDF
    A Novel Covert Channel Based on Length of Messages
    • 51
    An Evaluation Framework for the Analysis of Covert Channels in the TCP/IP Protocol Suite
    • 10
    • PDF
    Covert communications through network configuration messages
    • 15
    • PDF
    Information hiding
    • 14
    A CHANNEL ANALYSIS IN NETWORK SECURITY - USING A COVERT APPROACH
    • 2
    • PDF
    A survey of covert channels and countermeasures in computer network protocols
    • 421
    • Highly Influenced
    • PDF
    Research on Construction Methods for Network Covert Channels Based on HTTP
    Covert Channel Research
    • 16

    References

    SHOWING 1-10 OF 18 REFERENCES
    Cryptographic Protocol for Trustable Match Making
    • 33
    How to exchange (secret) keys
    • 157
    Safeguarding cryptographic keys
    • G. R. Blakley
    • Computer Science
    • 1979 International Workshop on Managing Requirements Knowledge (MARK)
    • 1979
    • 2,224
    A randomized protocol for signing contracts
    • 1,341
    • PDF
    New directions in cryptography
    • 13,685
    • PDF
    Cryptography and Data Security
    • 1,908
    How to share a secret
    • 11,416
    • PDF
    An Improved Algorithm for Computing Logarithms over GP(p) and Its Cryptographic Significance
    • 530
    • PDF
    An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
    • 1,041
    RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure
    • 15