Public-Key Steganography with Active Attacks

Backes, Michael; Cachin, Christian

doi:10.1007/978-3-540-30576-7_12

Cited by 57 publications

(62 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A common approach to realize public-key stegosystems is the "encrypt-then-embed" paradigm [4,28,29,44], depicted in Fig. 2.…”

Section: Channelsmentioning

confidence: 99%

“…As shown in [4,44], if the channel is always informative, H is a strongly universal hash function, and c is uniformly random, then the maximum statistical distance between s 1 ← Sample(λ, h, H, c) and s 2 ← C |c| h for any valid h ∈ Σ * is negligible in the security parameter λ. For simplicity, we denote this statistical distance when |c| = 1 by 1 in the reminder of the paper.…”

Section: A Bs-cha-secure Constructionmentioning

confidence: 99%

“…Adaptive, Standard Outsider Yes designated set of receivers, so that authorized recipients correctly recover the original content, while unauthorized users and outsiders remain unaware of the covert communication. To construct broadcast steganography, we employ the "encrypt-then-embed" paradigm that underpins most steganographic constructions [4,28,29,44] (cf. Sect.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Broadcast Steganography

Fazio

Nicolosi

Perera

2014

Topics in Cryptology – CT-RSA 2014

View full text Add to dashboard Cite

We initiate the study of broadcast steganography (BS), an extension of steganography to the multi-recipient setting. BS enables a sender to communicate covertly with a dynamically designated set of receivers, so that the recipients recover the original content, while unauthorized users and outsiders remain unaware of the covert communication. One of our main technical contributions is the introduction of a new variant of anonymous broadcast encryption that we term outsider-anonymous broadcast encryption with pseudorandom ciphertexts (oABE$). Our oABE$ construction achieves sublinear ciphertext size and is secure in the standard model. Besides being of interest in its own right, oABE$ enables an efficient construction of BS secure in the standard model against adaptive adversaries with sublinear communication complexity.

show abstract

“…A common approach to realize public-key stegosystems is the "encrypt-then-embed" paradigm [4,28,29,44], depicted in Fig. 2.…”

Section: Channelsmentioning

confidence: 99%

Section: A Bs-cha-secure Constructionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Broadcast Steganography

Fazio

Nicolosi

Perera

2014

Topics in Cryptology – CT-RSA 2014

View full text Add to dashboard Cite

show abstract

“…Modern cryptography already uses established formal models and definitions for information-theoretic and computational security. Inspired by cryptographic methodology similar approaches have been proposed for steganography [1,2,3,4]. In contrast, less investigation has been done with this regard for watermarking schemes, and the existing approaches do not cover the subtle aspects essential for reasonable formal security definitions, analysis and abstraction of watermarking schemes.…”

Section: Motivationmentioning

confidence: 99%

“…2 Due to the fundamental difference between steganography and digital watermarking, one cannot simply adapt recent definitions of steganographic security [3,4].…”

Section: Motivationmentioning

confidence: 99%

A Computational Model for Watermark Robustness

Adelsbach

Katzenbeisser²,

Sadeghi

Information Hiding

View full text Add to dashboard Cite

Abstract. Multimedia security schemes often combine cryptographic schemes with information hiding techniques such as steganography or watermarking. Example applications are dispute resolving, proof of ownership, (asymmetric/anonymous) fingerprinting and zero-knowledge watermark detection. The need for formal security definitions of watermarking schemes is manifold, whereby the core need is to provide suitable abstractions to construct, analyse and prove the security of applications on top of watermarking schemes. Although there exist formal models and definitions for information-theoretic and computational security of cryptographic and steganographic schemes, they cannot simply be adapted to watermarking schemes due to the fundamental differences among these approaches. Moreover, the existing formal definitions for watermark security still suffer from conceptual deficiencies.In this paper we make the first essential steps towards an appropriate formal definition of watermark robustness, the core security property of watermarking schemes: We point out and discuss the shortcomings of the existing proposals and present a formal framework and corresponding definitions that cover those subtle aspects not considered in the existing literature. Our definitions provide suitable abstractions that are compatible to cryptographic definitions allowing security proofs of composed schemes. MotivationMultimedia applications deploy various cryptographic and watermarking techniques to maintain security. Typical application scenarios are dispute resolving, proof of authorship and asymmetric and anonymous fingerprinting.In this context, the security analysis and security proofs for the resulting composed schemes require a suitable formal framework and reasonable security definitions. Modern cryptography already uses established formal models and definitions for information-theoretic and computational security. Inspired by cryptographic methodology similar approaches have been proposed for

show abstract

Bibliography

2012

Machine Learning in Image Steganalysis

View full text Add to dashboard Cite

Public-Key Steganography with Active Attacks

Cited by 57 publications

References 23 publications

Broadcast Steganography

Broadcast Steganography

A Computational Model for Watermark Robustness

Bibliography

Contact Info

Product

Resources

About