An algorithm for finding Hamilton cycles in random graphs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Attack modelling: towards a second generation watermarking benchmark
Signal Processing - Special section on information theoretic aspects of digital watermarking
Non-Interactive Zero-Knowledge Proof Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Zero Knowledge Watermark Detection
IH '99 Proceedings of the Third International Workshop on Information Hiding
Zero-Knowledge Watermark Detection and Proof of Ownership
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Fast public-key watermarking of compressed video
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Overcoming the obstacles of zero-knowledge watermark detection
Proceedings of the 2004 workshop on Multimedia and security
Geometric distortion-resilient image hashing system and its application scalability
Proceedings of the 2004 workshop on Multimedia and security
An implementation of, and attacks on, zero-knowledge watermarking
IH'04 Proceedings of the 6th international conference on Information Hiding
IEEE Journal on Selected Areas in Communications
Zero-knowledge watermark detection resistant to ambiguity attacks
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
| Hi-index | 0.00 |
Most watermarking methods presented so far belong to the category of symmetric watermarking in that the secret key is undesirably revealed during the watermark detection process. In view of this security leakage, zero-knowledge watermark detection (ZKWD) has been introduced without obviously revealing the secret information. However, the existing ZKWD protocols still suffer from some challenging problems, which will be addressed in this paper. First, a zero-knowledge watermark detection protocol is presented based on our robust image watermark scheme so that robustness against removal and geometric attacks can still be retained. The aim is to extend the capability of our own system to satisfy more watermarking requirements as possible. Second, the watermarks revealed for zero-knowledge detection are still secured by a secret key-based shuffling function so that the verifier cannot have the knowledge about the hidden watermarks. Third, we show how our protocol can be operated in a non-interactive way. Finally, in order to prevent from cheating prover, the Hamiltonian cycle is introduced in a media data before its publication. Thus, the overall characteristics distinguish our protocol from the existing protocols significantly.