This thesis focuses on privacy preserving and fully distributed identity manage- ment systems. These systems aim to allow a user to authenticate and be authorized by a service provider while only revealing strictly necessary information. In addition, these systems must be resilient to the presence of malicious processes. In this context, we are interested in two points. Firstly, anonymous credentials and their privacy properties. We identify a shortcoming that reduces this property in state of the art, and we correct it with a new type of signature: hidden issuer anonymous credentials. Next, we look at the distributed algorithms used for the auxiliary properties of distributed identity management systems, in particular for certificate revocation and public key management. We analyze these problems formally, particularly from the point of view of their consensus number. Finally, these anal- yses allow us to propose algorithms for implementing a fully distributed identity management system that requires reduced synchronization. In other words, a system where the use of consensus algorithms is reduced to a minimum.