Paper 2019/620
Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems
Steven D. Galbraith and Lukas Zobernig
Abstract
We consider the problem of obfuscating programs for fuzzy matching (in other words, testing whether the Hamming distance between an
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. TCC 2019
- Keywords
- Program ObfuscationHamming DistanceConjunctionsVBBInput Hiding
- Contact author(s)
-
lukas zobernig @ auckland ac nz
s galbraith @ auckland ac nz - History
- 2019-09-20: last of 2 revisions
- 2019-06-03: received
- See all versions
- Short URL
- https://ia.cr/2019/620
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/620, author = {Steven D. Galbraith and Lukas Zobernig}, title = {Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/620}, year = {2019}, url = {https://eprint.iacr.org/2019/620} }