Threshold Attribute-Based Credentials With Redactable Signature
- 29 May 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (5) , 3751-3765
Abstract
Threshold attribute-based credentials are suitable for decentralized systems such as blockchains as such systems generally assume that authenticity, confidentiality, and availability can still be guaranteed in the presence of a threshold number of dishonest or faulty nodes. Coconut (NDSS'19) was the first selective disclosure attribute-based credentials scheme supporting threshold issuance. However, it does not support threshold tracing of user identities and threshold revocation of user credentials, which is desired for internal governance such as identity management, data auditing, and accountability. The communication and computation complexities of Coconut for verifying credentials are linear in the number of each user's attributes and thus costly. Addressing these issues, we propose a novel efficient threshold attribute-based anonymous credential scheme. While retaining all the features of Coconut, our scheme supports threshold tracing of user identities and threshold revocation of user credentials, and it significantly reduces the computational and communication complexities of credential verification. In addition, we prove that our scheme enjoys strong security features, including anonymity, blindness, traceability, and non-frameability.Keywords
Funding Information
- National Natural Science Foundation of China (61872091)
- National Research Foundation Singapore (NRF2018NCR-NSOE004-0001)
- AXA Research Fund
- National Defense Basic Research Program of China (JCKY2019102C001)
- Ripple University Blockchain Research Initiative
- Lee Kong Chian Chair Professorship
- National Research Foundation Singapore (NRF2018NCR-NSOE004-0001)
- AXA Research Fund
This publication has 36 references indexed in Scilit:
- Privacy preserving electronic petitionsIdentity in the Information Society, 2008
- Pairings for cryptographersDiscrete Applied Mathematics, 2008
- Efficient Non-interactive Proof Systems for Bilinear Groups2008
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- Constant-Size Dynamic k-TAA2006
- Signature Schemes and Anonymous Credentials from Bilinear Maps2004
- Short Group Signatures2004
- Efficient group signature schemes for large groups1997
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- How to share a secretCommunications of the ACM, 1979