METHOD OF XOR HOMOMORPHIC ENCRYPTION AND SECURE CALCULATION OF A HAMMING DISTANCE

摘要

The invention concerns a method for encrypting a binary data item characterised in that it comprises the steps consisting of: —generating a public key and a private key, the public key being a sparse matrix comprising m rows and n columns, m being greater than the number I of bits of the binary data item, I being an integer strictly greater than 1, and the private key being a set of I indexed sets of integers between 1 and m such that for each set, the sum of the elements of the rows of the sparse matrix indexed by the elements of a set is zero, and—generating a binary sequence b comprising m bits, such that b=Mx+e+y in which o x is a random binary vector, o e is a random binary noise vector, and o y is a linear encoding of data item c. The invention also concerns a method for calculating a Hamming distance on data encrypted by the method of encryption.

主权项

1. An encryption method of a binary datum (c) characterized in that it comprises the steps of:
generating a public key (pk) and a private key (sk), the public key being a sparse matrix (M) comprising m lines and n columns, m being greater than the number 1 of bits of the binary datum, 1 being an integer strictly greater than 1, and the private key being a set of 1 indexed sets (Sj) of integers between 1 and m such that for each set, the sum of the elements of the lines of the sparse matrix indexed by the elements of a set is zero, and generating a binary sequence b comprising m bits, such that b=Mx+e+y where
x is a random binary vector,e is a vector of random binary noise, andy is linear encoding of the datum c.