Adaptive Security of Constrained PRFs
From MaRDI portal
Recommendations
- Adaptively secure constrained pseudorandom functions
- On the adaptive security of MACs and PRFs
- Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)
- On adaptively secure protocols
- Adaptively secure distributed PRFs from LWE
- Adaptively secure constrained pseudorandom functions in the standard model
- scientific article; zbMATH DE number 1583802
- scientific article; zbMATH DE number 1418290
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- scientific article; zbMATH DE number 1504548
Cited in
(31)- Non-naturally reductive Einstein metrics on \(\mathrm {SO}(n)\)
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Compact NIZKs from standard assumptions on bilinear maps
- Security analysis and improvements for the IETF MLS standard for group messaging
- Adaptively secure constrained pseudorandom functions in the standard model
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Simpler constructions of asymmetric primitives from obfuscation
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- 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
- Adaptively secure constrained pseudorandom functions
- The cost of adaptivity in security games on graphs
- Reducing depth in constrained PRFs: from bit-fixing to \(\mathbf {NC}^{1}\)
- Adaptively secure puncturable pseudorandom functions in the standard model
- Adaptive security of Yao's garbled circuits
- Towards non-black-box separations of public key encryption and one way function
- A quasipolynomial reduction for generalized selective decryption on trees
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Constraining pseudorandom functions privately
- Private puncturable PRFs from standard lattice assumptions
- Bounded Collusion ABE for TMs from IBE
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Adaptive multiparty NIKE
- Puncturable key wrapping and its applications
- The power of undirected rewindings for adaptive security
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Compact NIZKs from standard assumptions on bilinear maps
- Adaptive security for constrained PRFs
- A note on adaptive security in hierarchical identity-based encryption
- On non-interactive blind signatures in the plain model using complexity leveraging
This page was built for publication: Adaptive Security of Constrained PRFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936602)
