Abstract
In this paper we study a particular attack that may be launched by cooperating organisations in order to link the transactions and the pseudonyms of the users of an anonymous credential system. The results of our analysis are both positive and negative. The good (resp. bad) news, from a privacy protection (resp. evidence gathering) viewpoint, is that the attack may be computationally intensive. In particular, it requires solving a problem that is polynomial time equivalent to ALLSAT . The bad (resp. good) news is that a typical instance of this problem may be efficiently solvable. © 2006 Springer-Verlag.
Cite
CITATION STYLE
Pashalidis, A., & Meyer, B. (2006). Linking anonymous transactions: The consistent view attack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4258 LNCS, pp. 384–392). https://doi.org/10.1007/11957454_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
