Constrained PRFs for \(\mathrm{NC}^1\) in Traditional Groups

ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT II, pp. 543-574, 2018.

Cited by: 0|Bibtex|Views17|DOI:https://doi.org/10.1007/978-3-319-96881-0_19
Other Links: academic.microsoft.com

Abstract:

We propose new constrained pseudorandom functions (CPRFs) in traditional groups. Traditional groups mean cyclic and multiplicative groups of prime order that were widely used in the 1980s and 1990s (sometimes called "pairing free" groups). Our main constructions are as follows. - We propose a selectively single-key secure CPRF for circuit...More

Code:

Data:

Your rating :
0

 

Tags
Comments