Further processing options

Watermarking Security.

Bibliographic Details
Authors and Corporations: Bas, Patrick., Furon, Teddy., Cayre, François., Doërr, Gwenaël., Mathon, Benjamin.
Other Authors: Furon, Teddy. , Cayre, François. , Doërr, Gwenaël. , Mathon, Benjamin.
Type of Resource: E-Book
Language: English
published:
Singapore : Springer Singapore Pte. Limited, 2016.
©2016.
Series: SpringerBriefs in Electrical and Computer Engineering Ser.
Subjects:
Source: Ebook Central
ISBN: 9789811005060
Table of Contents:
  • Intro
  • Foreword
  • Contents
  • 1 General Introduction
  • 1.1 Forewords
  • 1.2 Notations
  • 1.3 Watermarking and Security
  • 1.3.1 The Needs for Watermarking Security
  • 1.3.2 Who Are the Adversaries?
  • 1.3.3 Standardising Watermarking Security
  • 1.3.4 Security or Robustness?
  • 1.3.5 The Stakes Behind Watermarking Security
  • References
  • 2 A Quick Tour of Watermarking Techniques
  • 2.1 Basic Principles
  • 2.1.1 Watermarking Constraints
  • 2.1.2 Zero-Bit and Multi-bit Watermarking
  • 2.1.3 A Processing View
  • 2.1.4 The Geometrical View
  • 2.1.5 Three Fundamental Constraints
  • 2.2 Spread Spectrum and Improved Spread Spectrum
  • 2.2.1 Improved Spread Spectrum
  • 2.3 Correlation Based Zero-Bit Watermarking
  • 2.4 Watermarking Based on Dirty Paper Codes
  • 2.4.1 Distortion Compensated Quantisation Index Modulation (DC-QIM)
  • 2.4.2 Scalar Costa Scheme (SCS)
  • 2.4.3 Trellis-Based Watermarking
  • 2.5 Conclusions of the Chapter
  • References
  • 3 Fundamentals
  • 3.1 Introduction: Information Theoretical Approaches
  • 3.2 Watermarking Security Classes
  • 3.2.1 Embedding Security Classes
  • 3.3 Measuring Watermarking Security Using the Effective Key Length
  • 3.3.1 How to Define the Secret Key in Watermarking?
  • 3.3.2 The Effective Key Length
  • 3.3.3 Definition of the Effective Key Length
  • 3.3.4 Mathematical Expressions of the Effective Key Length for ISS
  • 3.3.5 Practical Effective Key Length Computations
  • 3.3.6 Security Analysis of Watermarking Schemes
  • 3.4 Conclusions of the Chapter
  • References
  • 4 Secure Design
  • 4.1 Secure Spread-Spectrum Embedding
  • 4.1.1 Natural Watermarking
  • 4.1.2 Circular Watermarking
  • 4.1.3 Distribution Matching and Distortion Minimization
  • 4.1.4 Informed Secure Embedding for Gaussian Hosts
  • 4.2 Secure Quantization Based Embedding
  • 4.2.1 Scalar Costa Scheme
  • 4.2.2 Soft Scalar-Costa-Scheme.
  • 4.2.3 Embedding Computation and Decoding
  • 4.2.4 Performance Analysis
  • 4.3 Applied Watermarking Security
  • 4.3.1 Four Nested Spaces
  • 4.3.2 Embedding and Detection
  • 4.3.3 Proportional Embedding
  • 4.3.4 Experimental Investigations
  • 4.3.5 Counter-Attacks
  • 4.4 Conclusions of the Chapter
  • References
  • 5 Attacks
  • 5.1 SS-Based Embedding Security
  • 5.1.1 Attacks Using Independent Component Analysis
  • 5.1.2 A Subspace Estimation Approach for Broken Arrows
  • 5.2 Attacks on Dirty Paper Trellis Schemes
  • 5.2.1 DPT Parameters Estimation
  • 5.2.2 Patterns Estimation Using a Clustering Method
  • 5.3 Conclusions of the Chapter
  • References
  • 6 Conclusions and Open Problems
  • References.