Results 1  10
of
53
Calibrating noise to sensitivity in private data analysis
 In Proceedings of the 3rd Theory of Cryptography Conference
, 2006
"... Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the socalled true answer is the result of applying f to the datab ..."
Abstract

Cited by 509 (49 self)
 Add to MetaCart
(Show Context)
Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query function f mapping databases to reals, the socalled true answer is the result of applying f to the database. To protect privacy, the true answer is perturbed by the addition of random noise generated according to a carefully chosen distribution, and this response, the true answer plus noise, is returned to the user. Previous work focused on the case of noisy sums, in which f =P i g(xi), where xi denotes the ith row of the database and g maps database rows to [0, 1]. We extend the study to general functions f, proving that privacy can be preserved by calibrating the standard deviation of the noise according to the sensitivity of the function f. Roughly speaking, this is the amount that any single argument to f can change its output. The new analysis shows that for several particular applications substantially less noise is needed than was previously understood to be the case. The first step is a very clean characterization of privacy in terms of indistinguishability of transcripts. Additionally, we obtain separation results showing the increased value of interactive sanitization mechanisms over noninteractive. 1 Introduction We continue a line of research initiated in [10, 11] on privacy in statistical databases. A statistic is a quantity computed from a sample. Intuitively, if the database is a representative sample of an underlying population, the goal ofa privacypreserving statistical database is to enable the user to learn properties of the population as a whole while protecting the privacy of the individualcontributors.
A combinatorial characterization of the testable graph properties: it’s all about regularity
 Proc. of STOC 2006
, 2006
"... A common thread in all the recent results concerning testing dense graphs is the use of Szemerédi’s regularity lemma. In this paper we show that in some sense this is not a coincidence. Our first result is that the property defined by having any given Szemerédipartition is testable with a constant ..."
Abstract

Cited by 75 (15 self)
 Add to MetaCart
A common thread in all the recent results concerning testing dense graphs is the use of Szemerédi’s regularity lemma. In this paper we show that in some sense this is not a coincidence. Our first result is that the property defined by having any given Szemerédipartition is testable with a constant number of queries. Our second and main result is a purely combinatorial characterization of the graph properties that are testable with a constant number of queries. This characterization (roughly) says that a graph property P can be tested with a constant number of queries if and only if testing P can be reduced to testing the property of satisfying one of finitely many Szemerédipartitions. This means that in some sense, testing for Szemerédipartitions is as hard as testing any testable graph property. We thus resolve one of the main open problems in the area of propertytesting, which was first raised in the 1996 paper of Goldreich, Goldwasser and Ron [24] that initiated the study of graph propertytesting. This characterization also gives an intuitive explanation as to what makes a graph property testable.
Algebraic Property Testing: The Role of Invariance
, 2007
"... We argue that the symmetries of a property being tested play a central role in property testing. We support this assertion in the context of algebraic functions, by examining properties of functions mapping a vector space K n over a field K to a subfield F. We consider Flinear properties that are i ..."
Abstract

Cited by 39 (15 self)
 Add to MetaCart
