Linking Anonymous Transactions: The Consistent View Attack. Pashalidis, A. & Meyer, B. June 2006.
Linking Anonymous Transactions: The Consistent View Attack [link]Paper  doi  abstract   bibtex   
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.
@conference {cview:pet2006,
	title = {Linking Anonymous Transactions: The Consistent View Attack},
	booktitle = {Proceedings of the Sixth Workshop on Privacy Enhancing Technologies (PET 2006)},
	year = {2006},
	month = {June},
	pages = {384{\textendash}392},
	publisher = {Springer},
	organization = {Springer},
	address = {Cambridge, UK},
	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.},
	keywords = {privacy, pseudonym},
	isbn = {978-3-540-68790-0},
	doi = {10.1007/11957454},
	url = {http://www.springerlink.com/content/y6l6412387663581/},
	author = {Andreas Pashalidis and Bernd Meyer},
	editor = {George Danezis and Philippe Golle}
}

Downloads: 0