Public Watermark Detection Resistant to Sensitivity Attacks

Hong Wang; Shi Min Wei

doi:10.4028/www.scientific.net/KEM.474-476.1865

Paper Titles

Effects of Vocational School Students’ Web-Based Collaborative Learning on Diagnosis and Repair in Automobile Electrical Systems – Cases of Starting, Charging and Ignition Systems
p.1840

The Way of Selection Antenna in Distributed Wireless Communication System
p.1849

Sensitivity Analysis of Large Unit Spiral Case for Different Reinforcement Arrangement
p.1855

Design of Image Classification System Based on Feature Extraction
p.1859

Public Watermark Detection Resistant to Sensitivity Attacks
p.1865

Numerical Simulation of Penetration Effect of Spherical Fragment on Square Honeycomb Sandwich Plate
p.1869

A Customer Credit Visual Analytics Model Based on Markov Logic Networks
p.1874

The Research of SiCand Si₃N₄Whiskers Reinforced Si₃N₄ Composites to Improve its Wear and Mechanical Properties
p.1881

The Environmental Management and Corporate Social Responsibility of Small and Medium-Sized Enterprises: A Marginal Strategic Challenge?
p.1887

HomeKey Engineering MaterialsKey Engineering Materials Vols. 474-476Public Watermark Detection Resistant to...

Public Watermark Detection Resistant to Sensitivity Attacks

Abstract:

A public watermark detection scheme using verifiable secret sharing is proposed. It removes the expensive zero-knowledge interactive proofs and replaces the traditional trusted third party with a group of proxies. Moreover, the scheme is secure against sensitivity attacks and very efficient in terms of computation cost, the number of rounds and bandwidth required in the communications.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Pages:

1865-1868

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.474-476.1865

Citation:

Cite this paper

Online since:

April 2011

Authors:

Hong Wang, Shi Min Wei

Keywords:

Digital Watermark, Integer Comparison, Public Watermark Detection, Sensitivity Attack, Verifiable Secret Sharing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] T. Furon and P. Duhamel. An asymmetric public detection watermarking technique. 3rd Intl. Workshop on Information Hiding, LNCS 1768: 88–100, (2000).

DOI: 10.1007/10719724_7

Google Scholar

[2] J.J. Eggers, J.K. Su, and B. Girod. Public key watermarking by eigenvectors of linear transforms. European Signal Processing Conference, September (2000).

Google Scholar

[3] J.J. Eggers, J.K. Su, and B. Girod. Asymmetric watermarking schemes. Sicherheit in Mediendaten, September (2000).

Google Scholar

[4] A. Adelsbach and A. Sadeghi. Zero-knowledge watermark detection and proof of ownership. 4th Int. Workshop on Info. Hiding, LNCS 2137: 273–288, (2000).

DOI: 10.1007/3-540-45496-9_20

Google Scholar

[5] S. Craver and S. Katzenbeisser. Copyright protection protocols based on asymmetric watermarking. In CMS'01, pages 159–170, (2001).

Google Scholar

[6] Q. Li and E. -C. Chang. ZeroKnowledge Watermark Detection Resistant to Ambiguity Attacks. MM&Sec'06, pp.158-163, September 26–27, 2006, Geneva, Switzerland.

Google Scholar

[7] Juan Ram´on Troncoso-Pastoriza, Fernando P´erez-Gonz´alez. Zero-Knowledge Watermark Detector Robust to Sensitivity Attacks. MM&Sec'06, pages 97-107, September 26–27, 2006, Geneva, Switzerland.

DOI: 10.1145/1161366.1161383

Google Scholar

[8] Q. Li and E. -C. Chang. Public watermark detection using multiple proxies and secret sharing. In International Workshop on Digital Watermarking, volume 2939 of LNCS, pages 558–569, Seoul, Korea, October (2003).

DOI: 10.1007/978-3-540-24624-4_45

Google Scholar

[9] I.J. Cox, M.L. Miller, and J.A. Bloom. Digital Watermarking. Morgan Kaufmann, (2002).

Google Scholar

[10] Yair Frankel, Philip MacKenzie, and Moti Yung. Adaptively secure distributed public-key systems. Theoretical Computer Science, Vol. 2002, No. 287, p.535–561, (2002).

DOI: 10.1016/s0304-3975(01)00260-2

Google Scholar

[11] I. Damg˚ard, M. Fitzi, E. Kiltz, J.B. Nielsen, and T. Toft, Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation, Proc. 3rd Theory of Cryptography Conference, LNCS 3876, p.285–304, Springer Verlag, (2006).

DOI: 10.1007/11681878_15

Google Scholar