A Digital Gift Certificate Scheme with Conditional Anonymity
Pages 139 - 144
Abstract
The digital gift certificate, a special substitute for digital cash, is a practical tool in e-commerce. Digital gift certificates are released by stores, departments or other similar business entities, and users can use digital gift certificates to consume specific commodities at corresponding sites. The advantages of using digital gift certificates are transferability and simple verification. Hence, they are especially compatible in some commercial aspects during advertising or promotions. In this paper, we particularly regard the rights of privacy to users and the equity protection of stores. We not only propose a novel digital gift certificate scheme, but also resolve the two important problems, i.e., preventing dishonest buyers from duplicating digital gift certificates and preventing dishonest users from using digital gift certificates more than once. When some buyers or users illegally use their digital gift certificates, the proposed scheme allows the sources to trace the identities of the dishonest buyers or users. Therefore, the anonymity of our scheme is conditional, that is, it only protects the privacy of buyers or users when they legally use digital gift certificates.
References
[1]
Liu, Y. J., Chang C. C., and Sun, C. Y. 2015. A secure and efficient scheme for digital gift certificates. J. Inf. Hiding Multimed. Signal Process. 6, 3 (May 2015), 416--429.
[2]
Bellare, M., Garay, J. A., Hauser, R., et al. 2000. Design, implementation, and deployment of the iKP secure electronic payment system. IEEE J. Sel. Areas Commun. 18, 4 (Apr. 2000), 611--627.
[3]
Das, S., Mohanty, S., and Majhi, B. 2013. A secure electronic cash based on a certificateless group signcryption scheme. Math. Comput. Model. 58, 1 (Jul. 2013), 186--195.
[4]
Fan, C. I., Huang, V. S. M., and Yu, Y. C. 2013. User efficient recoverable off-line e-cash scheme with fast anonymity revoking. Math. Comput. Model. 58, 1 (Jul. 2013), 227--237.
[5]
Goh, A. and Yip, W. K. 2000. A divisible extension of the brands digital cash protocol: k-term coins implemented via secret sharing. In Proceedings of Intelligent Systems and Technologies for the New Millennium (Kuala Lumpur, Malaysia, September 24-27, 2000). IEEE, Washington, DC, 452--457.
[6]
Zhong, M., Feng, Y., and Yang, Y. 2000. Single-term divisible electronic cash based on bit commitment. In Proceedings of Fifth IEEE Symposium on Computers and Communications (France, July 3-6, 2000), IEEE, Washington, DC, 280--285.
[7]
Wang, H. and Zhang, Y. 2001. Untraceable off-line electronic cash flow in ecommerce. In Proceedings of 24th Australasian Conference on Computer Science (Australia, January 2001), IEEE, Washington, DC, 191--198.
[8]
Chan, C. W. and Chang, C. C. 2002. A scheme for digital gift certificates. In Proceedings of 2nd International Workshop for Asian Public Key Infrastructures (Taipei, Taiwan, October 2002), IEEE, Washington, DC, 136--141.
[9]
Mambo, M., Okamoto, E., and Usuda, K. 1996. Proxy signature for delegating signing operation. In Proceedings of Third ACM Conference on Computer and Communication Security (New Delhi, India, March 14-15, 1996), ACM New York, NY, 48--57.
Recommendations
An Efficient and Flexible Authentication Scheme with User Anonymity for Digital Right Management
ICGEC '10: Proceedings of the 2010 Fourth International Conference on Genetic and Evolutionary ComputingIn recent years, various Digital Right Management (DRM) schemes have been proposed to protect and manage access rights of digital contents. Nevertheless, most DRM schemes do not care for protecting user privacy so the user’s private information is ...
Measuring the user's anonymity when disclosing personal properties
MetriSec '10: Proceedings of the 6th International Workshop on Security Measurements and MetricsAnonymous credentials allow to selectively disclose personal properties included in the credential, while hiding the other information. For instance, a user could only disclose that he is an adult using a credential in which zip code and date of birth ...
Conditional anonymity with non-probabilistic adversary
We propose a new notion of anonymity, called set-theoretic conditional anonymity.We compare the hierarchy of strong anonymity and the hierarchy of conditional anonymity.We define a metric for set-theoretic conditional anonymity.We improve an existing ...
Comments
Information & Contributors
Information
Published In
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- Wuhan Univ.: Wuhan University, China
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 January 2017
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICMSS '17
ICMSS '17: 2017 International Conference on Management Engineering, Software Engineering and Service Sciences
January 14 - 16, 2017
Wuhan, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 47Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 28 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in