{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:31:36Z","timestamp":1754145096628,"version":"3.41.2"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"content-version":"vor","delay-in-days":196,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,1,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This paper proposes an efficient and secure means for power-constrained Internet of Things (IoT) devices to delegate computationally intensive tasks to proxy servers or nodes in decentralized systems. While such architectures offer advantages in terms of access to computing power and storage, they also raise significant data privacy and security concerns. The proposed solution, a novel residual number system-based all-or-nothing transform (R-AONT) scheme, leverages the parallel processing capabilities of residual number systems to transform input data into residues, which are then encrypted with a symmetric key cipher. The R-AONT scheme first encrypts residues with a symmetric key cipher, producing a ciphertext that is transformed into an R-AONT package using an all-or-nothing transform. This package is distributed across nodes to maintain data privacy and security. The R-AONT scheme is efficient in encoding various sizes of text and image data, with a throughput of 21.19 KB\/s when encrypting a 1 KB text file. The scheme reduces a 4 KB input to 0.75 KB for CP-ABE encryption, which demonstrates a significant compression ratio. Although the R-AONT scheme provides high levels of security and privacy, it has a trade-off in terms of storage overhead. The conversion of input data into residues adds additional bits to the data, increasing storage requirements. However, this storage overhead is considered acceptable, given the increased security and efficiency provided by the scheme. The R-AONT scheme demonstrates potential applications in IoT devices and decentralized systems, enabling power-constrained devices to securely delegate computationally intensive tasks to more capable proxy nodes<\/jats:p>","DOI":"10.1093\/cybsec\/tyaf015","type":"journal-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T08:01:14Z","timestamp":1750838474000},"source":"Crossref","is-referenced-by-count":0,"title":["An RNS-based all-or-nothing transform for CP-ABE in IoT distributed systems"],"prefix":"10.1093","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4088-6622","authenticated-orcid":false,"given":"Edward Y","family":"Baagyere","sequence":"first","affiliation":[{"name":"C. K. Tedam University of Technology and Applied Sciences Department of Computer Science, , Navrongo 00233 ,","place":["Ghana"]}]},{"given":"Emmanuel B","family":"Batowise","sequence":"additional","affiliation":[{"name":"C. K. Tedam University of Technology and Applied Sciences Department of Cyber Security and Computer Engineering Technology, , Navrongo 00233 ,","place":["Ghana"]}]},{"given":"Peter A","family":"Agbedemnab","sequence":"additional","affiliation":[{"name":"C. K. Tedam University of Technology and Applied Sciences Department of Information Systems and Technology, , Navrongo 00233 ,","place":["Ghana"]}]},{"given":"Gideon E","family":"Wenya","sequence":"additional","affiliation":[{"name":"Accra Institute of Technology School of Advanced Technologies, Engineering Science (SATES), , Accra-North 00233 ,","place":["Ghana"]}]},{"given":"Regina E","family":"Turkson","sequence":"additional","affiliation":[{"name":"University of Cape Coast Department of Computer Science and Information Technology, , Cape Coast 00233 ,","place":["Ghana"]}]}],"member":"286","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"2025071609042559900_bib1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1180405.1180418","article-title":"Attribute-based encryption for fine-grained access control of encrypted data","volume-title":"Proceedings of the 13th ACM Conference on Computer and Communications Security","author":"Goyal","year":"2006"},{"key":"2025071609042559900_bib2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/SP.2007.11","article-title":"Ciphertext-policy attribute-based encryption","volume-title":"2007 IEEE Symposium on Security and Privacy (SP\u201907)","author":"Bethencourt","year":"2007"},{"key":"2025071609042559900_bib3","doi-asserted-by":"crossref","first-page":"32891","DOI":"10.1109\/ACCESS.2020.2973459","article-title":"Attribute-based equality test over encrypted data without random oracles","volume":"8","author":"Wang","year":"2020","journal-title":"IEEE Access"},{"issue":"3","key":"2025071609042559900_bib4","doi-asserted-by":"crossref","first-page":"4804","DOI":"10.1109\/JSYST.2022.3169601","article-title":"Toward secure and privacy-preserving cloud data sharing: Online\/offline multiauthority CP-ABE with hidden policy","volume":"16","author":"Zhao","year":"2022","journal-title":"IEEE Syst J"},{"key":"2025071609042559900_bib5","doi-asserted-by":"crossref","first-page":"13789","DOI":"10.1109\/ACCESS.2021.3052247","article-title":"An efficient access control scheme with outsourcing and attribute revocation for fog-enabled E-health","volume":"9","author":"Zhao","year":"2021","journal-title":"IEEE Access"},{"key":"2025071609042559900_bib6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/3133956.3134014","article-title":"FAME: fast attribute-based message encryption","volume-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","author":"Agrawal","year":"2017"},{"issue":"1","key":"2025071609042559900_bib7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10586-021-03382-5","article-title":"SHARE-ABE: an efficient and secure data sharing framework based on ciphertext-policy attribute-based encryption and Fog computing","volume":"25","author":"Saidi","year":"2022","journal-title":"Cluster Comput"},{"key":"2025071609042559900_bib8","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/CBD.2019.00044","article-title":"An attribute revocable CP-ABE scheme","volume-title":"2019 Seventh International Conference on Advanced Cloud and Big Data (CBD)","author":"Xiang","year":"2019"},{"key":"2025071609042559900_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2017\/6097253","article-title":"Verifiable outsourced decryption of attribute-based encryption with constant ciphertext length","volume":"2017","author":"Li","year":"2017","journal-title":"Secur Commun Netw"},{"key":"2025071609042559900_bib10","article-title":"A systematic review of attribute-based encryption for secure data sharing in iot environment","author":"Onwumere","year":"2023"},{"key":"2025071609042559900_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/AFRICON46755.2019.9133919","article-title":"A new image encryption and decryption technique using genetic algorithm and residual numbers","volume-title":"2019 IEEE AFRICON","author":"Agbedemnab","year":"2019"},{"issue":"1\u20132","key":"2025071609042559900_bib12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0304-3975(00)00425-4","article-title":"Residue polynomial systems","volume":"279","author":"Turner","year":"2002","journal-title":"Theor Comput Sci"},{"key":"2025071609042559900_bib13","doi-asserted-by":"crossref","first-page":"100438","DOI":"10.1109\/ACCESS.2020.2997838","article-title":"A multi-layered data encryption and decryption scheme based on genetic algorithm and residual numbers","volume":"8","author":"Baagyere","year":"2020","journal-title":"IEEE Access"},{"issue":"76","key":"2025071609042559900_bib14","first-page":"265","article-title":"Residue number system (RNS)","volume":"2013","author":"Sharoun","year":"2013","journal-title":"Poznan Univ Technol Acad J Elect Eng"},{"issue":"12","key":"2025071609042559900_bib15","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1109\/TC.2008.126","article-title":"The mixed-radix Chinese remainder theorem and its applications to residue comparison","volume":"57","author":"Bi","year":"2008","journal-title":"IEEE T Comput"},{"issue":"04","key":"2025071609042559900_bib16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4236\/jcc.2021.94004","article-title":"New reverse conversion for four-moduli set and five-moduli set","volume":"9","author":"Salifu","year":"2021","journal-title":"J Comput Commun"},{"key":"2025071609042559900_bib17","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1109\/ISIT.2002.1023568","article-title":"A new mode of using all-or-nothing transforms","volume-title":"Proceedings IEEE International Symposium on Information Theory","author":"Canda","year":"2002"},{"key":"2025071609042559900_bib18","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BFb0052348","article-title":"All-or-nothing encryption and the package transform","volume-title":"Fast Software Encryption: 4th International Workshop, FSE\u201997 Haifa, Israel, January 20\u201322 1997 Proceedings 4","author":"Rivest","year":"1997"},{"issue":"2","key":"2025071609042559900_bib19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1008304703074","article-title":"Something about all or nothing (transforms)","volume":"22","author":"Stinson","year":"2001","journal-title":"Design Code Cryptogr"},{"key":"2025071609042559900_bib20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-319-57339-7_3","article-title":"Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme","volume-title":"Progress in Cryptology-AFRICACRYPT 2017: 9th International Conference on Cryptology in Africa, Dakar, Senegal, May 24-26, 2017, Proceedings 9","author":"Chen","year":"2017"},{"issue":"5","key":"2025071609042559900_bib21","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/TIFS.2014.2309858","article-title":"CP-ABE with constant-size keys for lightweight devices","volume":"9","author":"Guo","year":"2014","journal-title":"IEEE T Inf Foren Sec"},{"key":"2025071609042559900_bib22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ISPS.2018.8379018","article-title":"Towards privacy and ownership preserving of outsourced health data in IoT-cloud context","volume-title":"2018 International Symposium on Programming and Systems (ISPS)","author":"Ould-Yahia","year":"2018"},{"issue":"2","key":"2025071609042559900_bib23","first-page":"37","article-title":"An overview of public key cryptosysems and application of residue number system","volume":"4","author":"Eseyin","year":"2019","journal-title":"KIU J Human"},{"key":"2025071609042559900_bib24","first-page":"19","article-title":"Multi-layer data encryption using residue number system in dna sequence","volume":"45","author":"Youssef","year":"2012","journal-title":"Int J Comput Appl"},{"issue":"1","key":"2025071609042559900_bib25","first-page":"43","article-title":"Mixed Radix Conversion based RSA Encryption System","volume":"150","author":"Abdul-Mumin","year":"2016","journal-title":"Int J Comput Appl"},{"issue":"2","key":"2025071609042559900_bib26","first-page":"136","article-title":"An algorithm for a residue number system based video encryption system","volume":"14","author":"Babatunde","year":"2016","journal-title":"Comput Sci Ser J"},{"key":"2025071609042559900_bib27","first-page":"14","article-title":"Development of a Multi-Level Data Encryption Standard with Residue Number System for Data Security","volume-title":"Conference Organising Committee","author":"ADEBAYO","year":"2024"},{"key":"2025071609042559900_bib28","article-title":"Improving Advanced Encryption Standard Performance with Residue Number System","author":"Odunayo","year":"2020"},{"key":"2025071609042559900_bib29","article-title":"$\\lbrace$AONT-RS$\\rbrace$: Blending Security and Performance in Dispersed Storage Systems","volume-title":"9th USENIX Conference on File and Storage Technologies (FAST 11)","author":"Resch","year":"2011"},{"key":"2025071609042559900_bib30","doi-asserted-by":"crossref","first-page":"55126","DOI":"10.1109\/ACCESS.2018.2872749","article-title":"A secure and efficient distributed storage scheme SAONT-RS based on an improved AONT and erasure coding","volume":"6","author":"Yao","year":"2018","journal-title":"IEEE Access"},{"key":"2025071609042559900_bib31","first-page":"503","article-title":"On the security properties of OAEP as an all-or-nothing transform","volume-title":"Annual International Cryptology Conference","author":"Boyko","year":"1999"},{"key":"2025071609042559900_bib32","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/3-540-44448-3_40","article-title":"The security of chaffing and winnowing","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2000: 6th International Conference on the Theory and Application of Cryptology and Information Security Kyoto, Japan, December 3\u20137, 2000 Proceedings 6","author":"Bellare","year":"2000"},{"issue":"1","key":"2025071609042559900_bib33","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1109\/TII.2022.3167842","article-title":"Multiauthority CP-ABE-based access control model for IoT-enabled healthcare infrastructure","volume":"19","author":"Das","year":"2022","journal-title":"IEEE T Ind Inform"},{"key":"2025071609042559900_bib34","doi-asserted-by":"crossref","first-page":"265","DOI":"10.47514\/kjcs\/2024.1.2.009","article-title":"An enhanced message encryption approach using residue number system","volume":"1","author":"Tajudeen","year":"2024","journal-title":"Kasu J Comput Sci"},{"key":"2025071609042559900_bib35","article-title":"Foundations of cryptography","volume-title":"Lecture Notes","author":"Ostrovsky","year":"2010"},{"key":"2025071609042559900_bib36_854_085525","article-title":"Residue number system based fault tolerant scheme for enhancing Rivest Shamir Adleman encryption scheme (Doctoral dissertation, Kwara State University, Nigeria)","author":"Salifu","year":"2017"}],"container-title":["Journal of Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/cybersecurity\/article-pdf\/11\/1\/tyaf015\/63775543\/tyaf015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/cybersecurity\/article-pdf\/11\/1\/tyaf015\/63775543\/tyaf015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:04:39Z","timestamp":1752671079000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/cybersecurity\/article\/doi\/10.1093\/cybsec\/tyaf015\/8203280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1,17]]}},"URL":"https:\/\/doi.org\/10.1093\/cybsec\/tyaf015","relation":{},"ISSN":["2057-2085","2057-2093"],"issn-type":[{"value":"2057-2085","type":"print"},{"value":"2057-2093","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025]]},"published":{"date-parts":[[2025]]},"article-number":"tyaf015"}}