Public-key watermarking schemes for pseudorandom functions

Cites Work

Unnamed Item
Unnamed Item
Watermarking PRFs under standard assumptions: public marking and security with extraction queries
Functional encryption for bounded collusions, revisited
Privately constraining and programming PRFs, the LWE way
Collusion resistant watermarkable PRFs from standard assumptions
New approaches for quantum copy-protection
White box traitor tracing
Optimal bounded-collusion secure functional encryption
Collusion resistant watermarking schemes for cryptographic functionalities
Watermarking PRFs from lattices: stronger security via extractable PRFs
Watermarking public-key cryptographic primitives
Secure software leasing from standard assumptions
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
Constrained Pseudorandom Functions and Their Applications
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Functional Encryption with Bounded Collusions via Multi-party Computation
Functional Encryption: Definitions and Challenges
From Weak to Strong Watermarking
How to Watermark Cryptographic Functions
Constraining and Watermarking PRFs from Milder Assumptions
How to use indistinguishability obfuscation
Watermarking cryptographic capabilities
Functional Signatures and Pseudorandom Functions
On the impossibility of approximate obfuscation and applications to resettable cryptography
Reusable garbled circuits and succinct functional encryption
Constraining Pseudorandom Functions Privately
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
On Extractability Obfuscation
Watermarking cryptographic functionalities from standard lattice assumptions
Indistinguishability obfuscation from well-founded assumptions

This page was built for publication: Public-key watermarking schemes for pseudorandom functions