Download the thesis (939 KiB PDF file)
Corrected version — 10 January 2008
Original (handed in) version of the thesis (938 KiB PDF file)
Download the full-color cover (350 KiB PDF file)
Preface
Contents
1 Introduction
1.1 Identity Management
1.2 Federation
1.3 A privacy-friendly view on IM
1.4 Laws for successful Identity Management
1.5 The pseudonym system idemix
1.6 Using a smart card in IM systems
1.7 Implementing a smart card in idemix
1.8 Outline of this thesis
1.9 TNO exploring Federated Authentication and Identity Management
2 Preliminaries
2.1 Notation
2.2 Definitions
2.3 Assumptions
2.4 Lemmas
3 The pseudonym system idemix
3.1 Unlinkable pseudonimity
3.2 Unforgeable pseudonymous credential granting
3.3 Zero-knowledge credential verification
3.4 Basic actions
3.5 System parameters
4 Zero-knowledge proofs
4.1 Zero-knowledge proof
4.2 Ali Baba’s Cave
4.3 Zero-knowledge proofs in groups with hidden order
4.4 Zero-knowledge under concurrent composition
4.5 Zero-knowledge building blocks in idemix
4.6 Zero-knowledge interval proofs
5 Distribution of idemix on a smart card and a terminal
5.1 Distributing information and calculations
5.2 Analysis of distributions
5.3 The smart card only keeps the master key
5.4 Analysis and preferences
6 Conclusions
6.1 Conclusions
6.2 Further research
Bibliography
Appendix A Calculating square roots of large numbers
Appendix B Modular arithmetic on a smart card
Appendix C List of symbols
