scientific article; zbMATH DE number 1942414

MaRDI QIDQ4409111zbMATH OpenFDO

Authors Nicholas J. Hopper, John Langford, Luis von Ahn

Publication date 30 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2442/24420077.htm

zbMATH Keywords

complexitysteganography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 6861949
• Advances in Cryptology - EUROCRYPT 2004
• Provably Secure Steganography and the Complexity of Sampling
• Constructing perfect steganographic systems
• On the universal steganography of optimal rate

Cited in

(36)

• Upper and lower bounds on black-box steganography
• On the gold standard for security of universal steganography
• Stegogames
• Misdirection steganography
• On the universal steganography of optimal rate
• Security levels in steganography -- insecurity does not imply detectability
• A one-time stegosystem and applications to efficient covert communication
• Steganography based on pattern languages
• Cliptography: clipping the power of kleptographic attacks
• Grey-box steganography
• Ensuring Message Embedding in Wet Paper Steganography
• Access control encryption: enforcing information flow with cryptography
• An Epistemological Approach to Steganography
• Grey-box steganography
• Efficient construction of provably secure steganography under ordinary covert channels
• scientific article; zbMATH DE number 1952761 (Why is no real title available?)
• scientific article; zbMATH DE number 6845551 (Why is no real title available?)
• Grey-box public-key steganography
• How to subvert backdoored encryption: security against adversaries that decrypt all ciphertexts
• Advances in Cryptology - EUROCRYPT 2004
• A note on ``On ciphertext undetectability
• Broadcast steganography
• Provably Secure Steganography and the Complexity of Sampling
• Public Key Cryptography - PKC 2006
• An information-theoretic model for steganography
• Steganography-free zero-knowledge
• Anonymous whistleblowing over authenticated channels
• Short concurrent covert authenticated key exchange (short cAKE)
• Lower bounds on anonymous whistleblowing
• Immunizing backdoored PRGs
• Sender-anamorphic encryption reformulated: achieving robust and generic constructions
• Pseudorandom error-correcting codes
• Anamorphic resistant encryption: the good, the bad and the ugly
• Anamorphic-resistant encryption; or why the encryption debate is still alive
• Look ahead! Practical CCA-secure steganography: cover-source switching meets lattice Gaussian sampling
• Publicly-detectable watermarking for language models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409111)