CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Handbook of Fingerprint Recognition
Handbook of Fingerprint Recognition
Secure smartcardbased fingerprint authentication
WBMA '03 Proceedings of the 2003 ACM SIGMM workshop on Biometrics methods and applications
Reusable cryptographic fuzzy extractors
Proceedings of the 11th ACM conference on Computer and communications security
Finding the original point set hidden among chaff
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Robust, short and sensitive authentication tags using secure sketch
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Key Agreement from Close Secrets over Unsecured Channels
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Soft generation of secure biometric keys
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Improving the accuracy and storage cost in biometric remote authentication schemes
Journal of Network and Computer Applications
Secure sketch for multiple secrets
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
A key binding system based on n-nearest minutiae structure of fingerprint
Pattern Recognition Letters
Secure sketch for biometric templates
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Biometric fuzzy extractors made practical: a proposal based on fingercodes
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
Robust extraction of secret bits from minutiae
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
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 $\left \langle x_1,..,x_d\right \rangle \in X$, each xi 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(dlogΔ+ 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.