<p>A multi-coupon is a batch of coupons (or tokens) a customer can redeem to a merchant in order to obtain some good or service. When all the tokens are intended to be redeemed by the same customer, their sharing is a fraud. Completely preventing token sharing is not possible when the system is endowed with privacy-preserving features such as anonymity and unlinkability. So, several options to make multi-coupon splitting difficult have been proposed in the research literature. One of them is the so-called strong unsplittability approach. All the existing unsplittable multi-coupon systems proposed so far have been designed using cryptography whose security assumes the existence of a hard to factor RSA modulus. Since the integer factorization problem will cease to be hard if a powerful enough quantum computer is eventually built, all these systems are constructed over quantum-vulnerable technology. In this paper, we prove strongly unsplittable multi-coupons can be designed using quantum-resistant cryptography. The proposal employs lattice-based cryptography whose security holds on the assumed hardness of variants of the short integer solution (SIS) and learning with errors (LWE) problems. To the best of authors’ knowledge, no such system has been proposed so far.</p>