With the （ k, n ）-threshold scheme of secret sharing in the field of information security technology as an application background, the concept of set （ k, n ）-exact cover is presented in this paper. It is a modifi...With the （ k, n ）-threshold scheme of secret sharing in the field of information security technology as an application background, the concept of set （ k, n ）-exact cover is presented in this paper. It is a modification of the original concept of set covering problem. It is also different from the concept of exact cover defined by J.E. Hopcmft. Some properties of （k, n ） -exact cover are investigated; a sufficient condition for a set to be （ k, n ） -exactly coverable is given. It follows that a feasible assignment scheme of a set for the （ k, n） -exact eover is obtained if this set satisfies the sufficient condition.展开更多
Secure group communications are restrained by the number of the group size, number of changes and their distribution, all existing works do not meet the commands of applications with large group size and high dynamic ...Secure group communications are restrained by the number of the group size, number of changes and their distribution, all existing works do not meet the commands of applications with large group size and high dynamic members. In this paper, minimum exact cover problem for group key distribution （GMECP） is presented, and a heuristic solution is testified. Then an algorithm of batch rekeying with renewing cost tending to zero is illustrated, which can process any large number of change requests with best security guaranteed. Efficiency analysis and simulation test show that the achievement can improve the efficiency of any tree-based group key management.展开更多
A perturbation method is applied to study the structure of the ground state of the adiabatic quantum optimization for the exact cover 3 problem. It is found that the instantaneous ground state near the end of the evol...A perturbation method is applied to study the structure of the ground state of the adiabatic quantum optimization for the exact cover 3 problem. It is found that the instantaneous ground state near the end of the evolution is mainly composed of the eigenstates of the problem Hamiltonian, which are Hamming close to the solution state. And the instantaneous ground state immediately after the starting is mainly formed of low energy eigenstates of the problem Hamiltonian. These results are then applied to estimate the minimum gap for a special case.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60673053 90718011 )
文摘With the （ k, n ）-threshold scheme of secret sharing in the field of information security technology as an application background, the concept of set （ k, n ）-exact cover is presented in this paper. It is a modification of the original concept of set covering problem. It is also different from the concept of exact cover defined by J.E. Hopcmft. Some properties of （k, n ） -exact cover are investigated; a sufficient condition for a set to be （ k, n ） -exactly coverable is given. It follows that a feasible assignment scheme of a set for the （ k, n） -exact eover is obtained if this set satisfies the sufficient condition.
基金Supported by the National Natural Science Foundation of China (60572049)
文摘Secure group communications are restrained by the number of the group size, number of changes and their distribution, all existing works do not meet the commands of applications with large group size and high dynamic members. In this paper, minimum exact cover problem for group key distribution （GMECP） is presented, and a heuristic solution is testified. Then an algorithm of batch rekeying with renewing cost tending to zero is illustrated, which can process any large number of change requests with best security guaranteed. Efficiency analysis and simulation test show that the achievement can improve the efficiency of any tree-based group key management.
基金Project supported by the National Natural Science Foundation of China(Grant No.61173050)
文摘A perturbation method is applied to study the structure of the ground state of the adiabatic quantum optimization for the exact cover 3 problem. It is found that the instantaneous ground state near the end of the evolution is mainly composed of the eigenstates of the problem Hamiltonian, which are Hamming close to the solution state. And the instantaneous ground state immediately after the starting is mainly formed of low energy eigenstates of the problem Hamiltonian. These results are then applied to estimate the minimum gap for a special case.
