Simple watermarking pseudorandom functions from extractable pseudorandom generators
From MaRDI portal
Cites work
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Collusion resistant watermarkable PRFs from standard assumptions
- Collusion resistant watermarking schemes for cryptographic functionalities
- Deterministic and Efficiently Searchable Encryption
- Doubly half-injective PRGs for incompressible white-box cryptography
- Foundations of Cryptography
- From Weak to Strong Watermarking
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- On lattices, learning with errors, random linear codes, and cryptography
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the (im)possibility of obfuscating programs
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the hardness of learning with rounding over small modulus
- Pseudorandom functions and lattices
- Rate-1 trapdoor functions from the Diffie-Hellman problem
- Towards practical GGM-based PRF from (module-)learning-with-rounding
- Traceable PRFs: full collusion resistance and active security
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Watermarking cryptographic capabilities
- Watermarking cryptographic functionalities from standard lattice assumptions
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
This page was built for publication: Simple watermarking pseudorandom functions from extractable pseudorandom generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318591)
