Please use this identifier to cite or link to this item:
|Title:||Hiding secret points amidst chaff|
|Authors:||Chang, E.-C. |
|Source:||Chang, E.-C.,Li, Q. (2006). Hiding secret points amidst chaff. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4004 LNCS : 59-72. ScholarBank@NUS Repository.|
|Abstract:||Motivated by the representation of biometric and multimedia objects, we consider the problem of hiding noisy point-sets using a secure sketch, A point-set X consists of s points from a d-dimensional discrete domain [0, N - 1] d. Under permissible noises, for every point 〈x 1,..,x d) ∈ X, each X i may be perturbed by a value of at most δ, In addition, at most t points in X may be replaced by other points in [0, N - 1] d. Given an original X, we want to compute a secure sketch P. A known method constructs the sketch by adding a set of random points R, and the description of (X ∪ R) serves as part of the sketch. However, the dependencies among the random points are difficult to analyze, and there is no known non-trivial bound on the entropy loss. In this paper, we first give a general method to generate R and show that the entropy loss of (X ∪ R) is at most s(d log Δ + d + 0.443), where Δ = 2δ + 1. We next give improved schemes for d = 1, and special cases for d = 2. Such improvements are achieved by pre-rounding, and careful partition of the domains into cells. It is possible to make our sketch short, and avoid using randomness during construction. We also give a method in d = 1 to demonstrate that, using the size of R as the security measure would be misleading. © International Association for Cryptologic Research 2006.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.