Paper 2022/768
Public-Key Watermarking Schemes for Pseudorandom Functions
Abstract
A software watermarking scheme can embed a message into a program while preserving its functionality. The embedded message can be extracted later by an extraction algorithm, and no one could remove it without significantly changing the functionality of the program. A watermarking scheme is public key if neither the marking procedure nor the extraction procedure needs a watermarking secret key. Prior constructions of watermarking schemes mainly focus on watermarking pseudorandom functions (PRFs), and the major open problem in this direction is to construct a public-key watermarkable PRF. In this work, we solve the open problem via constructing public-key watermarkable PRFs with different trade-offs from various assumptions, ranging from standard lattice assumptions to the existence of indistinguishability obfuscation. To achieve the results, we first construct watermarking schemes in a weaker model, where the extraction algorithm is provided with a “hint” about the watermarked PRF key. Then we upgrade the constructions to standard watermarking schemes using a robust unobfuscatable PRF. We also provide the first construction of robust unobfuscatable PRF in this work, which is of independent interest.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in CRYPTO 2022
- Contact author(s)
-
orbbyrp @ gmail com
zuoxia yu @ gmail com
allenau @ cs hku hk
wsusilo @ uow edu au - History
- 2022-06-16: approved
- 2022-06-15: received
- See all versions
- Short URL
- https://ia.cr/2022/768
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/768,
author = {Rupeng Yang and Zuoxia Yu and Man Ho Au and Willy Susilo},
title = {Public-Key Watermarking Schemes for Pseudorandom Functions},
howpublished = {Cryptology ePrint Archive, Paper 2022/768},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/768}},
url = {https://eprint.iacr.org/2022/768}
}
