Book ChapterDOI
Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems
Steven D. Galbraith,Lukas Zobernig +1 more
- pp 81-110
Reads0
Chats0
TLDR
In this article, a virtual-black-box (VBB) secure and input-hiding obfuscator for fuzzy matching for Hamming distance, based on certain natural number-theoretic computational assumptions, is presented.Abstract:
We consider the problem of obfuscating programs for fuzzy matching (in other words, testing whether the Hamming distance between an n-bit input and a fixed n-bit target vector is smaller than some predetermined threshold). This problem arises in biometric matching and other contexts. We present a virtual-black-box (VBB) secure and input-hiding obfuscator for fuzzy matching for Hamming distance, based on certain natural number-theoretic computational assumptions. In contrast to schemes based on coding theory, our obfuscator is based on computational hardness rather than information-theoretic hardness, and can be implemented for a much wider range of parameters. The Hamming distance obfuscator can also be applied to obfuscation of matching under the \(\ell _1\) norm on \(\mathbb {Z}^n\).read more
Citations
More filters
Journal ArticleDOI
Book Review: A computational introduction to number theory and algebra
TL;DR: A merged version of these two papers appears on Umans’ web site: www.cs.caltech.edu/~umans/research.
Journal Article
Subset Product with Errors over Unique Factorization Domains and Ideal Class Groups of Dedekind Domains
TL;DR: It is proved that the problems in this work are generally NP-hard in all/a wide range of unique factorization domains with efficient multiplication or all/ a widerange of ideal class groups of Dedekind domains with Efﷁcient ideal multiplication.
Journal Article
Secure Sketch for Biometric Templates
TL;DR: In this paper, Li et al. examined the entropy loss due to discretization of points in continuous domains, and showed that the relative entropy loss is at most (nlog3) where n is the number of points, and the bound is tight.
Journal Article
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards.
TL;DR: In this paper, a simple and efficient method for obfuscating pattern matching with wildcards was proposed, in which the support of the pattern is sufficiently sparse and the pattern itself is chosen from an appropriate distribution.
Posted Content
VSH, an efficient and provable collision resistant hash function
TL;DR: Very Smooth Hash (VSH) as discussed by the authors is a provably collision-resistant S-bit hash function that can be used to build a fast, provably secure randomised trapdoor hash function, which can be applied to speed up Cramer-Shoup and designatedverifier signatures.
References
More filters
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Book
An Introduction to the Theory of Numbers
TL;DR: The fifth edition of the introduction to the theory of numbers has been published by as discussed by the authors, and the main changes are in the notes at the end of each chapter, where the author seeks to provide up-to-date references for the reader who wishes to pursue a particular topic further and to present a reasonably accurate account of the present state of knowledge.
Journal ArticleDOI
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TL;DR: In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.
Journal ArticleDOI
Factoring Polynomials with Rational Coefficients
TL;DR: This paper presents a polynomial-time algorithm to solve the following problem: given a non-zeroPolynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q (X).