User must provide passphrase on registrabon given

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: k <= | X( C ) | <= N – k For some k… Obvious limitaBons And does not enBrely solve the problem… Tracker AMack LimitaBons on query sizes can someBmes be circumvented. Problem : for a characterisBc funcBon C, is count( C ) = 1? Consider if C is intersecBon of two sufficiently large (and small!) sets C1 and C2 Count( C ) = count(C1) – count( C1 ^ ~C2) Possible controls •  Concealing –  Introduce slight random perturbaBons to the results –  Trading precision for security •  Make query over random sample •  Suppress mulBple results –  Not just results that are too small, but some addiBonal results –  Thwart track...
View Full Document

This note was uploaded on 02/03/2014 for the course ECE 422 taught by Professor Nicol during the Fall '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online