To solve the above problem, we introduce a notion of watermarking for cryptographic functions and define its security. Furthermore, we present a lossy trapdoor function (LTF) based on the decisional linear (DLIN) problem and a watermarking scheme for the LTF. Our watermarking scheme is secure under the DLIN assumption in the standard model. We use techniques of dual system encryption and dual pairing vector spaces (DPVS) to construct our watermarking scheme. This is a new application of DPVS. Our watermarking for cryptographic functions is a generalized notion of copyrighted functions introduced by Naccache, Shamir, and Stern (PKC 1999) and our scheme is based on an identity-based encryption scheme whose private keys for identities (i.e., decryption functions) are marked, so our technique can be used to construct black-box traitor tracing schemes.
Category / Keywords: digital watermarking, dual pairing vector space, dual system encryption, vector decomposition problem Original Publication (with major differences): IACR-EUROCRYPT-2013 Date: received 17 Jun 2014, last revised 13 Sep 2015 Contact author: nishimaki ryo at lab ntt co jp Available format(s): PDF | BibTeX Citation Version: 20150913:201350 (All versions of this report) Short URL: ia.cr/2014/472 Discussion forum: Show discussion | Start new discussion