Constrained PRFs for Unbounded Inputs

DOI10.1007/978-3-319-29485-8_24zbMath1334.94053OpenAlexW2401697191MaRDI QIDQ2799033

Krzysztof Pietrzak, Hamza Abusalah, Georg Fuchsbauer

Publication date: 8 April 2016

Published in: Topics in Cryptology - CT-RSA 2016 (Search for Journal in Brave)

Full work available at URL: https://repository.ist.ac.at/764/1/279.pdf

zbMATH Keywords

broadcast encryptionconstrained PRFsidentity-based non-interactive key exchange

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constrained pseudorandom functions from functional encryption ⋮ Constrained PRFs for Unbounded Inputs with Short Keys ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation

This page was built for publication: Constrained PRFs for Unbounded Inputs