A TTP-Independent Watermarking Protocol Based on Commutative Cryptosystem for Copyright Protection in E-Commerce

For the purpose of deterring unauthorized duplication and distribution of multimedia contents in e-commerce, some Buyer-seller watermarking protocols which combine of traditional watermarking and fingerprinting techniques have been proposed, However, previous protocols have potential risk from trust third party （TTP） because all entities （including multi-buyers and multi-sellers） mentioned in protocol construct a star tupology like connection, in which the watermark certification authority （WCA） serves as the central point in the interaction and therefore its availability probably turns out to be the vital bottleneck of reliability and efficiency to the whole system. Secondly, WCA holds entire information about watermark used hy Buyers so that an innocent Buyer can he found as guilty if WCA collude with the Seller. In this paper, we propose a watermarking protocol to address the problems using cryptographic technologies in phase of watermark generation. The resuh is a TTP-independent and collusion-secure buyer-seller watermarking protocol.

A New Watermarking Protocol against Conspiracy

A trusted third party introduced in watermarking protocols would decrease the security and affect the implementation of the protocols. In this paper, a new watermarking protocol with an un-trusted third party （UTTP） was proposed. Based on the idea of all-or-nothing disclosure of secret （ANDOS）, all of the buyer, the seller and the third party didn＇t know the exact watermark, which was embedded in a digital content for tracing piracy. The proposed protocol provided mechanisms to trace piracy and protect customer＇s right. In addition, the problem that a seller colluded with UTTP to frame the buyer, namely, the conspiracy problem, could be avoided.

Research on secure buyer-seller watermarking protocol

A new buyer-seller watermarking protocol is proposed by applying a double encryption method and a novel mechanism of embedding a buyer＇s watermark. The protocol can effectively prevent against collusion attacks and the man in the middle attack if the third party is not trusted. Also, based on the proposed scheme for the first-hand transaction, a new buyer-reseller watermarking protocol and a formal multi-party watermarking protocol are also proposed. The proposed buyer-resell watermarking protocol only needs the original seller to provide transfer certificate and encryption-decryption service to support the second-hand transaction, and the multi-party watermarking protocol with distributed certificate authorities can overcome the difficulty in the combination of multicast mechanism with multiple unique watermarks and allow a seller to multicast the watermarked digital contents and key transaction information to n buyers. Furthermore, the idea of zero knowledge proof is also applied into the proposed scheme to allow the seller to take an effective control on the task performed by the third party.

Analysis and Enhancement of a Watermarking Protocol Suitable for Web Context

<Abstract>A buyer-seller watermarking protocol is a combination of traditional watermarking and fingerprinting techniques. Recently, Frattolillo proposed such a watermarking protocol suitable for web context. Frattolillo’s scheme has two problems which would make it hard to implement practically. Several possible solutions to the two problems are presented in this paper.

A New Buyer-Seller Watermarking Protocol Without Double Embedding

<Abstract>Copy deterrence is a digital watermarking application which enables a seller to identify the buyers who obtain digital content legally but illegally redistribute it. However, in many buyer-seller watermarking protocols proposed for copy deterrence, the seller has to embed two watermarks into each copy of the digital content before it is sold. In this paper, we propose a new buyer-seller watermarking protocol in which the seller can reduce the number of the embedded watermarks from two to one. The proposed protocol also provides a more efficient solution to the unbinding problem than that of Lei et al’s scheme.