2010
DOI: 10.1007/978-3-642-15898-8_13
|View full text |Cite
|
Sign up to set email alerts
|

A Formal Model of Identity Mixer

Abstract: Abstract. Identity Mixer is an anonymous credential system developed at IBM that allows users for instance to prove that they are over 18 years old without revealing their name or birthdate. This privacy-friendly technology is realized using zero-knowledge proofs. We describe a formal model of Identity Mixer that is well-suited for automated protocol verification tools in the spirit of black-box cryptography models.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
40
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(40 citation statements)
references
References 26 publications
0
40
0
Order By: Relevance
“…When a user makes an anonymous authentication request, she proves to a verifier that she has obtained a valid credential (CL signature [26]) from the central authority. Lastly, Camenisch et al proposed an identity mixer scheme [27], [28] in which users need to obtain a credential for their attributes. To access a service, a user proves to the service verifier that she has the required attributes.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…When a user makes an anonymous authentication request, she proves to a verifier that she has obtained a valid credential (CL signature [26]) from the central authority. Lastly, Camenisch et al proposed an identity mixer scheme [27], [28] in which users need to obtain a credential for their attributes. To access a service, a user proves to the service verifier that she has the required attributes.…”
Section: A Related Workmentioning
confidence: 99%
“…In all these schemes [24], [25], [27]- [29], authentication is not bound to a particular verifier, whereas in our scheme an authentication tag can only be verified by a designated verifier. Furthermore, k-TAA schemes allow verifiers to de-anonymise a user's identity when she has authenticated more than k times, while in our scheme a service verifier can detect whether a user has used the tag (double spending) but cannot de-anonymise a user's identity.…”
Section: A Related Workmentioning
confidence: 99%
“…They offered an optional approach to trace the identity of the pseudonymous token for some transactions. After that, some practical systems like IBM's Identity Mixer [8], ABC4Trust [30] started to consider the anonymity revocation. An interesting revocation approach is traceable anonymous certificate [22].…”
Section: Related Workmentioning
confidence: 99%
“…This is due to the fact that (as the security of security protocols is not guaranteed only by encryption schemes) the security of web applications is not guaranteed only by store procedures or perfect random generation of token. Another example has been presented in [11], where authors search for attacks in zero-knowledge proof systems abstracting away some of the mathematical and implementation details of the zero-knowledge algorithms.…”
Section: Modeling Systems and Communicationsmentioning
confidence: 99%