Abstarct: In this thesis, at the first, we present the definitions of frxameproof codes and secure frxameproof codes as the basic consepts; then, we will find some methods to construct these codes. Therefore, we present several families such as cover-free family, sandwichfree family, separataing hash family and perfect hash family. Next, it will be explained some methods to construct these codes. The main goal is finding secure frxameproof codes as large as possible. Therefore, some bounds will be presented. At the end, we define traceability schemes which are relative to the frxameproof codes.