28 citations · 34 across the 6 of their papers we have counts for
6 papers
Differentially Private Selection from Secure Distributed Computing
Ivan Damgård, Hannah Keller, Boel Nelson +2
Given a collection of vectors , the selection problem asks to report the index of an "approximately largest" entry in .…
Sharing Information with Competitors
Simina Brânzei, Claudio Orlandi, Guang Yang
We study the mechanism design problem in the setting where agents are rewarded using information only. This problem is motivated by the increasing interest in secure multiparty com…
Access Control Encryption: Enforcing Information Flow with Cryptography
Ivan Damgård, Helene Haagh, Claudio Orlandi
We initiate the study of Access Control Encryption (ACE), a novel cryptographic primitive that allows fine-grained access control, by giving different rights to different users not…
How to Bootstrap Anonymous Communication
Sune K. Jakobsen, Claudio Orlandi
We ask whether it is possible to anonymously communicate a large amount of data using only public (non-anonymous) communication together with a small anonymous channel. We think th…
A New Approach to Practical Active-Secure Two-Party Computation
Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi +1
We propose a new approach to practical two-party computation secure against an active adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT-ba…
Privacy-Aware Mechanism Design
Kobbi Nissim, Claudio Orlandi, Rann Smorodinsky
In traditional mechanism design, agents only care about the utility they derive from the outcome of the mechanism. We look at a richer model where agents also assign non-negative d…