Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities
暂无分享,去创建一个
[1] Jan Camenisch,et al. A Signature Scheme with Efficient Protocols , 2002, SCN.
[2] Stefan A. Brands,et al. Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy , 2000 .
[3] Fabrice Boudot,et al. Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.
[4] Sean W. Smith,et al. Blacklistable anonymous credentials: blocking misbehaving users without ttps , 2007, CCS '07.
[5] David Chaum,et al. Security without identification: transaction systems to make big brother obsolete , 1985, CACM.
[6] Mihir Bellare,et al. Fast Batch Verification for Modular Exponentiation and Digital Signatures , 1998, IACR Cryptol. ePrint Arch..
[7] Jiangtao Li,et al. Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities , 2012, IEEE Trans. Dependable Secur. Comput..
[8] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.
[9] Dawn Xiaodong Song,et al. Practical forward secure group signature schemes , 2001, CCS '01.
[10] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[11] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[12] Hovav Shacham,et al. Group signatures with verifier-local revocation , 2004, CCS '04.
[13] Jan Camenisch,et al. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.
[14] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[15] Dawn Xiaodong Song,et al. Quasi-Efficient Revocation in Group Signatures , 2002, Financial Cryptography.
[16] Ivan Damgård,et al. An Integer Commitment Scheme based on Groups with Hidden Order , 2001, IACR Cryptol. ePrint Arch..
[17] Marc Joye,et al. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme , 2000, CRYPTO.
[18] David Chaum,et al. Group Signatures , 1991, EUROCRYPT.
[19] Jan Camenisch,et al. Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.
[20] Birgit Pfitzmann,et al. Composition and integrity preservation of secure reactive systems , 2000, CCS.
[21] Jan Camenisch,et al. Efficient group signature schemes for large groups , 1997 .
[22] Joe Kilian,et al. Identity Escrow , 1998, CRYPTO.
[23] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[24] Jan Camenisch,et al. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation , 2001, IACR Cryptol. ePrint Arch..
[25] David Chaum,et al. Wallet Databases with Observers , 1992, CRYPTO.
[26] Jacques Stern,et al. Security Proofs for Signature Schemes , 1996, EUROCRYPT.
[27] David Chaum,et al. Zero-Knowledge Undeniable Signatures , 1991, EUROCRYPT.
[28] Jan Camenisch,et al. Separability and Efficiency for Generic Group Signature Schemes , 1999, CRYPTO.
[29] Ran Canetti,et al. Studies in secure multiparty computation and applications , 1995 .
[30] Jacques Stern,et al. Efficient Revocation in Group Signatures , 2001, Public Key Cryptography.
[31] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[32] Birgit Pfitzmann,et al. A model for asynchronous reactive systems and its application to secure message transmission , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.
[33] Ernest F. Brickell,et al. Gradual and Verifiable Release of a Secret , 1987, CRYPTO.
[34] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[35] David Chaum,et al. An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations , 1987, EUROCRYPT.
[36] Jan Camenisch,et al. Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes , 1998, EUROCRYPT.
[37] Ernest F. Brickell,et al. Direct anonymous attestation , 2004, CCS '04.
[38] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.