Secure three-party computation is a special instance of the general secure multi-party computation, which is always hard to deal with. In this note, we show that the two secure three-party computation protocols [Int. J. Inf. Sec., 15 (2016), 1-13] are awed. The schemes are just based on common public-key encryption and a general linear transformation. No sophisticated technique, such as zero-knowledge proof, oblivious transfer, cut-and- exchange, garbled circuit, and homomorphic encryption, is integrated into it. We find any two parties can conspire to retrieve the other party's input by solving normal quadratic equations or normal linear equations.