28 citations · 41 across the 5 of their papers we have counts for
6 papers
Proofs of Ownership for Machine Learning Models
Ran Canetti, Shafi Goldwasser, Or Zamir
With the increasing adoption of Machine Learning, protecting model ownership has become an essential challenge. We initiate a formal study of Proof of Ownership for machine learnin…
On the computational hardness needed for quantum cryptography
Zvika Brakerski, Ran Canetti, Luowen Qian
In the classical model of computation, it is well established that one-way functions (OWF) are minimal for computational cryptography: They are essential for almost any cryptograph…
Anonymous Collocation Discovery: Harnessing Privacy to Tame the Coronavirus
Ran Canetti, Ari Trachtenberg, Mayank Varia
Successful containment of the Coronavirus pandemic rests on the ability to quickly and reliably identify those who have been in close proximity to a contagious individual. Existing…
From Soft Classifiers to Hard Decisions: How fair can we be?
Ran Canetti, Aloni Cohen, Nishanth Dikkala +3
A popular methodology for building binary decision-making classifiers in the presence of imperfect information is to first construct a non-binary "scoring" classifier that is calib…
The impossibility of obfuscation with auxiliary input or a universal simulator
Nir Bitansky, Ran Canetti, Henry Cohn +4
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility re…
The Random Oracle Methodology, Revisited
Ran Canetti, Oded Goldreich, Shai Halevi
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing…