Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 176

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

An Efficient and Anonymous Buyer-Seller Watermarking Protocol

Lei, C.-L., Yu, P.-L., Tsai, P.-L., Chan, M.-H. · 2004 · IEEE Transactions on Image Processing

Abstract

For the purpose of deterring unauthorized duplication and distribution of multimedia contents, a seller may insert a unique digital watermark into each copy of the multimedia contents to be sold. When an illegal replica is found in the market sometime later, the seller can determine the responsible distributor by examining the watermark embedded. However, the accusation against the charged distributor, who was the buyer in some earlier transaction, is objectionable because the seller also has access to the watermarked copies and, hence, is able to release such a replica on her own. In this paper, a watermarking protocol is proposed to avoid such difficulties, known as the customer's right problem, in the phase of arbitration. The proposed watermarking protocol also provides a fix to Memon and Wong's scheme by solving the unbinding problem. In addition, the buyer is no longer required to contact the watermark certification authority during transactions, and the anonymity of the buyer can be retained through a trusted third party. The result is an efficient and anonymous buyer-seller watermarking protocol.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tip.2004.837553

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 176

Metadata

Authors
Lei, C.-L., Yu, P.-L., Tsai, P.-L., & Chan, M.-H.
Venue
IEEE Transactions on Image Processing
Published
2004-12
Volume
13
Issue
12
Pages
1618-1626
ISSN
1057-7149 (ISSN-L)
OpenAlex
W2156336113
Cited by
176
References
1
FWCI
11.21
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An Efficient and Anonymous Buyer-Seller Watermarking Protocol. https://app.cochat.ai/papers/10.1109/tip.2004.837553
The paper
Lei, C.-L., Yu, P.-L., Tsai, P.-L., & Chan, M.-H. (2004). An Efficient and Anonymous Buyer-Seller Watermarking Protocol. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2004.837553

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.