We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untruste...
Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom,...
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Om...
When comparing 2D shapes, a key issue is their normalization. Translation and scale are easily taken care of by removing the mean and normalizing the energy. However, defining and...