Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Protecting privacy in e‐cash schemes by securing hidden identity approaches against statistical attacks

Protecting privacy in e‐cash schemes by securing hidden identity approaches against statistical... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Internet Research Emerald Publishing

Protecting privacy in e‐cash schemes by securing hidden identity approaches against statistical attacks

Loading next page...
 
/lp/emerald-publishing/protecting-privacy-in-e-cash-schemes-by-securing-hidden-identity-yRv6OztrS7

References (6)

Publisher
Emerald Publishing
Copyright
Copyright © 2006 Emerald Group Publishing Limited. All rights reserved.
ISSN
1066-2243
DOI
10.1108/10662240610656492
Publisher site
See Article on Publisher Site

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.

Journal

Internet ResearchEmerald Publishing

Published: Mar 1, 2006

Keywords: Privacy; Electronic commerce; Internet; Cryptography; Payments

There are no references for this article.