Skip to main content
placeholder image

Efficient E-coupon systems with strong user privacy

Journal Article


Abstract


  • We propose two novel e-coupon systems that can

    achieve the following new properties: (1) The coupon issuer

    (or service provider) can trace the identity of a dishonest

    user while the identity privacy (or anonymity) of a honest

    user is still well protected. (2) A honest user’s redemption

    privacy (i.e., the items chosen when redeeming an e-coupon)

    is well protected from the service provider. (3) If a dishonest

    user redeems an e-coupon for more than the pre-determined

    number of times, then the user will lose the redemption

    privacy (i.e., all the choices the user has made in the pre-

    vious redemptions can be revealed). We first propose a novel

    blind signature scheme that we employ together with obliv-

    ious transfer to construct our first e-coupon system, which

    achieves the first two properties without the involvement of

    any trusted third party. Then we propose a novel oblivious

    transfer scheme and use it to construct the second e-coupon

    system that can achieve all the properties given above. We

    also define the formal security models for these new security

    requirements, and show that our new e-coupon systems are

    proven secure in the proposed models

Authors


  •   Liu, Weiwei (external author)
  •   Mu, Yi (external author)
  •   Yang, Guomin
  •   Yu, Yong (external author)

Publication Date


  • 2017

Citation


  • Liu, W., Mu, Y., Yang, G. & Yu, Y. (2017). Efficient E-coupon systems with strong user privacy. Telecommunication Systems, 64 (4), 695-708.

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1646

Number Of Pages


  • 13

Start Page


  • 695

End Page


  • 708

Volume


  • 64

Issue


  • 4

Place Of Publication


  • United States

Abstract


  • We propose two novel e-coupon systems that can

    achieve the following new properties: (1) The coupon issuer

    (or service provider) can trace the identity of a dishonest

    user while the identity privacy (or anonymity) of a honest

    user is still well protected. (2) A honest user’s redemption

    privacy (i.e., the items chosen when redeeming an e-coupon)

    is well protected from the service provider. (3) If a dishonest

    user redeems an e-coupon for more than the pre-determined

    number of times, then the user will lose the redemption

    privacy (i.e., all the choices the user has made in the pre-

    vious redemptions can be revealed). We first propose a novel

    blind signature scheme that we employ together with obliv-

    ious transfer to construct our first e-coupon system, which

    achieves the first two properties without the involvement of

    any trusted third party. Then we propose a novel oblivious

    transfer scheme and use it to construct the second e-coupon

    system that can achieve all the properties given above. We

    also define the formal security models for these new security

    requirements, and show that our new e-coupon systems are

    proven secure in the proposed models

Authors


  •   Liu, Weiwei (external author)
  •   Mu, Yi (external author)
  •   Yang, Guomin
  •   Yu, Yong (external author)

Publication Date


  • 2017

Citation


  • Liu, W., Mu, Y., Yang, G. & Yu, Y. (2017). Efficient E-coupon systems with strong user privacy. Telecommunication Systems, 64 (4), 695-708.

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/1646

Number Of Pages


  • 13

Start Page


  • 695

End Page


  • 708

Volume


  • 64

Issue


  • 4

Place Of Publication


  • United States