2 papers
cs.CC2019
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…
cs.CR2018
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…