4 citations · 4 across the 1 of their papers we have counts for
3 papers
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…
Is it Easier to Prove Theorems that are Guaranteed to be True?
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Consider the following two fundamental open problems in complexity theory: (a) Does a hard-on-average language in NP imply the existence of one-way functions?, or (b) Does a hard-o…
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation
Siddharth Garg, Zahra Ghodsi, Carmit Hazay +3
In several settings of practical interest, two parties seek to collaboratively perform inference on their private data using a public machine learning model. For instance, several…