(Show Context)
We argue that the symmetries of a property being tested play a central role in property testing. We support this assertion in the context of algebraic functions, by examining properties of functions mapping a vector space K n over a field K to a subfield F. We consider Flinear properties that are invariant under linear transformations of the domain and prove that an O(1)local “characterization ” is a necessary and sufficient condition for O(1)local testability when K  = O(1). (A local characterization of a property is a definition of a property in terms of local constraints satisfied by functions exhibiting a property.) For the subclass of properties that are invariant under affine transformations of the domain, we prove that the existence of a single O(1)local constraint implies O(1)local testability. These results generalize and extend the class of algebraic properties, most notably linearity and lowdegreeness, that were previously known to be testable. In particular, the extensions include properties satisfied by functions of degree linear in n that turn out to be O(1)locally testable. Our results are proved by introducing a new notion that we term “formal characterizations”. Roughly this corresponds to characterizations that are given by a single local constraint and its permutations under linear transformations of the domain. Our main testing result shows that local formal characterizations
Testing LowDegree Polynomials over Prime Fields
, 2006
"... We present an efficient randomized algorithm to test if a given function f: Fnp! Fp (where p is a prime) is a lowdegree polynomial. This gives a local test for Generalized ReedMuller codes over prime fields. For a given integer t and a given real ffl> 0, the algorithm queries f at O i 1ffl + ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
We present an efficient randomized algorithm to test if a given function f: Fnp! Fp (where p is a prime) is a lowdegree polynomial. This gives a local test for Generalized ReedMuller codes over prime fields. For a given integer t and a given real ffl> 0, the algorithm queries f at O i 1ffl + t * p 2tp1 +1j points to determine whether f can be described by a polynomial of degree at most t. If f is indeed a polynomial of degree at most t, our algorithm always accepts, and if f has a relative distance at least ffl from every degree t polynomial, then our algorithm rejects fwith probability at least 1 2. Our result is almost optimal since any such algorithm must query f on at least \Omega ( 1ffl + p
Functions That Have ReadTwice Constant Width Branching Programs Are Not Necessarily Testable
, 2003
"... ..."
Robust Locally Testable Codes and Products of Codes
 In Proc. RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science
, 2004
"... We continue the investigation of locally testable codes, i.e., errorcorrecting codes for whom membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
(Show Context)
We continue the investigation of locally testable codes, i.e., errorcorrecting codes for whom membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner, and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally, by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing lowdegree multivariate polynomials (which are a special case of tensor codes).
2transitivity is insufficient for local testability
 IN CCC 2008: PROCEEDINGS OF THE 23RD IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY
, 2008
"... A basic goal in Property Testing is to identify a minimal set of features that make a property testable. For the case when the property to be tested is membership in a binary linear errorcorrecting code, Alon et al. [2] had conjectured that the presence of a single low weight code in the dual, and ..."
Abstract

Cited by 15 (12 self)
 Add to MetaCart
A basic goal in Property Testing is to identify a minimal set of features that make a property testable. For the case when the property to be tested is membership in a binary linear errorcorrecting code, Alon et al. [2] had conjectured that the presence of a single low weight code in the dual, and “2transitivity ” of the code (i.e., the code is invariant under a 2transitive group of permutations on the coordinates of the code) suffice to get local testability. We refute this conjecture by giving a family of error correcting codes where the coordinates of the codewords form a large field of characteristic two, and the code is invariant under affine transformations of the domain. This class of properties was introduced by Kaufman and Sudan [13] as a setting where many results in algebraic property testing generalize. Our result shows a complementary virtue: this family also can be useful in producing counterexamples to natural conjectures.
Combinatorial Construction of Locally Testable Codes
, 2009
"... An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constant number of symbols of the string. While the best known construction of LTCs by BenSasson and Sudan (STOC 2005) and Dinu ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constant number of symbols of the string. While the best known construction of LTCs by BenSasson and Sudan (STOC 2005) and Dinur (J. ACM 54(3)) achieves very e cient parameters, it relies heavily on algebraic tools and on PCP machinery. In this work we present a new and arguably simpler construction of LTCs that is purely combinatorial, does not rely on PCP machinery and matches the parameters of the best known construction. However, unlike the latter construction, our construction is not entirely explicit.
Tolerant versus intolerant testing for boolean properties
 In Proceedings of the 20th IEEE Conference on Computational Complexity
, 2005
"... Abstract: A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by Parnas, Ron and Rubinfeld, must also accept inputs that are close enough to satisfying the property. We construct ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
Abstract: A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by Parnas, Ron and Rubinfeld, must also accept inputs that are close enough to satisfying the property. We construct two properties of binary functions for which there exists a test making a constant number of queries, but yet there exists no such tolerant test. The first construction uses Hadamard codes and long codes. Then, using Probabilistically Checkable Proofs of Proximity as constructed by BenSasson et al., we exhibit a property which has constant query intolerant testers but for which any tolerant tester requires n Ω(1) queries. ACM Classification: G.3, F.2.2 AMS Classification: 68Q99, 68W20
Limits on the rate of locally testable affineinvariant codes
, 2009
"... Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, “algebraic property testing ” is not wellunderstood. A significant obstacle to a better understanding, was a lack of a concrete definition that abst ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, “algebraic property testing ” is not wellunderstood. A significant obstacle to a better understanding, was a lack of a concrete definition that abstracted known testable algebraic properties and reflected their testability. This obstacle was removed by [Kaufman and Sudan, STOC 2008] who considered (linear) “affineinvariant properties”, i.e., properties that are closed under summation, and under affine transformations of the domain. Kaufman and Sudan showed that these two features (linearity of the property and its affineinvariance) play a central role in the testability of many known algebraic properties. However their work does not give a complete characterization of the testability of affineinvariant properties, and several technical obstacles need to be overcome to obtain such a characterization. Indeed, their work left open the tantalizing possibility that locally testable codes of rate dramatically better than that of the family of ReedMuller codes (the most popular form of locally testable codes, which also happen to be affineinvariant) could be found by systematically exploring the space of affineinvariant properties.