Generative Text Secret Sharing with Topic-Controlled Shadows

Algorithm 1

The sharing phase.

	Input:
	Secret bitstream ; threshold; the number of secret units to be shared at one time ; perfect binary tree’s height (then CPS =   =  ); the topics of each shadow text ; bag of words related to ; initial words for each shadow text .
	Output:
	shadow texts .
(1)	Slice per bits, transform each unit into integer form to get the secret values ;
(2)	Construct the sharing matrix , which satisfies any submatrix’s determinant is odd;
(3)	for each do
(4)	Input into LM to get of ;
(5)	;
(6)	;
(7)	whiledo
(8)	if notthen
(9)	Create a vector with the first values being secret values, and the remaining values coming from ;
(10)	;
(11)	for each in do
(12)	Based on , can be obtained through (6);
(13)	;
(14)	Input the last word of and into LM, then ;
(15)	;
(16)	Arrange the in descending order, encode the words using the perfect binary tree, and determine the word for output by the shared value ;
(17)	else
(18)	Add to ;
(19)	;
(20)	return