Verifiable Threshold Secret Sharing and Full Fair Secure Two-Party Computation

Based on the verifiable encryption and zero-knowledge proof protocols of Jarecki and Shmatikov and Pedersenpsilas verifiable threshold secret sharing scheme, this paper proposes a new full fair secure two-party computation protocols. For getting full fair, the new protocol employs a group of third-party servers. We prove that when more than two-thirds of the third-party servers are honest, the new protocol guarantees that two parties can get their correct outputs full fairly. In the new protocol, the computation is performed in the form of garbled circuit, and only two added interaction rounds are needed for full fairness.