Privately constraining and programming PRFs, the LWE way
From MaRDI portal
Recommendations
- Private constrained PRFs (and more) from LWE
- Constraining pseudorandom functions privately
- Constraining and watermarking PRFs from milder assumptions
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
Cited in
(31)- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Private constrained PRFs (and more) from LWE
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- 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
- Adaptively secure inner product encryption from LWE
- Watermarking cryptographic capabilities
- Constraining and watermarking PRFs from milder assumptions
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Private puncturable PRFs from standard lattice assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Watermarking cryptographic functionalities from standard lattice assumptions
- 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
- Watermarking PRFs and PKE against quantum adversaries
- Pseudorandom functions with weak programming privacy and applications to private information retrieval
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- On the black-box complexity of correlation intractability
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- QuietOT: lightweight oblivious transfer with a public-key setup
- Privately constrained PRFs from DCR: puncturing and bounded Waring rank
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
- Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH
- Incompressible encryption beyond CPA/CCA security
This page was built for publication: Privately constraining and programming PRFs, the LWE way
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753873)
