A Privacy-Protecting Coupon System

نویسندگان

  • Liqun Chen
  • Matthias Enzmann
  • Ahmad-Reza Sadeghi
  • Markus Schneider
  • Michael Steiner
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy-Protecting Coupon System Revisited

At FC’05, Chen et al. introduced an elegant privacy protecting coupon (PPC) system, CESSS05 [13], in which users can purchase multi-coupons and redeem them unlinkably while being prevented from overspending or sharing the coupons. However, the costs for issuing and redeeming coupons are linear to the redeeming limit. Security of the system is not proved and only some arguments on system propert...

متن کامل

A Privacy-Protecting Multi-Coupon Scheme with Stronger Protection Against Splitting

A multi-coupon (MC ) represents a collection of k coupons that a user can redeem to a vendor in exchange for some goods or services. Nguyen (FC 2006), deepening the ideas of Chen et al. (FC 2005), introduced an unforgeable privacy-protecting MC system with constant complexity for issuing and redemption of MCs, that discourages sharing of coupons through a property called weak unsplittability, w...

متن کامل

A Non-Sequential Unsplittable Privacy-Protecting Multi-Coupon Scheme

A multi-coupon (MC ) represents a collection of k coupons that a user can redeem to a vendor in exchange for a benefit (some good or service). Recently, Chen et al. [CEL07] proposed an unforgeable privacy-protecting multi-coupon scheme (MCS ), which discourages sharing of coupons through a property called unsplittability, where the coupons of a singleMC cannot be separately used by two users. P...

متن کامل

P -Coupon: a Probabilistic System for Prompt and Privacy-preserving Electronic Coupon Distribution

In this paper, we propose P -coupon, a Prompt and Privacy-preserving electronic coupon distribution system based on a Probabilistic one-ownership forwarding algorithm. In this algorithm, only one hop of forwarder (coupon owner) information instead of the complete forwarder list is recorded to keep the coupon short and privacy-preserving. Such information is updated probabilistically following t...

متن کامل

Relationship between Spiritual Attitude and Protecting Patient Privacy in Nursing Students in Khoy

Background and Objectives: Protection of patient privacy consider as one of the fundamental requirements in professional morality, maintenance of individual dignity, and Patient-centered in the spiritual care system of nurses. This study aimed to explore the relationship between spiritual attitude and Protection of patient privacy in students at Khoy university of medical sciences in 2018. Met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005