Adaptively secure constrained pseudorandom functions
From MaRDI portal
Publication:2656914
Recommendations
Cited in
(25)- Constrained keys for invertible pseudorandom functions
- Non-naturally reductive Einstein metrics on \(\mathrm {SO}(n)\)
- Adaptively secure constrained pseudorandom functions in the standard model
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- Constrained pseudorandom functions from functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- From non-adaptive to adaptive pseudorandom functions
- Reducing depth in constrained PRFs: from bit-fixing to \(\mathbf {NC}^{1}\)
- Constrained PRFs for unbounded inputs
- Adaptively secure puncturable pseudorandom functions in the standard model
- Constrained PRFs for unbounded inputs with short keys
- Constrained pseudorandom functions and their applications
- Adaptive Security of Constrained PRFs
- Key-homomorphic constrained pseudorandom functions
- Functional signatures and pseudorandom functions
- Constraining pseudorandom functions privately
- Constrained Pseudorandom Functions for Unconstrained Inputs
- One-One Constrained Pseudorandom Functions.
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Constrained pseudorandom functions from homomorphic secret sharing
- Adaptive multiparty NIKE
- Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Privately constrained PRFs from DCR: puncturing and bounded Waring rank
This page was built for publication: Adaptively secure constrained pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656914)
