Abstract
A coupon represents the right to claim some service which is typically offered by vendors. In practice, issuing bundled multi-coupons is more efficient than issuing single coupons separately. The diversity of interests of the parties involved in a coupon system demands additional security properties beyond the common requirements (e.g., unforgeability). Customers wish to preserve their privacy when using the multi-coupon bundle and to prevent vendors from profiling. Vendors are interested in establishing a long-term customer relationship and not to subsidise one-time customers, since coupons are cheaper than the regular price. We propose a secure multi-coupon system that allows users to redeem a predefined number of single coupons from the same multi-coupon. The system provides unlinkability and also hides the number of remaining coupons of a multi-coupon from the vendor. A method used in the coupon system might be of independent interest. It proves knowledge of a signature on a message tuple of which a single message can be revealed while the remaining elements of the tuple, the index of the revealed message, as well as the signature remain hidden.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, p. 431. Springer, Heidelberg (2000)
Brands, S.: An efficient off-line electronic cash system based on the representation problem. CWI Report, CS-R9323, Centrum voor Wiskunde en Informatica, CWI (1993)
Brands, S.: Rethinking Public Key Infrastructure and Digital Certificates – Building in Privacy. PhD thesis, Eindhoven Institute of Technology, The Netherlands (1999)
Brassard, G., Chaum, D., Crepéau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences 37 (1988)
Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proc. 11th ACM Conference on Computer and Communications Security, pp. 132–145. ACM Press, New York (2004)
Camenisch, J.: Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zürich, Switzerland (1998)
Camenisch, J., Groth, J.: Group signatures: better efficiency and new theoretical aspects. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 120–133. Springer, Heidelberg (2005)
Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 93. Springer, Heidelberg (2001)
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)
Camenisch, J., Michels, M.: Separability and efficiency for generic group signature schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 413. Springer, Heidelberg (1999)
Chaum, D.: Privacy protected payments: Unconditional payer and/or payee untraceability. In: Smart Card 2000, Proceedings, North-Holland, Amsterdam (1989)
Chen, L.: Access with pseudonyms. In: Dawson, E.P., Golić, J.D. (eds.) Cryptography: Policy and Algorithms 1995. LNCS, vol. 1029. Springer, Heidelberg (1996)
Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174–187. Springer, Heidelberg (1994)
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)
Enzmann, M., Fischlin, M., Schneider, M.: A privacy-friendly loyalty system based on discrete logarithms over elliptic curves. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 24–38. Springer, Heidelberg (2004)
Feinberg, F., Krishna, A., Zhang, Z.: Do we care what others get? A behaviorist approach to targeted promotions. Journal of Marketing Research 39(3) (August 2002)
Ferguson, N.: Extensions of single term coins. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 292–301. Springer, Heidelberg (1994)
Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16–30. Springer, Heidelberg (1997)
Hoffman, D., Novak, T., Peralta, M.: Building consumer trust online. Communications of the ACMÂ 42(4) (April 1999)
Kobsa, A.: Tailoring privacy to users’s needs. In: Bauer, M., Gmytrasiewicz, P.J., Vassileva, J. (eds.) UM 2001. LNCS (LNAI), vol. 2109, p. 303. Springer, Heidelberg (2001)
Macintosh, G., Lockshin, L.: Retail relationships and store loyalty: A multi-level perspective. International Journal of Research in Marketing 14(5) (December 1997)
Maher, D.: A platform for privately defined currencies, loyalty credits, and play money. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 43–56. Springer, Heidelberg (1998)
O’Connor, G., O’Keefe, R.: The Internet as a new marketplace: Implications for consumer behaviour and marketing management. In: Handbook on Electronic Commerce. Springer, Heidelberg (2000)
Odlyzko, A.: Privacy, Economics, and Price Discrimination on the Internet. In: 5th International Conference on Electronic Commerce (ICEC 2003). ACM Press, New York (2003)
Okamoto, T., Ohta, K.: Disposable zero-knowledge authentications and their applications to untraceable electronic cash. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 481–496. Springer, Heidelberg (1990)
Pear, R.: Electronic cards replace coupons for food stamps. New York Times, June 23 (2004)
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)
de Santis, A., di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: IEEE Symposium on Foundations of Computer Science (FOCS) (November 1994)
Shaffer, G., Zhang, Z.: Competitivec coupon marketing. Marketing Science 14(4) (1995)
Shapiro, C., Varian, H.: Information Rules. Harvard Business School Press (1999)
Verheul, E.: Self-blindable credential certificates from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 533. Springer, Heidelberg (2001)
Wibowo, A., Lam, K., Tan, G.: Loyalty program scheme for anonymous payment systems. In: Bauknecht, K., Madria, S.K., Pernul, G. (eds.) EC-Web 2000. LNCS, vol. 1875, p. 253. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Enzmann, M., Sadeghi, AR., Schneider, M., Steiner, M. (2005). A Privacy-Protecting Coupon System. In: Patrick, A.S., Yung, M. (eds) Financial Cryptography and Data Security. FC 2005. Lecture Notes in Computer Science, vol 3570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11507840_12
Download citation
DOI: https://doi.org/10.1007/11507840_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26656-3
Online ISBN: 978-3-540-31680-0
eBook Packages: Computer ScienceComputer Science (R0)