Private constrained PRFs (and more) from LWE

DOI10.1007/978-3-319-70500-2_10zbMath1410.94053OpenAlexW2766553718MaRDI QIDQ1690195

Rotem Tsabary, Hoeteck Wee, Zvika Brakerski, Vinod Vaikuntanathan

Publication date: 19 January 2018

Full work available at URL: https://hdl.handle.net/1721.1/137864

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Constraining and Watermarking PRFs from Milder Assumptions ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ Watermarking PRFs under standard assumptions: public marking and security with extraction queries ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Programmable distributed point functions ⋮ Multi-authority ABE from lattices without random oracles ⋮ ABE for circuits with constant-size secret keys and adaptive security ⋮ Adaptive multiparty NIKE ⋮ Optimal single-server private information retrieval ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Adaptively secure inner product encryption from LWE ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Private information retrieval with sublinear online time ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Collusion resistant watermarkable PRFs from standard assumptions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus