Many electronic content providers today like Flickr and Google, offer space to users to publish their electronic media(e.g. photos and videos) in their cloud infrastructures so that they can be publicly accessed. Features like including other information, such as keywords or owner information into the digital material is already offered by existing providers. Despite the useful features made available to users by such infrastructures, the authorship of the published content is not protected against various attacks such as compression. In this paper we propose a robust scheme that uses digital invisible watermarking and hashing to protect the authorship of the digital content and provide resistance against malicious manipulation of multimedia content. The scheme is enhanced by an algorithm called MMBEC, that is an extension of an established scheme MBEC towards higher resistance.
It is known that watermarking-based approaches that make use of must involve a TTP that take part in the embedding phase. Such solution has been reported to have potential drawbacks @cite_12 . In @cite_1 , propose an approach based on the use of . Their protocol allows a prover to convince a verifier of the presence of a watermark without revealing any information that the verifier could use to remove the watermark, something known as . Nevertheless, their protocols still require the existence of another arbitrary Third party along with a Registration Center entity. On the contrary, our approach, having the advantages of , it uses a much simpler but efficient protocol that employs one-way functions for achieving the same result.
@cite_1 @cite_12
1810933997 2136078037 1501096649 2034766017
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any information which the verifier can use to remove the watermark. Existing proposals do not achieve this goal in terms of definition (not formally zero-knowledge), security (unproven) and coverage (handle only blind watermark detection).In this paper we define zero-knowledge watermark detection precisely. We then propose efficient and provably secure zero-knowledge protocols for blind and non-blind versions of a well-known class of watermarking schemes. Using these protocols the security and efficiency of many watermark based applications can be significantly improved.As an example of use we propose concrete protocols for direct proof of ownership which enable offline ownership proofs, i.e., copyright holders can prove their rightful ownership to anyone without involving a trusted third party in the actual proof protocol. Proving ownership rights on outsourced relational databases is a crucial issue in today's internet-based application environments and in many content distribution applications. In this paper, we present a mechanism for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. We formulate the watermarking of relational databases as a constrained optimization problem and discuss efficient techniques to solve the optimization problem and to handle the constraints. Our watermarking technique is resilient to watermark synchronization errors because it uses a partitioning approach that does not require marker tuples. Our approach overcomes a major weakness in previously proposed watermarking techniques. Watermark decoding is based on a threshold-based technique characterized by an optimal threshold that minimizes the probability of decoding errors. We implemented a proof of concept implementation of our watermarking technique and showed by experimental results that our technique is resilient to tuple deletion, alteration, and insertion attacks. Recently, two generic watermarking protocols were proposed, based on a popular zero-knowledge identification protocol. In this paper, we show that both protocols are flawed and therefore fail to achieve their purpose of allowing a prover to prove to a verifier of his ownership of a watermarked image. We also give some suggestions to fix these flaws. A buyer seller watermarking protocol is intended to ensure copyright protection, privacy and security for both the buyer and seller simultaneously in an e-commerce application. A traitor should not be able to deny his responsibility of a copyright violation caused by him in such protocols. This feature is identified as non-repudiation in the literature. An efficient approach taken is through secure embedding of watermarks in an encrypted domain by using dither modulation and homomorphic encryption. To support non-repudiation along with collusion resistance, one needs an asymmetric collusion resistant fingerprinting code that is compatible with the watermarking technique. The design of such codes has not yet studied thoroughly with an exception of a recent work by Charpentier et. al. in [4]. In this paper, we propose an asymmetric binary fingerprinting code based on Boneh-Shaw code. When applied to the secure embedding of watermarks, we show that our code outperforms the code introduced by [4]: (i) we achieve constant communication round, (ii) we do not require any oblivious transfer protocol and (iii) we do not require any public Write Once Read Many (WORM) directory.