Adaptively single-key secure constrained PRFs for NC^1

DOI10.1007/978-3-030-17259-6_8MaRDI QIDQ2289431zbMATH OpenOpenAlexFDO

Authors Nuttapong Attrapadung, Takahiro Matsuda, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17259-6_8

zbMATH Keywords

indistinguishability obfuscationpartitionable CPRF

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Adaptively secure constrained pseudorandom functions in the standard model
• Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
• Adaptively secure constrained pseudorandom functions
• Adaptive Security of Constrained PRFs
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE

Cited in

(8)

• Constrained PRFs for \(\mathrm{NC}^1\) in traditional groups
• Adaptively secure constrained pseudorandom functions in the standard model
• Reducing depth in constrained PRFs: from bit-fixing to \(\mathbf {NC}^{1}\)
• Adaptively secure puncturable pseudorandom functions in the standard model
• Adaptive Security of Constrained PRFs
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
• Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
• Constrained pseudorandom functions for inner-product predicates from weaker assumptions

This page was built for publication: Adaptively single-key secure constrained PRFs for \(\text{NC}^1\)

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