Traceable PRFs: Full Collusion Resistance and Active Security
From MaRDI portal
Publication:5087266
DOI10.1007/978-3-030-97121-2_16zbMath1492.94147OpenAlexW4214629653MaRDI QIDQ5087266
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_16
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traitor-tracing from LWE made simple and attribute-based
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Unforgeable watermarking schemes with public extraction
- Equipping public-key cryptographic primitives with watermarking (or: a hole is to watermark)
- Collusion resistant watermarkable PRFs from standard assumptions
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings
- New approaches to traitor tracing with embedded identities
- Collusion resistant watermarking schemes for cryptographic functionalities
- Watermarking PRFs from lattices: stronger security via extractable PRFs
- Watermarking public-key cryptographic primitives
- Broadcast and trace with \(N^{\varepsilon}\) ciphertext size from standard assumptions
- Hardness of k-LWE and Applications in Traitor Tracing
- Encyclopedia of Cryptography and Security
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- From Weak to Strong Watermarking
- Nonmalleable Cryptography
- Combinatorial properties of frameproof and traceability codes
- Tracing traitors
- Traceable PRFs: Full Collusion Resistance and Active Security
- Collusion resistant traitor tracing from learning with errors
- Probability Inequalities for Sums of Bounded Random Variables
- Watermarking cryptographic capabilities
- On the (im)possibility of obfuscating programs
- Efficient Traitor Tracing from Collusion Secure Codes
- Constraining Pseudorandom Functions Privately
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
- Optimal probabilistic fingerprint codes
- Watermarking cryptographic functionalities from standard lattice assumptions
- Beyond software watermarking: traitor-tracing for pseudorandom functions
