Adaptively Single-Key Secure Constrained PRFs for $\mathrm {NC}^1$
public key cryptography(2019)
摘要
We present a construction of an adaptively single-key secure constrained PRF (CPRF) for \(\mathbf {NC}^1\) assuming the existence of indistinguishability obfuscation (IO) and the subgroup hiding assumption over a (pairing-free) composite order group. This is the first construction of such a CPRF in the standard model without relying on a complexity leveraging argument.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络