An efficient buyer-seller watermarking protocol based on composite signal representation

MMandSec'09 - Proceedings of the 11th ACM Multimedia Security Workshop

Volumn , Issue , 2009, Pages 9-18

  Deng, Mina ^a   Bianchi, Tiziano ^b   Piva, Alessandro ^b   Preneel, Bart ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

E.2 data storage representations : object representation; K.4.4 computers and society : electronic commerce; Performance; Security

Indexed keywords

BUYER-SELLER WATERMARKING; COMMUNICATION BANDWIDTH; COMPLEXITY ANALYSIS; COMPUTATIONAL OVERHEADS; COPYRIGHT PROTECTION ,; DATA STORAGE REPRESENTATION; HOMOMORPHIC PUBLIC-KEY; K.4.4 [COMPUTERS AND SOCIETY]: ELECTRONIC COMMERCE; OBJECT REPRESENTATIONS; PERFORMANCE; PRIVACY PROTECTION; SIGNAL REPRESENTATIONS; WATERMARKING TECHNIQUES;

COPYRIGHTS; DATA STORAGE EQUIPMENT; ELECTRONIC COMMERCE; IMAGE QUALITY; MULTIMEDIA SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SALES; TELECOMMUNICATION SYSTEMS; WATERMARKING;

NETWORK SECURITY;

EID: 70449671086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1597817.1597820     Document Type: Conference Paper

References (26)

1. M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: the case of dynamic groups. In Topics in Cryptology - CT-RSA 2005, LNCS 3376, pages 136-153, 2005.
2. T. Bianchi, A. Piva, and M. Barni. Efficient pointwise and blockwise encrypted operations. In Proc. of ACM Multimedia & Security Workshop 2008, pages 85-90, Oxford, UK, 2008.
3. J. Camenisch. Efficient anonymous fingerprinting with group signatures. In ASIACRYPT, LNCS 1976, pages 415-428, 2000.
4. J. Camenisch and J. Groth. Group signatures: Better efficiency and new theoretical aspects. In proceedings of SCN'04, pages 120-133, 2005.
5. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Adv. in Cryptology - EUROCRYPT 1999, LNCS 1592, pages 106-121, 1999.
6. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Adv. in Cryptology - CRYPTO 2003, LNCS 2729, pages 126-144, 2003.
7. B. Chen and G. Wornell. Quantization index modulation: a class of provably good methods for digital watermarking and information embedding. IEEE Trans. on Information Theory, 47(4):1423-1443, May 2001.
8. I. J. Cox, M. L. Miller, and A. L. McKellips. Watermarking as communications with side information. Proceedings of the IEEE, 87(7):1127-1141, July 1999.
9. R. Cramer, I. Damgard, and P. Mackenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In PKC 2000: 3rd International Workshop on Theory and Practice in Public Key Cryptography, volume 1751 of LNCS, pages 354-372, 2000.
10. S. Craver, N. Memon, B.-L. Yeo, and M. M. Yeung. Resolving rightful ownerships with invisible watermarking techniques: Limitations, attacks, and implications. IEEE Journal on Selected Areas in Communications, 16(4):573-586, 1998.
11. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In 4th International Workshop on Practice and Theory in Public-Key Cryptography, LNCS 1992, pages 119-136, 2001.
12. M. Deng, L. Weng, and B. Preneel. Anonymous buyer-seller watermarking protocol with additive homomorphism. In Proc. of International Conference on Signal Processing and Multimedia Applications, page 11, 2008.
13. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Adv. in Cryptology - CRYPTO 84, LNCS 196, pages 10-18, 1985.
14. Z. Erkin, A. Piva, S. Katzenbeisser, R. L. Lagendijk, J. Shokrollahi, G. Neven, and M. Barni. Protection and retrieval of encrypted multimedia content: When cryptography meets signal processing. EURASIP Journal on Information Security, Article ID 78943, 20 pages, 2007.
15. R. Gennaro, D. Micciancio, and T. Rabin. An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In 5th ACM Conference on Computer and Communication Security (CCS'98), pages 67-72, San Francisco, CA, Nov. 1998.
16. S. Katzenbeisser, A. Lemma, M. U. Celik, M. van der Veen, and M. Maas. A buyer-seller watermarking protocol based on secure embedding. IEEE Trans. on Information Forensics and Security, 3(4):783-786, Dec. 2008.
17. M. Kuribayashi and H. Tanaka. Fingerprinting protocol for images based on additive homomorphic property. IEEE Trans. on Image Processing, 14(12):2129-2139, Dec. 2005.
18. C.-L. Lei, P.-L. Yu, P.-L. Tsai, and M.-H. Chan. An efficient and anonymous buyer-seller watermarking protocol. IEEE Trans. on Image Processing, 13(12):1618-1626, 2004.
19. N. D. Memon and P. W. Wong. A buyer-seller watermarking protocol. IEEE Trans. on Image Proc., 10(4):643-649, 2001.
20. P. Moulin and R. Koetter. Data-hiding codes. Proceedings of the IEEE, 93(12):2083-2126, Dec. 2005.
21. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Adv. in Cryptology - EUROCRYPT'99, LNCS 1592, pages 223-238, 1999.
22. F. Perez-Gonzalez, C. Mosquera, M. Barni, and A. Abrardo. Rational dither modulation: a high-rate data-hiding method invariant to gain attacks. IEEE Trans. on Signal Processing, 53(10):3960-3975, Oct. 2005.
23. B. Pfitzmann and A.-R. Sadeghi. Anonymous fingerprinting with direct non-repudiation. In Adv. in Cryptology - ASIACRYPT '00, LNCS 1976, pages 401-414, 2000.
24. B. Pittzmann and M. Schunter. Asymmetric fingerprinting. In Adv. in Cryptology - EUROCRYPT'96, LNCS 1070, pages 84-95, 1996.
25. G. Poupard and J. Stern. Fair encryption of RSA keys. In Adv. in Cryptology - EUROCRYPT'00, LNCS 1807, pages 172-190, 2000.
26. J. P. Prins, Z. Erkin, and R. L. Lagendijk. Anonymous fingerprinting with robust QIM watermarking techniques. EURASIP Journal on Information Security, 2007, Article ID 31340, 13 pages, 2007.