The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 암호화 기능에 대한 워터마킹 개념을 소개하고 암호화 기능에 대한 워터마킹의 구체적인 방식을 제안합니다. 비공식적으로 말하면, 암호화 기능을 위한 디지털 워터마킹 방식은 표, 공개키 암호화의 단방향 기능, 복호화 기능 등의 기능으로 변환됩니다. 워터마킹 방식에는 두 가지 기본 요구 사항이 있습니다. 마크 내장 함수는 기능적으로 원래 함수와 동일해야 합니다. 공격자가 원래 기능을 손상시키지 않고 삽입된 표시를 제거하는 것은 어려울 것입니다. 그 중요성과 유용성에도 불구하고 기능(또는 프로그램)에 대한 워터마킹에 대한 이론적 연구는 소수에 불과합니다. 또한 암호화 기능 및 구체적인 구성에 대한 워터마킹에 대한 엄격한 정의가 없습니다. 위의 문제를 해결하기 위해 암호화 기능에 대한 워터마킹 개념을 도입하고 보안을 정의합니다. 또한, 결정 이중선형 Diffie-Hellman 문제 문제와 LTF에 대한 워터마킹 방식을 기반으로 하는 손실 트랩도어 함수(LTF)를 제시합니다. 우리의 워터마킹 방식은 표준 모델의 대칭 외부 Diffie-Hellman 가정 하에서 안전합니다. 우리는 이중 시스템 암호화 및 이중 페어링 벡터 공간(DPVS) 기술을 사용하여 워터마킹 체계를 구성합니다. 이것은 DPVS의 새로운 응용 프로그램입니다.
Ryo NISHIMAKI
the NTT Secure Platform Laboratories
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Ryo NISHIMAKI, "How to Watermark Cryptographic Functions by Bilinear Maps" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 1, pp. 99-113, January 2019, doi: 10.1587/transfun.E102.A.99.
Abstract: 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 one-way functions and decryption functions of public-key encryption. There are two basic requirements for watermarking schemes. A mark-embedded 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 Diffie-Hellman problem problem and a watermarking scheme for the LTF. Our watermarking scheme is secure under the symmetric external Diffie-Hellman 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.99/_p
부
@ARTICLE{e102-a_1_99,
author={Ryo NISHIMAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={How to Watermark Cryptographic Functions by Bilinear Maps},
year={2019},
volume={E102-A},
number={1},
pages={99-113},
abstract={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 one-way functions and decryption functions of public-key encryption. There are two basic requirements for watermarking schemes. A mark-embedded 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 Diffie-Hellman problem problem and a watermarking scheme for the LTF. Our watermarking scheme is secure under the symmetric external Diffie-Hellman 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.},
keywords={},
doi={10.1587/transfun.E102.A.99},
ISSN={1745-1337},
month={January},}
부
TY - JOUR
TI - How to Watermark Cryptographic Functions by Bilinear Maps
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 99
EP - 113
AU - Ryo NISHIMAKI
PY - 2019
DO - 10.1587/transfun.E102.A.99
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2019
AB - 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 one-way functions and decryption functions of public-key encryption. There are two basic requirements for watermarking schemes. A mark-embedded 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 Diffie-Hellman problem problem and a watermarking scheme for the LTF. Our watermarking scheme is secure under the symmetric external Diffie-Hellman 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.
ER -