tailieunhanh - The smallest base of k-sets

In information theory, especially in storage model, private sharing, encryption, etc. sometimes we want to distribute a given database into many small parts, each of which is stored by a party in such a way that when there are a cooperation of sufficient number of parties, then it is enable to recover the original information. |

TỪ KHÓA LIÊN QUAN