Watermarking pseudorandom functions: stronger security from general assumptions

DOI10.1007/978-3-032-26734-4_5MaRDI QIDQ7363449zbMATH OpenFDO

Authors Rupeng Yang, Zuoxia Yu, Willy Susilo

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26734-4_5

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Beyond software watermarking: traitor-tracing for pseudorandom functions
• Collusion resistant watermarkable PRFs from standard assumptions
• Collusion resistant watermarking schemes for cryptographic functionalities
• Composability in watermarking schemes
• Constrained pseudorandom functions and their applications
• Constraining and watermarking PRFs from milder assumptions
• Constraining pseudorandom functions privately
• Equipping public-key cryptographic primitives with watermarking (or: a hole is to watermark)
• From Weak to Strong Watermarking
• Functional signatures and pseudorandom functions
• How to use indistinguishability obfuscation
• How to watermark cryptographic functions
• scientific article; zbMATH DE number 1617924 (Why is no real title available?)
• scientific article; zbMATH DE number 1341875 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• New approaches for quantum copy-protection
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• Privately constraining and programming PRFs, the LWE way
• Public-key watermarking schemes for pseudorandom functions
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• Secure software leasing from standard assumptions
• Simple watermarking pseudorandom functions from extractable pseudorandom generators
• Single-key to multi-key functional encryption with polynomial loss
• Traceable PRFs: full collusion resistance and active security
• Watermarkable public key encryption with efficient extraction under standard assumptions
• Watermarking cryptographic capabilities
• Watermarking cryptographic functionalities from standard lattice assumptions
• Watermarking PRFs against quantum adversaries
• Watermarking PRFs and PKE against quantum adversaries
• Watermarking PRFs from lattices: stronger security via extractable PRFs
• Watermarking PRFs under standard assumptions: public marking and security with extraction queries
• Watermarking public-key cryptographic primitives
• White box traitor tracing

This page was built for publication: Watermarking pseudorandom functions: stronger security from general assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363449)