Secure Multi-Coupons for Federated Environments: Privacy-Preserving and Customer-Friendly

  • Frederik Armknecht
  • Alberto N. Escalante B.
  • Hans Löhr
  • Mark Manulis
  • Ahmad-Reza Sadeghi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4991)


A digital multi-coupon is similar to a paper-based booklet containing k coupons that can be purchased from one vendor and later redeemed at a vendor in exchange for services. Current schemes, offering privacy-protection and strong security properties such as unsplittability of multi-coupons, address business scenarios with a single vendor and multiple customers, and require customers to redeem coupons in some fixed order.

In this paper, we propose a multi-coupon scheme for federated environments that preserves the security and privacy properties of existing schemes, as well as their asymptotic communication and computation complexity. We define a generic formal security model and show that our scheme meets the formal requirements of this framework. Moreover, in contrast to previous solutions, we allow customers to redeem their coupons in an arbitrary order.


coupons privacy unlinkability unsplittability payment system loyalty federation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Paris Visite (October 2007),
  2. 2.
  3. 3.
    Vienna Card (October 2007),
  4. 4.
    Blundo, C., Cimato, S., De Bonis, A.: Secure e-coupons. Electronic Commerce Research 5(1), 117–139 (2005)CrossRefGoogle Scholar
  5. 5.
    S. Brands. A technical overview of digital credentials. research report (February 2002),
  6. 6.
    Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact e-cash. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 302–321. Springer, Heidelberg (2005)Google Scholar
  7. 7.
    Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 268–289. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Canard, S., Gouget, A., Hufschmitt, E.: A handy multi-coupon system. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 66–81. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78–96. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Chen, L., Enzmann, M., Sadeghi, A.-R., Schneider, M., Steiner, M.: A privacy-protecting coupon system. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 93–108. Springer, Heidelberg (2005)Google Scholar
  11. 11.
    Chen, L., Escalante, A.N.B., Löhr, H., Manulis, M., Sadeghi, A.-R.: A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection against Splitting. In: Financial Cryptography 2007. LNCS, vol. 4886, pp. 29–44. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Damgård, I., Fujisaki, E.: A statistically hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125–142. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)Google Scholar
  14. 14.
    Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 571–589. Springer, Heidelberg (2004)Google Scholar
  15. 15.
    Nguyen, L.: Privacy-protecting coupon system revisited. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 266–280. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Nguyen, L., Safavi-Naini, R.: Dynamic k-times anonymous authentication. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 318–333. Springer, Heidelberg (2005)Google Scholar
  17. 17.
    Odlyzko, A.: Privacy, economics, and price discrimination on the internet. In: ICEC 2003: Proceedings of the 5th international conference on Electronic commerce, pp. 355–366. ACM Press, New York (2003)CrossRefGoogle Scholar
  18. 18.
    Persiano, P., Visconti, I.: An efficient and usable multi-show non-transferable anonymous credential system. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 196–211. Springer, Heidelberg (2004)Google Scholar
  19. 19.
    Schnorr, C.-P.: Efficient signature generation by smart cards. Journal of Cryptology, IACR 4(3), 161–174 (1991)zbMATHMathSciNetGoogle Scholar
  20. 20.
    Syverson, P.F., Stubblebine, S.G., Goldschlag, D.M.: Unlinkable serial transactions. In: FC 1997. LNCS, vol. 1318, pp. 39–56. Springer, Heidelberg (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Frederik Armknecht
    • 1
  • Alberto N. Escalante B.
    • 1
  • Hans Löhr
    • 1
  • Mark Manulis
    • 2
  • Ahmad-Reza Sadeghi
    • 1
  1. 1.Horst Görtz Institute for IT SecurityRuhr-University of BochumGermany
  2. 2.UCL Crypto GroupUniversité Catholique de LouvainBelgium

Personalised recommendations