Number-theoretic constructions of efficient pseudo-random functions

DOI10.1109/SFCS.1997.646134MaRDI QIDQ7251075zbMATH OpenFDO

Authors Moni Naor, Omer Reingold

Publication date 21 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.1997.646134

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(5)

• Succinct garbled circuits with low-depth garbling algorithms
• When simple permutations mix poorly. Limited independence does not imply pseudorandomness
• Oblivious pseudorandom functions in non-commutative groups
• Amortizing Circuit-PSI in the multiple sender/receiver setting
• Threshold oblivious pseudorandom functions from isogeny group actions

This page was built for publication: Number-theoretic constructions of efficient pseudo-random functions

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