This paper presents a verifiable secret sharing (VSS) protocol and demonstrates that any multiparty protocol or game with incomplete information can be achieved if a majority of the players are honest. The protocol achieves unconditional secrecy, independent of computational intractability assumptions. The authors introduce a new tool called "Information Checking," which provides authentication without cryptographic assumptions and has potential applications in other areas. The main theorem states that under the assumption of a broadcast channel and private communication channels between each pair of players, a VSS protocol tolerating up to \( t < n/2 \) faulty players can be achieved in polynomial time, with exponentially small error probability. The paper also discusses the application of VSS to Byzantine Agreement and provides a detailed protocol for VSS, including a modified verification process to ensure data security. Additionally, the paper explores the use of VSS in incomplete networks and multi-party computations, showing how to perform addition, multiplication, and linear computations while maintaining fault tolerance and secrecy.This paper presents a verifiable secret sharing (VSS) protocol and demonstrates that any multiparty protocol or game with incomplete information can be achieved if a majority of the players are honest. The protocol achieves unconditional secrecy, independent of computational intractability assumptions. The authors introduce a new tool called "Information Checking," which provides authentication without cryptographic assumptions and has potential applications in other areas. The main theorem states that under the assumption of a broadcast channel and private communication channels between each pair of players, a VSS protocol tolerating up to \( t < n/2 \) faulty players can be achieved in polynomial time, with exponentially small error probability. The paper also discusses the application of VSS to Byzantine Agreement and provides a detailed protocol for VSS, including a modified verification process to ensure data security. Additionally, the paper explores the use of VSS in incomplete networks and multi-party computations, showing how to perform addition, multiplication, and linear computations while maintaining fault tolerance and secrecy.