A computer-implemented information protection method, comprising: obtaining, at an organizer node, from a plurality of transaction participants, a plurality of homomorphically encrypted transaction amounts (T_i) associated with transactions among a plurality of accounts (A_i), wherein: each of the encrypted transaction amounts (T_i) is associated with one of the accounts (A_i) that sends or receives one of the transaction amounts (t_ i ), each of the encrypted transaction amounts (T_i) is represented by T _ i = G t _ i * H r _ i , wherein r_i is a random blinding factor, and G and H are publicly agreed generators or basepoints of the elliptic curve, and the encryption of each of the transaction amounts (t_ i ) at least conceals whether the one account (A_i) sends or receives the one of the transaction amounts (t_ i ); generating, at the organizer node, a sum proof (Pf_sum) that a cumulative product of the obtained encrypted transaction amounts (T_i) is H r , wherein r = r_1 + r_2 +...+ r_n, and the sum proof (Pf_sum) at least indicates that the transaction amounts (t_ i ) are balanced; obtaining, at the organizer node, a signature (Sig_i) from each of the plurality of accounts (A_i), wherein the signature (Sig_i) indicates an approval of at least the plurality of encrypted transaction amounts (T_i) associated with the plurality of accounts (A_i), and of the sum proof (Pf_sum); and transmitting, by the organizer node, the encrypted transaction amounts (T_i) and the sum proof (Pf_sum) to one or more nodes on a blockchain network for the one or more nodes to verify the transactions. obtaining, at an organizer node, from a plurality of transaction participants, a plurality of homomorphically encrypted transaction amounts (T_i) associated with transactions among a plurality of accounts (A_i), wherein: each of the encrypted transaction amounts (T_i) is associated with one of the accounts (A_i) that sends or receives one of the transaction amounts (t_ i ), each of the encrypted transaction amounts (T_i) is represented by T _ i = G t _ i * H r _ i , wherein r_i is a random blinding factor, and G and H are publicly agreed generators or basepoints of the elliptic curve, and the encryption of each of the transaction amounts (t_ i ) at least conceals whether the one account (A_i) sends or receives the one of the transaction amounts (t_ i ); each of the encrypted transaction amounts (T_i) is associated with one of the accounts (A_i) that sends or receives one of the transaction amounts (t_ i ), each of the encrypted transaction amounts (T_i) is represented by T _ i = G t _ i * H r _ i , wherein r_i is a random blinding factor, and G and H are publicly agreed generators or basepoints of the elliptic curve, and the encryption of each of the transaction amounts (t_ i ) at least conceals whether the one account (A_i) sends or receives the one of the transaction amounts (t_ i ); generating, at the organizer node, a sum proof (Pf_sum) that a cumulative product of the obtained encrypted transaction amounts (T_i) is H r , wherein r = r_1 + r_2 +...+ r_n, and the sum proof (Pf_sum) at least indicates that the transaction amounts (t_ i ) are balanced; obtaining, at the organizer node, a signature (Sig_i) from each of the plurality of accounts (A_i), wherein the signature (Sig_i) indicates an approval of at least the plurality of encrypted transaction amounts (T_i) associated with the plurality of accounts (A_i), and of the sum proof (Pf_sum); and transmitting, by the organizer node, the encrypted transaction amounts (T_i) and the sum proof (Pf_sum) to one or more nodes on a blockchain network for the one or more nodes to verify the transactions. <EOS>