{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:56:13Z","timestamp":1761630973114,"version":"3.37.3"},"reference-count":46,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702212"],"award-info":[{"award-number":["61702212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["CCNU19TS017"],"award-info":[{"award-number":["CCNU19TS017"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Attribute-based signature (ABS) allows signers with a set of attributes to sign messages anonymously using a specific signing policy. However, previous schemes suffer from some efficiency issues which are not widely applied on the blockchain. In this paper, we investigate ABS regarding its features and efficiency in the blockchain setting and provide our solution correspondingly. To solve the revocation problem of ABS in a more efficient manner, we introduce the update-free revocation function. Instead of the passive attribute expiration approaches, we take the active method to ensure that no parameter updates are required by users after the execution of the revocation function. In terms of efficiency, we first address the problem that the signer has to provide proof for all attributes in the predicate for privacy, which is one of the efficiency bottlenecks for ABS. By taking advantage of the blockchain architecture, we propose a new solution which can achieve the constant signature size and verification cost, while the signing cost can be greatly reduced. The corresponding security levels are satisfied according to their strict criteria. A generic construction as well as an instantiation are provided which is provably secure in the standard model satisfying the newly defined formal security definitions. Finally, a purer primitive is discussed.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab199","type":"journal-article","created":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T20:09:15Z","timestamp":1638043755000},"page":"842-865","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Traceable Attribute-Based Signature With Update-Free Revocation For Blockchain"],"prefix":"10.1093","volume":"66","author":[{"given":"Jixin","family":"Zhang","sequence":"first","affiliation":[{"name":"Central China Normal University , Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiageng","family":"Chen","sequence":"additional","affiliation":[{"name":"Central China Normal University , Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,12,30]]},"reference":[{"key":"2023041809381785500_","first-page":"328","article-title":"Attribute-based signatures: Achieving attribute-privacy and collusion-resistance","volume":"2008","author":"Maji","year":"2008","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023041809381785500_","first-page":"376","article-title":"Attribute-based signatures","volume-title":"CT-RSA 2011, Lecture Notes in Computer Science","author":"Maji","year":"2011"},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"1714","DOI":"10.1093\/comjnl\/bxw045","article-title":"Practical attribute-based signature: Traceability and revocability","volume":"59","author":"Wei","year":"2016","journal-title":"Comput. J."},{"key":"2023041809381785500_","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-75539-3_23","article-title":"Balancing privacy and accountability in blockchain identity management","volume-title":"CT-RSA","author":"Damg\u00e5rd"},{"key":"2023041809381785500_","first-page":"50","article-title":"Fully secure attribute-based systems with short ciphertexts\/signatures and threshold access structures","volume-title":"CT-RSA 2013, Lecture Notes in Computer Science","author":"Chen","year":"2013"},{"key":"2023041809381785500_","first-page":"51","article-title":"Short attribute-based signatures for threshold predicates","volume-title":"CT-RSA 2012, Lecture Notes in Computer Science","author":"Herranz","year":"2012"},{"key":"2023041809381785500_","first-page":"295","article-title":"Short pairing-efficient threshold-attribute-based signature","volume-title":"Pairing 2012, Lecture Notes in Computer Science","author":"Gagn\u00e9","year":"2012"},{"key":"2023041809381785500_","first-page":"35","article-title":"Efficient attribute-based signatures for non-monotone predicates in the standard model","volume-title":"PKC 2011, Lecture Notes in Computer Science","author":"Okamoto","year":"2011"},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1587\/transfun.2019CIP0008","article-title":"Decentralized attribute-based encryption and signatures","volume":"103-A","author":"Okamoto","year":"2020","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/TCC.2014.2353053","article-title":"Efficient attribute-based signatures for non-monotone predicates in the standard model","volume":"2","author":"Okamoto","year":"2014","journal-title":"IEEE Trans. Cloud Comput."},{"key":"2023041809381785500_","first-page":"127","article-title":"Efficient attribute-based signatures for unbounded arithmetic branching programs","volume-title":"PKC 2019, Lecture Notes in Computer Science","author":"Datta","year":"2019"},{"key":"2023041809381785500_","first-page":"493","article-title":"Attribute-based signatures for unbounded languages from standard assumptions","volume-title":"ASIACRYPT 2018, Lecture Notes in Computer Science","author":"Sakai","year":"2018"},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1049\/iet-ifs.2017.0029","article-title":"Practical attribute-based signature schemes for circuits from bilinear map","volume":"12","author":"Sakai","year":"2018","journal-title":"IET Information Security"},{"key":"2023041809381785500_","first-page":"283","article-title":"Attribute-based signatures for circuits from bilinear map","volume-title":"PKC 2016, Lecture Notes in Computer Science","author":"Sakai","year":"2016"},{"key":"2023041809381785500_","first-page":"89","article-title":"Attribute-based signatures for unbounded circuits in the ROM and efficient instantiations from lattices","volume-title":"PKC 2018, Lecture Notes in Computer Science","author":"El Kaafarani","year":"2018"},{"key":"2023041809381785500_","first-page":"35","article-title":"Efficient attribute-based signatures for non-monotone predicates in the standard model","volume-title":"PKC 2011, Lecture Notes in Computer Science","author":"Okamoto","year":"2011"},{"key":"2023041809381785500_","first-page":"125","article-title":"Decentralized attribute-based signatures","volume-title":"PKC 2013, Lecture Notes in Computer Science","author":"Okamoto","year":"2013"},{"key":"2023041809381785500_","first-page":"224","article-title":"Revocable attribute-based signatures with adaptive security in the standard model","volume-title":"AFRICACRYPT 2011, Lecture Notes in Computer Science","author":"Escala","year":"2011"},{"key":"2023041809381785500_","first-page":"327","article-title":"Decentralized traceable attribute-based signatures","volume-title":"CT-RSA 2014, Lecture Notes in Computer Science","author":"El Kaafarani","year":"2014"},{"key":"2023041809381785500_","first-page":"391","article-title":"Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions","volume-title":"CT-RSA 2015, Lecture Notes in Computer Science","author":"Ghadafi","year":"2015"},{"key":"2023041809381785500_","first-page":"715","article-title":"On the security of dynamic group signatures: Preventing signature hijacking","volume-title":"PKC 2012, Lecture Notes in Computer Science","author":"Sakai","year":"2012"},{"key":"2023041809381785500_","first-page":"301","article-title":"Certificate-free attribute authentication","volume-title":"Cryptography and Coding, 12th IMA International Conference, Lecture Notes in Computer Science","author":"Khader","year":"2009"},{"key":"2023041809381785500_","first-page":"41","article-title":"Short group signatures","volume-title":"CRYPTO 2004, Lecture Notes in Computer Science","author":"Boneh","year":"2004"},{"key":"2023041809381785500_","first-page":"56","article-title":"Short signatures without random oracles","volume-title":"EUROCRYPT 2004, Lecture Notes in Computer Science","author":"Boneh","year":"2004"},{"key":"2023041809381785500_","first-page":"133","article-title":"Signing on elements in bilinear groups for modular protocol design","volume":"2010","author":"Abe","year":"2010","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023041809381785500_","first-page":"258","article-title":"Collusion resistant broadcast encryption with short ciphertexts and private keys","volume-title":"CRYPTO 2005, Lecture Notes in Computer Science","author":"Boneh","year":"2005"},{"key":"2023041809381785500_","first-page":"431","article-title":"Block-wise p-signatures and non-interactive anonymous credentials with efficient attributes","volume-title":"IMACC 2011, Lecture Notes in Computer Science","author":"Izabach\u00e8ne","year":"2011"},{"volume-title":"Hyperledger fabric","key":"2023041809381785500_"},{"key":"2023041809381785500_","first-page":"214","article-title":"Pachain: Private, authenticated and auditable consortium blockchain","volume-title":"CANS 2019, Lecture Notes in Computer Science","author":"Yuen","year":"2019"},{"key":"2023041809381785500_","first-page":"609","article-title":"Scalable group signatures with revocation","volume-title":"EUROCRYPT 2012, Lecture Notes in Computer Science","author":"Libert","year":"2012"},{"key":"2023041809381785500_","first-page":"571","article-title":"Group signatures with almost-for-free revocation","volume-title":"CRYPTO 2012, Lecture Notes in Computer Science","author":"Libert","year":"2012"},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1504\/IJSN.2006.010821","article-title":"Secure scalable group signature with dynamic joins and separable authorities","volume":"1","author":"Kiayias","year":"2006","journal-title":"Int. J. Secur. Networks"},{"key":"2023041809381785500_","first-page":"419","article-title":"A revocable group signature scheme from identity-based revocation techniques: Achieving constant-size revocation list","volume-title":"ACNS 2014, Lecture Notes in Computer Science","author":"Attrapadung","year":"2014"},{"key":"2023041809381785500_","first-page":"1822","article-title":"Foundations of fully dynamic group signatures","volume-title":"Journal of Cryptology","author":"Bootle","year":"2020"},{"key":"2023041809381785500_","first-page":"111","article-title":"Constant-size dynamic k-taa","volume-title":"SCN 2006, Lecture Notes in Computer Science","author":"Au","year":"2006"},{"key":"2023041809381785500_","first-page":"133","article-title":"Signing on elements in bilinear groups for modular protocol design","volume":"2010","author":"Abe","year":"2010","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-642-14623-7_12","article-title":"Structure-preserving signatures and commitments to group elements","volume-title":"CRYPTO 2010","author":"Abe","year":"2010"},{"key":"2023041809381785500_","first-page":"41","article-title":"Revocation and tracing schemes for stateless receivers","volume-title":"CRYPTO 2001, Lecture Notes in Computer Science","author":"Naor","year":"2001"},{"key":"2023041809381785500_","first-page":"499","article-title":"Concise mercurial vector commitments and independent zero-knowledge sets with short proofs","volume-title":"TCC 2010, Lecture Notes in Computer Science","author":"Libert","year":"2010"},{"key":"2023041809381785500_","first-page":"415","article-title":"Efficient non-interactive proof systems for bilinear groups","volume-title":"EUROCRYPT 2008, Lecture Notes in Computer Science","author":"Groth","year":"2008"},{"key":"2023041809381785500_","first-page":"581","article-title":"Chosen-ciphertext security from tag-based encryption","volume-title":"TCC 2006, Lecture Notes in Computer Science","author":"Kiltz","year":"2006"},{"key":"2023041809381785500_","first-page":"327","article-title":"Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability","volume-title":"LATINCRYPT 2014, Lecture Notes in Computer Science","author":"Ghadafi","year":"2014"},{"key":"2023041809381785500_","first-page":"108","article-title":"Randomizable proofs and delegatable anonymous credentials","volume-title":"CRYPTO 2009, Lecture Notes in Computer Science","author":"Belenkiy","year":"2009"},{"key":"2023041809381785500_","first-page":"278","article-title":"Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles","volume-title":"ESORICS 2011, Lecture Notes in Computer Science","author":"Liu","year":"2011"},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/SCT.1993.336536","article-title":"On span programs","volume-title":"Proceedings of the Eigth Annual Structure in Complexity Theory Conference","author":"Karchmer","year":"1993"},{"key":"2023041809381785500_","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.jpdc.2019.12.019","article-title":"Blockchain 3.0 applications survey","volume":"138","author":"Maesa","year":"2020","journal-title":"J. Parallel Distributed Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/842\/49932000\/bxab199.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/842\/49932000\/bxab199.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T07:30:31Z","timestamp":1699860631000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/4\/842\/6489103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,30]]},"references-count":46,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,12,30]]},"published-print":{"date-parts":[[2023,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab199","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,4]]},"published":{"date-parts":[[2021,12,30]]}}}