11 citations · 13 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2026
Lower Bounds on Black-Box Constructions of Pseudorandom Functions
Bar Alon, Itai Dinur, Muthuramakrishnan Venkitasubramaniam
In their seminal work, Goldreich, Goldwasser, and Micali [CRYPTO 1984] constructed a pseudorandom function (PRF) using a black-box access to a pseudorandom generator (PRG). When co…
cs.CR2022★ 1 cited
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably
Bar Alon, Moni Naor, Eran Omri +1
In this work, we introduce the Gulliver multi-party computation model (GMPC). The GMPC model considers a single highly powerful party, called the server or Gulliver, that is connec…