An Efficient Anonymous Credential System
作者： Norio Akagi , Yoshifumi Manabe , Tatsuaki Okamoto
DOI: 10.1007/978-3-540-85230-8_25
关键词:
摘要: This paper presents an efficient anonymous credential system that includes two variants. One is a lacks revoking protocol, but provides perfect anonymity-unlinkability and computational unforgeability under the strong Diffie-Hellman assumption. It more than existing systems with no revocation. The other revocation as well decision linear assumptions. types of simultaneously: one to blacklist user who acted wrong so he can longer use his credential, identifying from usage credential. Both are provably secure above-mentioned assumptions in standard model.
springer.com
researchgate.net 
sci-hub.st 参考文章(16)
Aggelos Kiayias, Moti Yung, Polynomial reconstruction based cryptography selected areas in cryptography. pp. 129- 133 ,(2001) , 10.1007/3-540-45537-X_10
Anna A. Lysyanskaya, Ronald L. Rivest, Signature schemes and applications to cryptographic protocol design Massachusetts Institute of Technology. ,(2002)
Tatsuaki Okamoto, Efficient Blind and Partially Blind Signatures Without Random Oracles Theory of Cryptography. pp. 80- 99 ,(2006) , 10.1007/11681878_5
Dan Boneh, Ben Lynn, Hovav Shacham, Short Signatures from the Weil Pairing international conference on the theory and application of cryptology and information security. pp. 514- 532 ,(2001) , 10.1007/3-540-45682-1_30
Jan Camenisch, Anna Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps Advances in Cryptology – CRYPTO 2004. pp. 56- 72 ,(2004) , 10.1007/978-3-540-28628-8_4
David Chaum, Security without identification: transaction systems to make big brother obsolete Communications of the ACM. ,vol. 28, pp. 1030- 1044 ,(1985) , 10.1145/4372.4373
Dan Boneh, Xavier Boyen, Short Signatures Without Random Oracles theory and application of cryptographic techniques. pp. 56- 73 ,(2004) , 10.1007/978-3-540-24676-3_4
Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith, Blacklistable anonymous credentials: blocking misbehaving users without ttps computer and communications security. pp. 72- 81 ,(2007) , 10.1145/1315245.1315256
Jan Camenisch, Anna Lysyanskaya, An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation Lecture Notes in Computer Science. pp. 93- 118 ,(2001) , 10.1007/3-540-44987-6_7
Dan Boneh, Xavier Boyen, Hovav Shacham, Short Group Signatures Advances in Cryptology – CRYPTO 2004. pp. 41- 55 ,(2004) , 10.1007/978-3-540-28628-8_3