Constrained Keys for Invertible Pseudorandom Functions

IACR Cryptology ePrint Archive, Volume 2017, 2017.

Cited by: 3|Bibtex|Views15
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

A constrained pseudorandom function (PRF) is a secure PRF for which one can generate constrained keys that can only be used to evaluate the PRF on a subset of the domain. Constrained PRFs are used widely, most notably in applications of indistinguishability obfuscation ((imathcal {O})). In this paper we show how to constrain an invertible...More

Code:

Data:

Your rating :
0

 

Tags
Comments