Constrained Verifiable Random Functions

DOI10.1007/978-3-319-10879-7_7zbMath1302.94047OpenAlexW938282991MaRDI QIDQ2922655

Georg Fuchsbauer

Publication date: 14 October 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10879-7_7

zbMATH Keywords

constrained pseudorandom functionsdelegatable pseudorandom functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Verifiable Computation for Randomized Algorithm ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Multiparty non-interactive key exchange and more from isogenies on elliptic curves ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Constrained pseudorandom functions from functional encryption ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation

This page was built for publication: Constrained Verifiable Random Functions