Linking anonymous transactions: The consistent view attack

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4258 LNCS, Issue , 2006, Pages 384-392

  Pashalidis, Andreas ^a,b   Meyer, Bernd ^a  

^a SIEMENS AG   (Germany)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS CREDENTIAL SYSTEMS; ANONYMOUS TRANSACTION; POLYNOMIAL-TIME; PRIVACY PROTECTION;

POLYNOMIAL APPROXIMATION;

EID: 77049119724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11957454_22     Document Type: Conference Paper

References (16)

1. S. Brands. Rethinking Public Key Infrastructures and Digital Certificates - Building in Privacy. The MIT Press, Cambridge, Massachusetts, 2000.
2. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In B. Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceedings, volume 2045 of Lecture Notes in Computer Science, pages 93-118. Springer Verlag, Berlin, 2001.
3. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In M. Franklin, editor, Proceedings of the 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19 - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 56-72. Springer Verlag, Berlin, 2004.
4. D. Chaum. Showing credentials without identification: Transferring signatures between unconditionally unlinkable pseudonyms. In J. Seberry and J. Pieprzyk, editors, Advances in Cryptology - AUSCRYPT 90, volume 453 of Lecture Notes in Computer Science, pages 246-264. Springer Verlag, Berlin, 1990.
5. L. Chen. Access with pseudonyms. In E. Dawson and J. D. Golic, editors, Cryptography: Policy and Algorithms, International Conference, Brisbane, Queensland, Australia, July 3-5, 1995, Proceedings, number 1029 in Lecture Notes in in Computer Science, pages 232-243. Springer Verlag, Berlin, 1995.
6. I. Damgård. Payment systems and credential mechanisms with provable security against abuse by individuals. In S. Goldwasser, editor, Advances in Cryptology -CRYPTO '88: Proceedings, number 403 in Lecture Notes in Computer Science, pages 328-335. Springer Verlag, Berlin, 1990.
7. H. Jin and F. Somenzi. Prime clauses for fast enumeration of satisfying assignments to boolean circuits. In DAC '05: Proceedings of the 42nd Annual Conference on Design Automation, pages 750-753, New York, NY, USA, 2005. ACM Press.
8. D. Kesdogan, D. Agrawal, and S. Penz. Limits of anonymity in open environments. In F. Petitcolas, editor, Proceedings of the 5th International Information Hiding Workshop, IH 2002, volume 2578 of Lecture Notes in Computer Science, pages 53-69. Springer Verlag, Berlin, 2003.
9. A. Lysyanskaya, R. L. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In H. M. Heys and C. M. Adams, editors, Selected Areas in Cryptography, 6th Annual International Workshop, SAC'99, Kingston, Ontario, Canada, August 9-10, 1999, Proceedings, volume 1758 of Lecture Notes in Computer Science, pages 184-199. Springer Verlag, Berlin, 2000.
10. M. Mano. Digital Design. Prentice Hall, third edition, 2001.
11. A. Pashalidis and C. Mitchell. A security model for anonymous credential systems. In S. J. Y. Deswarte, F. Cuppens and L. Wang, editors, Information Security Management, Education and Privacy, Proceedings of the 3rd Working Conference on Privacy and Anonymity in Networked and Distributed Systems (I-NetSec'04), pages 183-199. Kluwer Academic Publishers, August 2004.
12. G. Persiano and I. Visconti. An efficient and usable multi-show non-transferable anonymous credential system. In A. Juels, editor, Proceedings of the Eighth International Financial Cryptography Conference (FC '04), volume 3110 of Lecture Notes in Computer Science, pages 196-211. Springer Verlag, Berlin, 2004.
13. M. Sipser. Introduction to the Theory of Computation. PWS Publishing Company, 1997.
14. S. Steinbrecher and S. Köpsell. Modelling unlinkability. In R. Dingledine, editor, Privacy Enhancing Technologies, Third International Workshop, PET 2003, Dresden, Germany, March 26-28, 2003, Revised Papers, volume 2760 of Lecture Notes in Computer Science, pages 32-47. Springer Verlag, Berlin, 2003.
15. E. R. Verheul. Self-blindable credential certificates from the Weil pairing. In C. Boyd, editor, ASIACRYPT '01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, volume 2248 of Lecture Notes in Computer Science, pages 533-551. Springer Verlag, Berlin, 2001.
16. L. Zhang and S. Malik. The quest for efficient boolean satisfiability solvers. In A. Voronkov, editor, Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings, volume 2392 of Lecture Notes in Computer Science, pages 295-313. Springer Verlag, Berlin, 2002.