Watermarking PRFs from lattices: stronger security via extractable PRFs

DOI10.1007/978-3-030-26954-8_11zbMath1501.94046OpenAlexW2902555428MaRDI QIDQ2304924

Yanyan Li

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_11

zbMATH Keywords

software watermarking schemeextractable PRF

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (17)

New approaches for quantum copy-protection ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Watermarking PRFs against quantum adversaries ⋮ Attribute-based proxy re-encryption from standard lattices ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Collusion resistant copy-protection for watermarkable functionalities ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Revocable attribute-based proxy re-encryption ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

This page was built for publication: Watermarking PRFs from lattices: stronger security via extractable PRFs