Public Key Cryptography - PKC 2006

DOI10.1007/11745853MaRDI QIDQ5898940zbMATH OpenOpenAlexFDO

Authors Anna Lysyanskaya, Mira Meyerovich

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11745853

zbMATH Keywords

digital signaturesInformation hidingMarkov processessteganography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Constructing perfect steganographic systems
• Security levels in steganography -- insecurity does not imply detectability
• Provably Secure Steganography and the Complexity of Sampling
• scientific article; zbMATH DE number 1942414
• Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

Cited in

(10)

• On the gold standard for security of universal steganography
• On the universal steganography of optimal rate
• Security levels in steganography -- insecurity does not imply detectability
• Grey-box steganography
• Grey-box steganography
• Efficient construction of provably secure steganography under ordinary covert channels
• Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources
• Grey-box public-key steganography
• Provably Secure Steganography and the Complexity of Sampling
• Constructing perfect steganographic systems

This page was built for publication: Public Key Cryptography - PKC 2006

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