A Privacy-Preserving Buyer–Seller Watermarking Protocol Based on Priced Oblivious Transfer

Buyer-seller watermarking protocols allow copyright protection of digital goods. To protect privacy, some of those protocols provide buyers with anonymity. However, anonymous e-commerce protocols pose several disadvantages, like hindering customer management or requiring anonymous payment mechanisms. Additionally, no existing buyer-seller watermarking protocol provides fair exchange. We propose a novel approach for the design of privacy-preserving buyer-seller watermarking protocols. In our approach, the seller authenticates buyers but does not learn which items are purchased. Since buyers are not anonymous, customer management is eased and currently deployed methods of payment can be utilized. We define an ideal functionality for privacy-preserving copyright protection protocols. To realize our functionality, a protocol must ensure that buyers pay the right price without disclosing the purchased item, and that sellers are able to identify buyers that released pirated copies. We construct a protocol based on priced oblivious transfer and on existing techniques for asymmetric watermark embedding. Furthermore, we implement and evaluate the efficiency of our protocol, and we explain how to extend it in order to achieve optimistic fair exchange.

[1]  Alessandro Piva,et al.  An efficient buyer-seller watermarking protocol based on composite signal representation , 2009, MM&Sec '09.

[2]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[3]  Jan Camenisch,et al.  Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.

[4]  Frederic P. Miller,et al.  Advanced Encryption Standard , 2009 .

[5]  N. Asokan,et al.  Optimistic Fair Exchange of Digital Signatures (Extended Abstract) , 1998, EUROCRYPT.

[6]  Steve Kremer,et al.  Formal analysis of optimistic fair exchange protocols , 2004 .

[7]  Bart Preneel,et al.  RIPEMD-160: A Strengthened Version of RIPEMD , 1996, FSE.

[8]  Marco Gruteser,et al.  On the Anonymity of Periodic Location Samples , 2005, SPC.

[9]  Alessandro Acquisti,et al.  The Effect of Online Privacy Information on Purchasing Behavior: An Experimental Study , 2011, WEIS.

[10]  J. Camenisch,et al.  Proof systems for general statements about discrete logarithms , 1997 .

[11]  Gábor Tardos,et al.  Optimal probabilistic fingerprint codes , 2003, STOC '03.

[12]  Alessandro Piva,et al.  A Provably Secure Anonymous Buyer–Seller Watermarking Protocol , 2010, IEEE Transactions on Information Forensics and Security.

[13]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[14]  Helger Lipmaa,et al.  An Oblivious Transfer Protocol with Log-Squared Communication , 2005, ISC.

[15]  Bart Preneel,et al.  Optimistic Fair Priced Oblivious Transfer , 2010, AFRICACRYPT.

[16]  Yuval Ishai,et al.  Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.

[17]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[18]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[19]  Dong Hoon Lee,et al.  An Anonymous Buyer-Seller Watermarking Protocol with Anonymity Control , 2002, ICISC.

[20]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[21]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[22]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[23]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data (Extended Abstract) , 1995, CRYPTO.

[24]  Jacques Stern,et al.  Fair Encryption of RSA Keys , 2000, EUROCRYPT.

[25]  Craig Gentry,et al.  Single-Database Private Information Retrieval with Constant Communication Rate , 2005, ICALP.

[26]  Mihir Bellare,et al.  On Defining Proofs of Knowledge , 1992, CRYPTO.

[27]  Nasir D. Memon,et al.  A buyer-seller watermarking protocol , 1998, 1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175).

[28]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[29]  Bart Preneel,et al.  Universally Composable Adaptive Priced Oblivious Transfer , 2009, Pairing.

[30]  Birgit Pfitzmann,et al.  Asymmetric fingerprinting , 1996 .

[31]  Ivan Damgård,et al.  A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.

[32]  Chin-Laung Lei,et al.  An efficient and anonymous buyer-seller watermarking protocol , 2004, IEEE Transactions on Image Processing.

[33]  Mauro Barni,et al.  Watermarking Systems Engineering: Enabling Digital Assets Security and Other Applications , 2007 .

[34]  Birgit Pfitzmann,et al.  Anonymous Fingerprinting , 1997, EUROCRYPT.

[35]  Hannes Federrath,et al.  Project “anonymity and unobservability in the Internet” , 2000, CFP '00.

[36]  N. Asokan,et al.  Optimistic fair exchange of digital signatures , 1998, IEEE Journal on Selected Areas in Communications.