Simple Watermarking Pseudorandom Functions from Extractable Pseudorandom Generators
Open Access
- 8 July 2024
- journal article
- research article
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (2)
Abstract
Watermarking pseudorandom functions (PRF) allow an authority to embed an unforgeable and unremovable watermark into a PRF while preserving its functionality. In this work, we extend the work of Kim and Wu [Crypto'19] who gave a simple two-step construction of watermarking PRFs from a class of extractable PRFs satisfying several other properties – first construct a mark-embedding scheme, and then upgrade it to a message-embedding scheme. While the message-embedding scheme of Kim and Wu is based on complex homomorphic evaluation techniques, we observe that much simpler constructions can be obtained and from a wider range of assumptions, if we forego the strong requirement of security against the watermarking authority. Concretely, we introduce a new notion called extractable PRGs (xPRGs), from which extractable PRFs (without security against authorities) suitable for the Kim-Wu transformations can be simply obtained via the Goldreich-Goldwasser-Micali (GGM) construction. We provide simple constructions of xPRGs from a wide range of assumptions such as hardness of computational Diffie-Hellman (CDH) in the random oracle model, as well as LWE and RSA in the standard model.Keywords
This publication has 25 references indexed in Scilit:
- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions2021
- Collusion Resistant Watermarkable PRFs from Standard Assumptions2020
- Towards Practical GGM-Based PRF from (Module-)Learning-with-Rounding2020
- Collusion Resistant Watermarking Schemes for Cryptographic Functionalities2019
- Rate-1 Trapdoor Functions from the Diffie-Hellman Problem2019
- Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs2019
- Doubly Half-Injective PRGs for Incompressible White-Box Cryptography2019
- Watermarking PRFs Under Standard Assumptions: Public Marking and Security with Extraction Queries2018
- Identity-Based Encryption from the Weil Pairing2001
- On the Cryptographic Applications of Random Functions (Extended Abstract)2000