搜索结果: 1-6 共查到“Hamming Distance”相关记录6条 . 查询时间(0.067 秒)
Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems
Program Obfuscation Hamming Distance Conjunctions
2019/6/4
We consider the problem of obfuscating programs for fuzzy matching (in other words, testing whether the Hamming distance between an nn-bit input and a fixed nn-bit target vector is smaller than some p...
Instant Privacy-Preserving Biometric Authentication for Hamming Distance
privacy-preserving biometric authentication inner product encryption learning with errors
2018/12/24
In recent years, there has been enormous research attention in privacy-preserving biometric authentication, which enables a user to verify him or herself to a server without disclosing raw biometric i...
Security and Efficiency Analysis of The Hamming Distance Computation Protocol Based On Oblivious Transfer
Biometric Identification Authentication Hamming distance
2016/1/8
Abstract—In Financial Cryptography 2013, Bringer, Chabanne and Patey proposed two cryptographic protocols for the computation of Hamming distance in the two-party setting. Their first scheme uses Obli...
Communication Complexity of Computing the Hamming Distance
communication complexity randomized protocol Hamming distance combinatorial
2015/8/14
Let x, y {0, 1} n. Persons A and B are given x and y respectively. They communicate in order that both find the Hamming Distance d(x,y). Three communication models, viz, deterministic, e-error and e-r...
COMMUNICATION COMPLEXITY OF COMPUTING THE HAMMING DISTANCE
communication complexity randomized protocol Hamming distance combinatorial extremal problem
2015/8/12
Let x, y {0, 1} n. Persons A and B are given x and y respectively. They communicate in order that both find the Hamming Distance d(x,y). Three communication models, viz, deterministic, e-error and e-r...
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Optimal Lower Bound Communication Complexity Gap-Hamming-Distance
2010/12/15
We prove an optimal W(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal multi-pass space lower...