Constrained verifiable random functions
From MaRDI portal
Recommendations
- Constrained verifiable random functions from indistinguishability obfuscation
- The price of verifiability: lower bounds for verifiable random functions
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- A generic approach to constructing and proving verifiable random functions
- Public Key Cryptography - PKC 2005
Cited in
(18)- KDM security for identity-based encryption: constructions and separations
- Constrained Pseudorandom Functions for Unconstrained Inputs
- A generic approach to constructing and proving verifiable random functions
- Private puncturable PRFs from standard lattice assumptions
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Verifiable computation for randomized algorithm
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- Constrained verifiable random functions without obfuscation and friends
- Verifiable random functions from standard assumptions
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Unbiasable verifiable random functions
- Constrained pseudorandom functions from functional encryption
- MUSEN: aggregatable key-evolving verifiable random functions and applications
- Constrained verifiable random functions from indistinguishability obfuscation
This page was built for publication: Constrained verifiable random functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922655)
