Elements of information theory
Elements of information theory
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
SIAM Journal on Computing
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
An Information-Theoretic Approach to Steganography and Watermarking
IH '99 Proceedings of the Third International Workshop on Information Hiding
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An information-theoretic model for steganography
Information and Computation
Upper and lower bounds on black-box steganography
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the limits of steganography
IEEE Journal on Selected Areas in Communications
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
IEEE Transactions on Information Forensics and Security
Obtaining higher rates for steganographic schemes while maintaining the same detectability
IH'10 Proceedings of the 12th international conference on Information hiding
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On steganographic chosen covertext security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Provably secure steganography with imperfect sampling
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Provably secure steganography and the complexity of sampling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Theoretical Computer Science
| Hi-index | 0.00 |
A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CCA) and a relaxation called steganographic security against publicly-detectable replayable adaptive chosen-covertext attacks (SS-PDR-CCA) are formalized. These notions are closely related to CCA-security and PDR-CCA-security for public-key cryptosystems. In particular, it is shown that any SS-(PDR-)CCA stegosystem is a (PDR-)CCA-secure public-key cryptosystem and that an SS-PDR-CCA stegosystem for any covertext distribution with sufficiently large min-entropy can be realized from any PDR-CCA-secure public-key cryptosystem with pseudorandom ciphertexts.