Information Sharing Algorithm Based on
Conjunction and Disjunction Logic Functions
Shao Liping£¬Qin Zheng£¬Heng Xingchen
£¨Research Institute of Electronic Commerce£¬Xi'an¡¡Jiaotong¡¡University£¬Xi'an
710049£¬China£©
Abstract£ºBy introducing wellª²formed basis£¬ a novel information sharing algorithm
based on conjunction and disjunction logic functions is presented to solve the problem of
high computation complexity in the classical information sharing algorithm£® The new
algorithm that can be implemented easily and computed at highª²speed can construct
different information distribution and recovery schemes to make the algorithm possess
dynamic selfª²adaptive ability and extensibility£® Furthermore£¬ the process of
distributing and recovering£¬ which is loosely coupled with the process of encrypting and
disguising£¬ can be combined with classical algorithm of encryption and information
hiding to improve the safety of information sharing algorithm£® The experiments show that
every distributed subª²information in the same group has the same recovery ability£¬ and
different groups are in charge of recovering different parts of distributed information
with different recovery ability£® If there is only one wellª²formed basis in a group£¬
the distributed subª²information in the group must take part in information recovery£®
If different wellª²formed bases in a group take part in different subª²information
constructing process with constraints satisfied£¬ some distributed subª²information in
the group will be admitted not to take part in information recovery without affecting the
process of the whole information reconstruction£®
Keywords£ºinformation sharing£» wellª²formed basis£» information hiding£» dynamic
grouping