Secret sharing is a tool that we use in numerous cryptographic protocols. In this paper, we have proposed a multi-secret sharing scheme using elliptic curves and bilinear pairings. Accordingly, we have also proposed a compartmented multi-secret sharing scheme. The schemes are verifiable and efficient. The fundamental reason for utilizing bilinear pairing with elliptic curves is to provide similar security (as in existing schemes) with smaller key sizes. The computational complexities of the proposed schemes have been determined. We have included explicit examples of the schemes using SageMath.