• English
  • Deutsch
  • Log In
    Password Login
    or
  • Research Outputs
  • Projects
  • Researchers
  • Institutes
  • Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Konferenzschrift
  4. A privacy-protecting coupon system
 
  • Details
  • Full
Options
2005
Conference Paper
Titel

A privacy-protecting coupon system

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.
Author(s)
Chen, L.
Enzmann, M.
Sadeghi, A.R.
Schneider, M.
Steiner, M.
Hauptwerk
Financial cryptography and data security. 9th International Conference, FC 2005
Konferenz
International Conference on Financial Cryptography and Data Security (FC) 2005
Thumbnail Image
DOI
10.1007/11507840_12
Language
English
google-scholar
Fraunhofer-Institut für Sichere Informationstechnologie SIT
Tags
  • privacy

  • customer retention

  • coupon

  • digital incentive system

  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Send Feedback
© 2022