Towards a Full-Featured Implementation of Attribute Based Credentials on Smart Cards
暂无分享,去创建一个
[1] Drummond Reed,et al. OpenID 2.0: a platform for user-centric identity management , 2006, DIM '06.
[2] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[3] Bart Jacobs,et al. Developing Efficient Blinded Attribute Certificates on Smart Cards via Pairings , 2010, CARDIS.
[4] Jan Camenisch,et al. Design and implementation of the idemix anonymous credential system , 2002, CCS '02.
[5] Ian Miers,et al. Charm: a framework for rapidly prototyping cryptosystems , 2013, Journal of Cryptographic Engineering.
[6] Jaap-Henk Hoepman,et al. A secure channel for attribute-based credentials: [short paper] , 2013, Digital Identity Management.
[7] W. Marsden. I and J , 2012 .
[8] Wojciech Mostowski,et al. Efficient U-Prove Implementation for Anonymous Credentials on Smart Cards , 2011, SecureComm.
[9] Jeff Hodges,et al. Assertions and Protocol for the OASIS Security Assertion Markup Language (SAML) V2. 0 , 2001 .
[10] Russell Impagliazzo,et al. One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] Jan Camenisch,et al. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation , 2001, IACR Cryptol. ePrint Arch..
[12] Jan Camenisch,et al. A Signature Scheme with Efficient Protocols , 2002, SCN.
[13] Ivan Damgård,et al. Commitment Schemes and Zero-Knowledge Protocols , 1998, Lectures on Data Security.
[14] Abhi Shelat,et al. Efficient Protocols for Set Membership and Range Proofs , 2008, ASIACRYPT.
[15] Bruce Schneier,et al. Cryptography Engineering - Design Principles and Practical Applications , 2010 .
[16] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[17] Jaap-Henk Hoepman,et al. The Identity Crisis. Security, Privacy and Usability Issues in Identity Management , 2011, ArXiv.
[18] Giles Hogben,et al. Privacy Features: Privacy features of European eID card specifications , 2008 .
[19] Ingrid Verbauwhede,et al. Efficient implementation of anonymous credentials on Java Card smart cards , 2009, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS).
[20] Gergely Alpár,et al. Efficient Selective Disclosure on Smart Cards Using Idemix , 2013, IDMAN.
[21] Anna Lysyanskaya,et al. Anonymous credentials light , 2013, IACR Cryptol. ePrint Arch..
[22] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[23] John Kelsey,et al. NIST Special Publication 800-90A: Recommendation for Random Number Generation Using Deterministic Random Bit Generators , 2011 .
[24] Eve Maler,et al. The Venn of Identity: Options and Issues in Federated Identity Management , 2008, IEEE Security & Privacy.
[25] Jan Camenisch,et al. Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.
[26] Michael Luby,et al. Pseudo-random permutation generators and cryptographic composition , 1986, STOC '86.
[27] Jan Camenisch,et al. Efficient Attributes for Anonymous Credentials (Extended Version) , 2010, IACR Cryptol. ePrint Arch..
[28] Stefan A. Brands,et al. Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy , 2000 .
[29] Jan Camenisch,et al. Anonymous credentials on a standard java card , 2009, CCS.
[30] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[31] Jan Camenisch,et al. Separability and Efficiency for Generic Group Signature Schemes , 1999, CRYPTO.
[32] Jan Camenisch,et al. Efficient group signature schemes for large groups , 1997 .