A Non-Sequential Unsplittable Privacy-Protecting Multi-Coupon Scheme
| dc.contributor.author | Escalante B., Alberto N. | |
| dc.contributor.author | Löhr, Hans | |
| dc.contributor.author | Sadeghi, Ahmad-Reza | |
| dc.contributor.editor | Herzog, Otthein | |
| dc.contributor.editor | Rödiger, Karl-Heinz | |
| dc.contributor.editor | Ronthaler, Marc | |
| dc.contributor.editor | Koschke, Rainer | |
| dc.date.accessioned | 2019-05-15T09:04:53Z | |
| dc.date.available | 2019-05-15T09:04:53Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | 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. [CEL+07] proposed an unforgeable privacy-protecting multi-coupon scheme (MCS), which discourages sharing of coupons through a property called unsplitta- bility, where the coupons of a single MC cannot be separately used by two users. Pre- vious MCSs relied on the all-or-nothing principle, a weaker form of unsplittability, where sharing a single coupon implies sharing the whole multi-coupon. The construc- tion proposed in [CEL+07] supports coupons with practical attributes: independent benefits, and validity periods (e.g., expiration dates). However, it has the disadvantage that the coupons contained in an MC must be redeemed in sequential order. Hence, it is suitable for fewer applications. In this paper, we address this problem and propose a scheme that satisfies the same set of security requirements, supports the same practical attributes, and offers similar efficiency, but in which users are able to choose which coupon they redeem. | en |
| dc.identifier.isbn | 978-3-88579-206-1 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/22477 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | Informatik 2007 – Informatik trifft Logistik – Band 2 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-110 | |
| dc.subject | Coupon | |
| dc.subject | privacy | |
| dc.subject | unsplittability | |
| dc.subject | unlinkability | |
| dc.subject | non-sequential | |
| dc.title | A Non-Sequential Unsplittable Privacy-Protecting Multi-Coupon Scheme | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 188 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 184 | |
| gi.conference.date | 24.-27. September 2007 | |
| gi.conference.location | Bremen | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1