Practical Revocable Anonymous Credentials
暂无分享,去创建一个
Currently, there are many solutions for authentication. Mostly, the authentication protocols based on traditional cryptographic constructions, such as digital signatures, hash functions and symmetric encryption schemes, are used. To provide more privacy protection, credential systems were introduced. Using these systems, users can anonymously prove that they possess some attributes. The attributes can represent anything from the age of users to their citizenship or, e.g., driving license possession. The main problem of these systems is revocation since it is currently impossible to efficiently revoke invalid users, attackers or users who use stolen identities. In this paper, a novel conception for anonymous credentials with practical revocation is proposed.
[1] Feng Bao. An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms , 1998, CARDIS.
[2] Kaisa Nyberg,et al. Advances in Cryptology — EUROCRYPT'98 , 1998 .
[3] Tatsuaki Okamoto,et al. A New Public-Key Cryptosystem as Secure as Factoring , 1998, EUROCRYPT.
[4] Ronald Cramer,et al. Modular Design of Secure yet Practical Cryptographic Protocols , 1997 .
[5] W. Nichols. RESEARCH AND APPLICATION. , 1919, Science.