How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Unlinkable Serial Transactions
FC '97 Proceedings of the First International Conference on Financial Cryptography
Privacy, economics, and price discrimination on the Internet
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
Electronic Commerce Research
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
A privacy-protecting multi-coupon scheme with stronger protection against splitting
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
A privacy-protecting coupon system
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Dynamic k-times anonymous authentication
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Privacy-protecting coupon system revisited
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
A digital multi-coupon is similar to a paper-based booklet containing k coupons that can be purchased from one vendor and later redeemed at a vendor in exchange for services. Current schemes, offering privacy-protection and strong security properties such as unsplittability of multi-coupons, address business scenarios with a single vendor and multiple customers, and require customers to redeem coupons in some fixed order. In this paper, we propose a multi-coupon scheme for federated environments that preserves the security and privacy properties of existing schemes, as well as their asymptotic communication and computation complexity. We define a generic formal security model and show that our scheme meets the formal requirements of this framework. Moreover, in contrast to previous solutions, we allow customers to redeem their coupons in an arbitrary order.