| J. Camenisch and A. Lysyanskaya, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, LNCS 2045. |
....Chaum s system, credentials can be shown to arbitrary servers, and issuers need not have any relationship with a central authority. However, Brands does not address the problem of users pooling credentials together to obtain services no one of them could obtain alone. Camenisch and Lysyanskaya [3] proposed a system al lowing a credential to be shown multiple times without allowing showing instances to be linked. Their system focuses on limiting the information revealed to servers during the showing protocol rather than restricting what information the issuer gets during the signing ....
Jan Camenisch and Anna Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. Lecture Notes in Computer Science, 2045:93-118, 2001. http://citeseer.nj.nec.com/camenisch01efficient.html.
No context found.
J. Camenisch and A. Lysyanskaya, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation, LNCS 2045.
No context found.
J. Camenisch, A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. EUROCRYPT '01, LNCS 2045. Springer, 2001.
No context found.
Jan Camenisch and Anna Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Lecture Notes in Computer Science, volume 2045.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC