Login
Guest
Search for:
Browse:
Resources:
Internet Research
ISSN: 1066-2243
Online from: 1991
Subject Area: Information and Knowledge Management
Content: Latest Issue | 
Latest Issue RSS | Previous Issues
Options: To add Favourites and Table of Contents Alerts please take a Emerald profile
Protecting privacy in e-cash schemes by securing hidden identity approaches against statistical attacks
| Title: | Protecting privacy in e-cash schemes by securing hidden identity approaches against statistical attacks |
|---|---|
| Author(s): | Krzysztof Piotrowski, (IHP, Frankfurt (Oder), Germany), Peter Langendörfer, (IHP, Frankfurt (Oder), Germany), Oliver Maye, (IHP, Frankfurt (Oder), Germany), Zoya Dyka, (IHP, Frankfurt (Oder), Germany) |
| Citation: | Krzysztof Piotrowski, Peter Langendörfer, Oliver Maye, Zoya Dyka, (2006) "Protecting privacy in e-cash schemes by securing hidden identity approaches against statistical attacks", Internet Research, Vol. 16 Iss: 2, pp.159 - 169 |
| Keywords: | Cryptography, Electronic commerce, Internet, Payments, Privacy |
| Article type: | Research paper |
| DOI: | 10.1108/10662240610656492 (Permanent URL) |
| Publisher: | Emerald Group Publishing Limited |
| Abstract: | Purpose – To enhance security and privacy of e-cash systems that apply revocable anonymity by presenting a statistical attack that reveals the hidden ID and suitable protection means against this kind of attack. Design/methodology/approach – The feasibility of a statistical attack that reveals the ID of user of e-cash schemes with revocable anonymity is shown. To avoid such attacks the application of modulo operations while constructing e-cash coins is proposed. Measurement results are used to back up the suitability of this approach. Findings – Revocable anonymity systems can successfully be attacked. Applying modulo operations can prevent such attacks. Practical implications – The recommendations given in this paper should be applied whenever an e-cash scheme or similar system with revocable anonymity is designed. Otherwise the promised feature may be compromised very easily. Originality/value – The paper identifies a formerly unknown attack against systems with revocable identities, and presents a mathematical solution to protect such systems against the attack presented. |
Fulltext Options:
Purchase
Downloadable; Printable; Owned
HTML, PDF (87kb)
To purchase this item please login or register.
Order
Fill in an Order form to request this document from your librarian
|
|
