Privately constraining and programming PRFs, the LWE way

DOI10.1007/978-3-319-76581-5_23zbMath1400.94170OpenAlexW2792973995MaRDI QIDQ1753873

Sina Shiehian, Chris Peikert

Publication date: 29 May 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_23

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Constraining and Watermarking PRFs from Milder Assumptions ⋮ Watermarking PRFs under standard assumptions: public marking and security with extraction queries ⋮ Watermarking Cryptographic Capabilities ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Programmable distributed point functions ⋮ Optimal single-server private information retrieval ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Adaptively secure inner product encryption from LWE ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Extracting randomness from extractor-dependent sources ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Collusion resistant watermarkable PRFs from standard assumptions

This page was built for publication: Privately constraining and programming PRFs, the LWE way