{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T11:28:40Z","timestamp":1746271720640,"version":"3.37.3"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T00:00:00Z","timestamp":1595462400000},"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":["61672339","61872152"],"award-info":[{"award-number":["61672339","61872152"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Cryptography Development Fund","award":["MMJJ20170111"],"award-info":[{"award-number":["MMJJ20170111"]}]},{"DOI":"10.13039\/501100012558","name":"Foundation of Science and Technology on Information Assurance Laboratory","doi-asserted-by":"publisher","award":["KJ-17-109"],"award-info":[{"award-number":["KJ-17-109"]}],"id":[{"id":"10.13039\/501100012558","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"name":"Science and Technology Program of Guangzhou","award":["201902010081"],"award-info":[{"award-number":["201902010081"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Attribute-based encryption (ABE) is a versatile one-to-many encryption primitive, which enables fine-grained access control over encrypted data. Due to its promising applications in practice, ABE schemes with high efficiency, security and expressivity have been continuously emerging. On the other hand, due to the nature of ABE, a malicious user may abuse its decryption privilege. Therefore, being able to identify such a malicious user is crucial towards the practicality of ABE. Although some specific ABE schemes in the literature enjoys the tracing function, they are only proceeded case by case. Most of the ABE schemes do not support traceability. It is thus meaningful and important to have a generic way of equipping any ABE scheme with traceability. In this work, we partially solve the aforementioned problem. Namely, we propose a way of transforming (non-traceable) ABE schemes satisfying certain requirements to fully collusion-resistant black-box traceable ABE schemes, which adds only $O(\\sqrt{\\mathcal{K}})$ elements to the ciphertext where ${\\mathcal{K}}$ is the number of users in the system. And to demonstrate the practicability of our transformation, we show how to convert a couple of existing non-traceable ABE schemes to support traceability.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa082","type":"journal-article","created":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:08:37Z","timestamp":1591873717000},"page":"575-598","source":"Crossref","is-referenced-by-count":8,"title":["On Enabling Attribute-Based Encryption to Be Traceable Against Traitors"],"prefix":"10.1093","volume":"64","author":[{"given":"Zhen","family":"Liu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai 200240, China"}]},{"given":"Qiong","family":"Huang","sequence":"additional","affiliation":[{"name":"South China Agricultural University, Guangzhou 510642, China"},{"name":"Guangzhou Key Laboratory of Intelligent Agriculture, Guangzhou 510642, China"}]},{"given":"Duncan S","family":"Wong","sequence":"additional","affiliation":[{"name":"CryptoBLK HKSAR, China"}]}],"member":"286","published-online":{"date-parts":[[2020,7,23]]},"reference":[{"key":"2021041913134899300_ref1","first-page":"457","article-title":"Fuzzy Identity-Based Encryption","volume-title":"Proc. of EUROCRYPT 2005, Aarhus, Denmark, May 22\u201326","author":"Sahai","year":"2005"},{"key":"2021041913134899300_ref2","first-page":"89","article-title":"Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data","volume-title":"Proc. of CCS 2006, Alexandria, VA, USA, October 30\u2013November 3","author":"Goyal","year":"2006"},{"key":"2021041913134899300_ref3","first-page":"321","article-title":"Ciphertext-Policy Attribute-Based Encryption","volume-title":"Proc. of 2007 IEEE Symposium on Security and Privacy (S&P 2007), Oakland, California, USA, May 20\u201323","author":"Bethencourt","year":"2007"},{"key":"2021041913134899300_ref4","first-page":"456","article-title":"Provably Secure Ciphertext Policy ABE","volume-title":"Proc. of CCS 2007, Alexandria, Virginia, USA, October 28\u201331","author":"Cheung","year":"2007"},{"key":"2021041913134899300_ref5","first-page":"579","article-title":"Bounded Ciphertext Policy Attribute Based Encryption","volume-title":"Proc. of ICALP 2008, Reykjavik, Iceland, July 7\u201311","author":"Goyal","year":"2008"},{"key":"2021041913134899300_ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-19379-8_4","article-title":"Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization","volume-title":"Proc. of PKC 2011, Taormina, Italy, March 6\u20139, pp. 53\u201370","author":"Waters","year":"2011"},{"key":"2021041913134899300_ref7","first-page":"62","article-title":"Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption","volume-title":"Proc. of EUROCRYPT 2010, Monaco\/French Riviera, May 30\u2013June 3","author":"Lewko","year":"2010"},{"key":"2021041913134899300_ref8","first-page":"191","article-title":"Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption","volume-title":"Proc. of CRYPTO 2010, Santa Barbara, CA, USA, August 15\u201319","author":"Okamoto","year":"2010"},{"key":"2021041913134899300_ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-13013-7_2","article-title":"Constant Size Ciphertexts in Threshold Attribute-Based Encryption","volume-title":"Proc. of PKC 2010, Paris, France, May 26\u201328, pp. 19\u201334","author":"Herranz","year":"2010"},{"key":"2021041913134899300_ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-19379-8_6","article-title":"Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts","volume-title":"Proc. of PKC 2011, Taormina, Italy, March 6\u20139, pp. 90\u2013108","author":"Attrapadung","year":"2011"},{"key":"2021041913134899300_ref11","first-page":"180","article-title":"New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques","volume-title":"Proc. of CRYPTO 2012, Santa Barbara, CA, USA, August 19\u201323","author":"Lewko","year":"2012"},{"key":"2021041913134899300_ref12","first-page":"218","article-title":"Functional Encryption for Regular Languages","volume-title":"Proc. of CRYPTO 2012, Santa Barbara, CA, USA, August 19\u201323","author":"Waters","year":"2012"},{"key":"2021041913134899300_ref13","first-page":"66","article-title":"Decentralized Ciphertext-Policy Attribute-Based Encryption Scheme with Fast Decryption","volume-title":"Proc. of CMS 2013, Magdeburg, Germany, September 25\u201326","author":"Rao","year":"2013"},{"key":"2021041913134899300_ref14","first-page":"463","article-title":"Practical Constructions and New Proof Methods for Large Universe Attribute-Based Encryption","volume-title":"Proc. of CCS\u201913, Berlin, Germany, November 4\u20138","author":"Rouselakis","year":"2013"},{"key":"2021041913134899300_ref15","first-page":"122","article-title":"Attribute-Based Functional Encryption on Lattices","volume-title":"Proc. of TCC 2013, Tokyo, Japan, March 3\u20136","author":"Boyen","year":"2013"},{"key":"2021041913134899300_ref16","first-page":"293","article-title":"Online\/Offline Attribute-Based Encryption","volume-title":"Proc. of PKC 2014, Buenos Aires, Argentina, March 26\u201328","author":"Hohenberger","year":"2014"},{"key":"2021041913134899300_ref17","first-page":"557","article-title":"Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More","volume-title":"Proc. of EUROCRYPT 2014, Copenhagen, Denmark, May 11\u201315","author":"Attrapadung","year":"2014"},{"key":"2021041913134899300_ref18","first-page":"532","article-title":"Generic Constructions for Fully Secure Revocable Attribute-Based Encryption","volume-title":"Proc. of ESORICS 2017, Oslo, Norway, September 11\u201315","author":"Yamada","year":"2017"},{"key":"2021041913134899300_ref19","first-page":"665","article-title":"FAME: Fast Attribute-Based Message Encryption","volume-title":"Proc. of CCS 2017, Dallas, TX, USA, October 30\u2013November 03","author":"Agrawal","year":"2017"},{"key":"2021041913134899300_ref20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ins.2019.01.052","article-title":"Hierarchical attribute based encryption with continuous leakage-resilience","volume":"484","author":"Li","year":"2019","journal-title":"Inf. Sci."},{"key":"2021041913134899300_ref21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2018.07.077","article-title":"Key-policy attribute-based encryption against continual auxiliary input leakage","volume":"470","author":"Li","year":"2019","journal-title":"Inf. Sci."},{"key":"2021041913134899300_ref22","first-page":"671","article-title":"Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption","volume-title":"Proc. of CRYPTO 2019, Santa Barbara, CA, USA, August 18\u201322","author":"Koppula","year":"2019"},{"key":"2021041913134899300_ref23","first-page":"765","article-title":"Attribute Based Encryption (and More) for Nondeterministic Finite Automata from LWE","volume-title":"Proc. of CRYPTO 2019, Santa Barbara, CA, USA, August 18\u201322","author":"Agrawal","year":"2019"},{"key":"2021041913134899300_ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-26948-7_3","article-title":"Fully Secure Attribute-Based Encryption for t-cnf from LWE","volume-title":"Proc. of CRYPTO 2019, Santa Barbara, CA, USA, August 18\u201322, pp. 62\u201385","author":"Tsabary","year":"2019"},{"key":"2021041913134899300_ref25","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TIFS.2012.2223683","article-title":"White-box traceable ciphertext-policy attribute-based encryption supporting any monotone access structures.","volume":"8","author":"Liu","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2021041913134899300_ref26","first-page":"475","article-title":"Blackbox Traceable CP-ABE: How to Catch People Leaking their Keys by Selling Decryption Devices on Ebay","volume-title":"Proc. of CCS\u201913, Berlin, Germany, November 4\u20138","author":"Liu","year":"2013"},{"key":"2021041913134899300_ref27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TIFS.2014.2363562","article-title":"Traceable CP-ABE: how to trace decryption devices found in the wild","volume":"10","author":"Liu","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2021041913134899300_ref28","first-page":"127","article-title":"Practical Ciphertext-Policy Attribute-Based Encryption: Traitor Tracing, Revocation, and Large Universe","volume-title":"Proc. of ACNS 2015, New York, NY, USA, June 2\u20135","author":"Liu","year":"2015"},{"key":"2021041913134899300_ref29","first-page":"403","article-title":"Fully Collusion-Resistant Traceable Key-Policy Attribute-Based Encryption with Sub-Linear Size Ciphertexts","volume-title":"Proc. of Inscrypt 2014, Beijing, China, December 13\u201315","author":"Liu","year":"2014"},{"key":"2021041913134899300_ref30","first-page":"501","article-title":"Traitor Tracing with Constant Size Ciphertext","volume-title":"Proc. of CCS 2008, Alexandria, Virginia, USA, October 27\u201331","author":"Boneh","year":"2008"},{"key":"2021041913134899300_ref31","doi-asserted-by":"crossref","first-page":"10:1","DOI":"10.1145\/1346330.1346335","article-title":"Optimal probabilistic fingerprint codes","volume":"55","author":"Tardos","year":"2008","journal-title":"J. ACM"},{"key":"2021041913134899300_ref32","first-page":"257","article-title":"Tracing Traitors","volume-title":"Proc. of CRYPTO \u201994, Santa Barbara, California, USA, August 21\u201325","author":"Chor","year":"1994"},{"key":"2021041913134899300_ref33","first-page":"3","article-title":"Robust Fingerprinting Codes: A Near Optimal Construction","volume-title":"Proc. of DRM\u201910, Chicago, Illinois, USA, October 4","author":"Boneh","year":"2010"},{"key":"2021041913134899300_ref34","first-page":"527","article-title":"Making Any Attribute-Based Encryption Accountable, Efficiently","volume-title":"Proc. of ESORICS 2018, Barcelona, Spain, September 3\u20137","author":"Lai","year":"2018"},{"key":"2021041913134899300_ref35","article-title":"On Enabling Attribute-Based Encryption to Be Traceable Against Traitors","author":"Liu","year":"2018","journal-title":"Cryptology ePrint Archive, Report 2018\/963"},{"key":"2021041913134899300_ref36","article-title":"Dual System Encryption via Doubly Selective Security: Framework, Fully-Secure Functional Encryption for Regular Languages, and More","author":"Attrapadung","year":"2014","journal-title":"Cryptology ePrint Archive, Report 2014\/428"},{"key":"2021041913134899300_ref37","article-title":"Secure schemes for secret sharing and key distribution","volume-title":"PhD Thesis","author":"Beimel","year":"1996"},{"key":"2021041913134899300_ref38","first-page":"121","article-title":"Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes","volume-title":"Proc. of CCS 2010, Chicago, Illinois, USA, October 4\u20138","author":"Garg","year":"2010"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/4\/575\/37161661\/bxaa082.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/4\/575\/37161661\/bxaa082.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T03:12:44Z","timestamp":1618888364000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/4\/575\/5874143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,23]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,7,23]]},"published-print":{"date-parts":[[2021,4,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa082","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2021,4]]},"published":{"date-parts":[[2020,7,23]]}}}