Using Malleable Signatures to Allow Multi-Show Capability in Digital Credentials

In this paper we propose the use of a malleable signature technique to transform Brands’ digital credentials from single-show capability to multi-show capability. Our specific proposed instantiation uses RSA digital signatures so that Alice can efficiently transform an original credential and its corresponding CA signature to a randomized / blinded version of the credential and signature that can be shown to a verifier without risk of traceability (by the CA or across multiple verifiers). We describe our modified issuing and showing protocols and discuss the security properties of our proposed scheme.

[1]  Johannes Blömer,et al.  Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures , 2018, IACR Cryptol. ePrint Arch..

[2]  David Chaum,et al.  Blind Signature System , 1983, CRYPTO.

[3]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[4]  David Chaum,et al.  Security without identification: transaction systems to make big brother obsolete , 1985, CACM.

[5]  Giulio Malavolta,et al.  Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys , 2018, IET Inf. Secur..

[6]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[7]  Torben P. Pedersen,et al.  Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem , 1992 .

[8]  Joachim Posegga,et al.  Malleable Signatures for Resource Constrained Platforms , 2013, WISTP.

[9]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[10]  Thomas Lenz,et al.  Towards Domain-Specific and Privacy-Preserving Qualified eID in a User-Centric Identity Model , 2018, 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE).

[11]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[12]  David Chaum,et al.  Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..

[13]  Michael Backes,et al.  Delegatable Functional Signatures , 2016, Public Key Cryptography.

[14]  Eugène van Heyst,et al.  How to Make Efficient Fail-stop Signatures , 1992, EUROCRYPT.

[15]  Michael K. Reiter,et al.  Bounded vector signatures and their applications , 2011, ASIACCS '11.

[16]  Carlisle M. Adams,et al.  Achieving non-transferability in credential systems using hidden biometrics , 2011, Secur. Commun. Networks.

[17]  Henrich Christopher Pöhls,et al.  Efficient and Perfectly Unlinkable Sanitizable Signatures without Group Signatures , 2013, EuroPKI.

[18]  Jan Camenisch,et al.  An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation , 2001, IACR Cryptol. ePrint Arch..

[19]  Stefan A. Brands,et al.  Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy , 2000 .

[20]  Gerrit Bleumer,et al.  Undeniable Signatures , 2011, Encyclopedia of Cryptography and Security.

[21]  Xinyi Huang,et al.  Authenticated Data Redaction with Fine-Grained Control , 2020, IEEE Transactions on Emerging Topics in Computing.

[22]  Markulf Kohlweiss,et al.  Malleable Signatures: Complex Unary Transformations and Delegatable Anonymous Credentials , 2013, IACR Cryptol. ePrint Arch..