Watermark Integrity Verification via Multi-Key Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In the field of watermarking, existing technologies face challenges in accurately identifying the source of content leakage due to errors in detection processes or framing attacks, which can falsely accuse innocent users and allow collusive framing of others.
Innovation Solution
A system that embeds a watermark by encrypting an information element multiple times using different cryptographic keys, allowing for verification by comparing decrypted values across encrypted instances to ensure the integrity of the embedded data, thereby preventing false accusations and collusive framing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If watermark detection is performed using traditional single-key encryption, then the detection process is simple and fast, but the system is vulnerable to framing attacks and false accusations
Solution Approach 1:
The patent segments the watermark verification process into multiple independent stages: extracting multiple candidate information elements from the watermark, decrypting each candidate with different cryptographic keys, and verifying each decryption result separately. This segmentation allows the system to maintain high reliability through multiple verification steps while keeping each individual verification operation relatively simple and efficient.
Solution Approach 2:
The patent performs preliminary actions by pre-encrypting the same information element multiple times with different cryptographic keys before embedding in the watermark. During verification, these pre-prepared encrypted versions enable rapid comparison and validation without requiring complex real-time computation, thus improving reliability while controlling system complexity.
2Reliability
If multiple cryptographic keys are used to encrypt the information element, then the confidence in identifying the correct user increases, but the computational overhead and processing time increase
Solution Approach 1:
The patent applies partial action by extracting only the necessary portion of the watermark containing encrypted information elements and processing only those specific segments. Rather than verifying the entire watermark or attempting all possible key combinations, the system focuses computational resources on the relevant encrypted candidates, thereby achieving high confidence in identification while minimizing unnecessary processing time.
Solution Approach 2:
The patent uses copying by creating multiple copies of the same information element encrypted with different keys. During verification, these copies are decrypted and compared against each other. If multiple decryptions yield consistent results, confidence in identification increases. This copying approach distributes the verification workload across multiple simple operations rather than requiring one complex verification process.
3Object-affected harmful factors
If traditional watermark embedding is used without verification mechanisms, then the embedding process is efficient and simple, but the system cannot prevent collusive framing attacks
Solution Approach 1:
The patent implements beforehand cushioning by embedding multiple encrypted versions of the same information element within the watermark during the embedding phase. This preparatory measure creates a built-in verification mechanism that cushions the system against framing attacks. When verification is needed, the system can cross-check multiple encrypted candidates to identify the correct information element, preventing false accusations without requiring complex additional security infrastructure.
Data Source
AI summary
In one embodiment, a system including a processor is operative to receive a content item including a watermark encoding a series of encrypted bits deriving from encrypting an information element multiple times, extract at least some encrypted bits from at least part of the watermark, decrypt a series of N bits using a first key yielding a first value, the series of N bits including Q bits of the encrypted bits and K, greater than, or equal to zero, guessed bits, re-encrypt the first value using a second key yielding a second value, and compare at least part of the second value to M bits of the encrypted bits to determine if at least part of the second value matches the M bits in order to provide a level of confidence that the first value is the information element which was encrypted and embedded as the watermark.