Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A DCT-domain system for robust image watermarking
Signal Processing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Secure, Robust Watermark for Multimedia
Proceedings of the First International Workshop on Information Hiding
Zero Knowledge Watermark Detection
IH '99 Proceedings of the Third International Workshop on Information Hiding
Proving Ownership of Digital Content
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
Short Proofs of Knowledge for Factoring
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Commitment Schemes and Zero-Knowledge Protocols
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
DCT-based watermark recovering without resorting to the uncorrupted original image
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Non-interactive watermark detection for a correlation-based watermarking scheme
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
The return of the sensitivity attack
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
An implementation of, and attacks on, zero-knowledge watermarking
IH'04 Proceedings of the 6th international conference on Information Hiding
Some general methods for tampering with watermarks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Robust digital watermarking systems are important building blocks in applications such as fingerprinting, dispute resolving or direct proofs of authorship, where the presence of a watermark serves as evidence for some fact, e.g., illegal redistribution or authorship. A major drawback of (symmetric) watermarking schemes in this context is that proving the presence of a watermark requires disclosing security critical detection information (watermark, detection key, original data) to a (potentially malicious) verifying party. This may completely jeopardise the security of embedded watermarks once this information is revealed. To overcome this problem recent work on secure watermark detection proposes cryptographic proofs that perform the detection on concealed detection information. The proposed solutions focus on correlation-based detection and can be applied to any watermarking scheme whose detection criteria can be expressed as a polynomial relation between the quantities required for the detection. In this paper, we present in-depth guidelines for the adoptions required to transform well-established watermarking schemes by Cox et al and Piva et al into secure cryptographic proofs in the non-interactive setting. Moreover, we present our implementation, its performance results and the corresponding tool we have developed for this purpose. Our results underpin the practicability of the cryptographic approach.