Constrained Pseudorandom Functions for Unconstrained Inputs

Apoorvaa Deshpande
Apoorvaa Deshpande

IACR Cryptology ePrint Archive, Volume 2016, 2016, Pages 124-153.

Cited by: 20|Bibtex|Views1268|DOI:https://doi.org/10.1007/978-3-662-49896-5_5
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

A constrained pseudo random function PRF behaves like a standard PRF, but with the added feature that the master secret key holder, having secret key K, can produce a constrained key, $K\\{f\\}$, that allows for the evaluation of the PRF on all inputs satisfied by the constraint f. Most existing constrained PRF constructions can handle ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments