
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

How to Watermark Cryptographic Functions by Bilinear Maps
Ryo NISHIMAKI
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E102A
No.1
pp.99113 Publication Date: 2019/01/01
Online ISSN: 17451337
DOI: 10.1587/transfun.E102.A.99
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: program watermarking, lossy trapdoor functions, dual pairing vector space,
Full Text: PDF(708KB)>>
Summary:
We introduce a notion of watermarking for cryptographic functions and propose a concrete scheme for watermarking cryptographic functions. Informally speaking, a digital watermarking scheme for cryptographic functions embeds information, called a mark, into functions such as oneway functions and decryption functions of publickey encryption. There are two basic requirements for watermarking schemes. A markembedded function must be functionally equivalent to the original function. It must be difficult for adversaries to remove the embedded mark without damaging the original functionality. In spite of its importance and usefulness, there have only been a few theoretical works on watermarking for functions (or programs). Furthermore, we do not have rigorous definitions of watermarking for cryptographic functions and concrete constructions. To solve the problem above, 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 bilinear DiffieHellman problem problem and a watermarking scheme for the LTF. Our watermarking scheme is secure under the symmetric external DiffieHellman 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.

