Method for encrypting a plurality of data in a secure set

Method for encrypting a set of at least two indexed data items (Aj), implemented by a server, the data (Aj) being in the form of lists of elements (αij), each element of which belongs to a finite set () of indexed symbols (xi) called an alphabet, the method being characterised in that the data (Aj) are encrypted to form a protected set (LOCK (A1, . . . , AN)), the step of encrypting and creating the protected set comprising the following steps:

• the server randomly generates, for each data item (Aj) in the base, a corresponding encoding function (Fj), and
• for each symbol (xj) of the alphabet (),
• for each data item (Aj),
• if at least one element (aij) of the list that constitutes the data item is the symbol (xi) of the alphabet, the server determines the image of said symbol (xi) of the alphabet via the encoding function (Fj) corresponding to the data item (Aj) in order to obtain a codeword coordinate Fj(xi) that is a function of the data item and of the symbol of the alphabet,
• the server adds the codeword coordinate Fj(xi) thereby obtained to an indexed set (Si) corresponding to the element of the alphabet (xi), the set having a predetermined cardinal (l),
• then the server randomly re-indexes the elements of the indexed set (Si) corresponding to the symbol (xi) of the alphabet (), and
• the server adds the indexed set (Si) corresponding to the symbol (xi) of the alphabet to the protected set (LOCK (A1, . . . , AN)),
• and in that, for each symbol (xi) in the alphabet (), prior to the re-indexing step, the server completes the indexed set (Si) corresponding to the alphabet element (xi) with error-inducing points.