Technical Report CS0674

TR#:CS0674
Class:CS
Title: ON THE STRUCTURE OF THE PRIVACY HIERARCHY
Authors: B. Chor, M. Ger\'{e}b-Graus, E. Kushilevitz
PDF - RevisedCS0674.revised.pdf
Abstract: We show that the {\em privacy hierarchy} for $N$-argument functions $f(x_{1},...,x_{N})$ which are defined over finite domains, has exactly $\lceil \frac{N}{2} \rceil$ levels. We prove this by constructing, for any $\lceil \frac{N}{2} \rceil \leq t \leq N -2$, an $N$-argument function which is $t$-private but not $t + 1$-private.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1991/CS/CS0674), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1991
To the main CS technical reports page

Computer science department, Technion
admin