Constrained PRFs for unbounded inputs

DOI10.1007/978-3-319-29485-8_24MaRDI QIDQ2799033zbMATH OpenOpenAlexFDO

Authors Hamza Abusalah, Georg Fuchsbauer, Krzysztof Pietrzak

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)

Recommendations

• Constrained PRFs for unbounded inputs with short keys
• Constrained pseudorandom functions and their applications
• Constrained Pseudorandom Functions for Unconstrained Inputs
• Adaptively secure constrained pseudorandom functions
• Constraining pseudorandom functions privately

Cited in

(9)

• Private puncturable PRFs from standard lattice assumptions
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• Constrained (Verifiable) Pseudorandom Function from Functional Encryption
• Constrained verifiable random functions without obfuscation and friends
• Constrained pseudorandom functions and their applications
• Constrained PRFs for unbounded inputs with short keys
• Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
• Constrained pseudorandom functions from functional encryption

This page was built for publication: Constrained PRFs for unbounded inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799033)