This paper investigates Russian Cards problem for the purpose of unconditional secured communication. First, a picking rule and deleting rule as well as safe communication condition are given to deal with the problem with 3 players and 7 cards. Further, the problem is generalized to tackle
− 1) + 1 cards. A new picking rule for constructing the announcement is presented, and a new deleting rule for players to determine each other’s cards is formalized. In addition, the safe communication condition is also proved.