Constrained PRFs for unbounded inputs with short keys
From MaRDI portal
Recommendations
Cites work
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constrained PRFs for unbounded inputs
- Constrained pseudorandom functions and their applications
- Functional signatures and pseudorandom functions
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- Low overhead broadcast encryption from multilinear maps
- On extractability obfuscation
- Programmable hash functions in the multilinear setting
- Public-coin differing-inputs obfuscation and its applications
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Separating succinct non-interactive arguments from all falsifiable assumptions
- The hunting of the SNARK
- Universal Arguments and their Applications
Cited in
(9)- Constrained keys for invertible pseudorandom functions
- Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
- Constrained pseudorandom functions from functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Constrained PRFs for unbounded inputs
- Constrained pseudorandom functions and their applications
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
This page was built for publication: Constrained PRFs for unbounded inputs with short keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822688)
