AAECC
2007
Springer
13 years 10 months ago
2007
Springer
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On ) the set of vectors with even (respectively, odd)...
ICIP
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
ACNS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
CHES
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we show a very efficient side channel attack against HMAC. Our attack assumes the presence of a side channel that reveals the Hamming distance of some registers. Aft...