Hiding a secret is needed in many situations. Secret sharing plays an important role in protecting information from getting lost, stolen, or destroyed and has been applicable in recent years. A secret sharing scheme is a cryptographic protocol in which a dealer divides the secret into several pieces of share and one share is given to each participant. To recover the secret, the dealer requires a subset of participants called access structure. In this paper, we present a multi-secret sharing scheme over a local ring based on linear complementary dual codes using Blakley's method. We take a large secret space over a local ring that is greater than other code-based schemes and obtain a perfect and almost ideal scheme.Multi-secret sharing scheme (MSSS) is an important family of SSSs. It is a case in which many secrets need to be shared. In other words, a multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s 1 , s 2 , . . . , s m among a