How to construct random functions
Journal of the ACM (JACM)
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Subliminal communication is easy using the DSA
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
Asymmetric cryptography with S-Boxes
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Cryptanalysis of ``2 R'' Schemes
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Abuses in Cryptography and How to Fight Them
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Proceedings of the First International Workshop on Information Hiding
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Cryptanalysis of Patarin's 2-round public key system with S boxes (2R)
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Backdoor attacks on black-box ciphers exploiting low-entropy plaintexts
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
The history of subliminal channels
IEEE Journal on Selected Areas in Communications
Kleptographic attacks on a cascade of mix servers
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
| Hi-index | 0.00 |
In this paper we present the first general purpose subliminal channel that can be built into a secret symmetric cipher by a malicious designer. Subliminal channels traditionally exploit randomness that is used in probabilistic cryptosystems. In contrast, our channel is built into a deterministic block cipher, and thus it is based on a new principle. It is a broadcast channel that assumes that the sender and the receiver know the subliminal message ms (i.e., something derived from their common key). We show that the designer can expect to be able to read ms when O(|ms|log|ms|) plaintext/ciphertext pairs are obtained. Here |ms| is the length of ms in bits. We show how to turn the channel into a narrowcast channel using a deterministic asymmetric cipher and then present an application of the narrowcast channel. In this application, the secret block cipher securely and subliminally transmits the symmetric key of the sender and receiver to the malicious designer and confidentiality holds even when the cipher is made public.