Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Handbook of Applied Cryptography
Handbook of Applied Cryptography
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 and Proof of Ownership
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
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
Zero-knowledge watermark detector robust to sensitivity attacks
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Efficient zero-knowledge watermark detection with improved robustness to sensitivity attacks
EURASIP Journal on Information Security
Protection and retrieval of encrypted multimedia content: when cryptography meets signal processing
EURASIP Journal on Information Security
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
Efficient implementation of zero-knowledge proofs for watermark detection in multimedia data
Transactions on Data Hiding and Multimedia Security I
| Hi-index | 0.00 |
Cryptographic techniques have been deployed to securely prove the presence of a watermark in stego-data without disclosing any security critical information to the detecting party. This paper presents a detailed practical construction and implementation results of a correlation-based non-blind watermarking scheme in the non-interactive zero-knowledge setting. We extensively describe the modifications and hurdles that had to be overcome to transform a well-known watermarking scheme – whose general detection principle is applied in many other known schemes – into a two-party setting where the critical detection input, i.e. the watermark vector and the original data is cryptographically concealed from the verifying party using a commitment scheme. Our prototype implementation is very efficient and is an evidence of the practical feasibility of zero-knowledge watermark detection.