Results concerning the bandwidth of subliminal channels

被引:19
作者
Simmons, GJ [1 ]
机构
[1] Sandia Natl Labs, Albuquerque, NM 87106 USA
关键词
communication system security; cryptography; data security; game theory; information rates; protocols;
D O I
10.1109/49.668970
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In conjunction with a six-month research program on Computer Security, Cryptology and Coding Theory hosted by the Isaac Newton Institute of Mathematical Sciences, University of Cambridge, Cambridge, U.K., a Workshop on Information Hiding was held from May 30 through June 1, 1996. This workshop was devoted to all aspects of information hiding-other than the usual cryptographic concealment of content, including steganography, subliminal channels, fingerprinting, covert channels, etc. Two surprising results pertaining to subliminal channels were presented or grew out of presentations made at this workshop. One is of interest to the secure communications protocol designer concerned with denying the use of subliminal channels, while the other is important to the designer, or user, of subliminal channels. The first raises the question of whether the notion of a "subliminal-free" communication channel is an oxymoron, i.e., is it possible to force the bandwidth of the subliminal channel to be truly zero? The second forces a more precise formulation of a conjecture the author had made that the bandwidth of a subliminal channel is logarithmically limited if the transmitter is unwilling to trust the subliminal receiver unconditionally. Motivated by these results, this paper reexamines the fundamental questions of the bandwidth available for subliminal communication as a function of the trust the transmitter has in the subliminal receiver and of a logically sound interpretation of the term "subliminal-free."
引用
收藏
页码:463 / 473
页数:11
相关论文
共 13 条
[1]  
ANDERSON R, 1996, P 1 INT WORKSH INF H, P151
[2]  
BRICKELL EF, 1986, ADV CRYPTOLOGY, P28
[3]   Simmons' protocol is not free of subliminal channels [J].
Desmedt, Y .
9TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 1996, :170-175
[4]   A PUBLIC KEY CRYPTOSYSTEM AND A SIGNATURE SCHEME BASED ON DISCRETE LOGARITHMS [J].
ELGAMAL, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) :469-472
[5]  
MAURER U, 1993, P EUROCRYPT 92 ADV C, P429
[6]   IMPROVED ALGORITHM FOR COMPUTING LOGARITHMS OVER GF(P) AND ITS CRYPTOGRAPHIC SIGNIFICANCE [J].
POHLIG, SC ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :106-110
[7]   MONTE-CARLO METHODS FOR INDEX COMPUTATION (MOD P) [J].
POLLARD, JM .
MATHEMATICS OF COMPUTATION, 1978, 32 (143) :918-924
[8]  
Simmons G. J., 1985, Advances in Cryptology. Proceedings of EUROCRYPT 84 - A Workshop on the Theory and Application of Cryptographic Techniques, P364
[9]  
SIMMONS GJ, 1994, EUR T TELECOMMUN, V5, P459
[10]  
SIMMONS GJ, 1995, P IMA C CRYPT COD CI, P383