The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th 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
Zero-Knowledge Watermark Detection and Proof of Ownership
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Overcoming the obstacles of zero-knowledge watermark detection
Proceedings of the 2004 workshop on Multimedia and security
Zero-knowledge watermark detector robust to sensitivity attacks
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Watermarking Systems Engineering (Signal Processing and Communications, 21)
Watermarking Systems Engineering (Signal Processing and Communications, 21)
Breaking the BOWS watermarking system: key guessing and sensitivity attacks
EURASIP Journal on Information Security
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
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
Zero-knowledge watermark detectors presented to date are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of being attacked by sensitivity attacks, for which zero-knowledge does not provide protection. In this paper, an efficient zero-knowledge version of the generalized Gaussian maximum likelihood (ML) detector is introduced. This detector has shown an improved resilience against sensitivity attacks, that is empirically corroborated in the present work. Two versions of the zero-knowledge detector are presented; the first one makes use of two new zero-knowledge proofs for absolute value and square root calculation; the second is an improved version applicable when the spreading sequence is binary, and it has minimum communication complexity. Completness, soundness, and zero-knowledge properties of the developed protocols are proved, and they are compared with previous zero-knowledge watermark detection protocols in terms of receiver operating characteristic, resistance to sensitivity attacks, and communication complexity.