{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T07:49:46Z","timestamp":1782287386679,"version":"3.54.5"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Security and Applications"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.jisa.2026.104541","type":"journal-article","created":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:21:17Z","timestamp":1781551277000},"page":"104541","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Authenticated encryption from packed secret sharing: Scalable one-pass lightweight design with provable security"],"prefix":"10.1016","volume":"101","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2141-7259","authenticated-orcid":false,"given":"Kamel Mohamed","family":"Faraoun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jisa.2026.104541_bib0001","series-title":"Cryptographic hardware and embedded systems \u2013 CHES 2007","first-page":"450","article-title":"PRESENT: an ultra-lightweight block cipher","volume":"vol. 4727","author":"Bogdanov","year":"2007"},{"key":"10.1016\/j.jisa.2026.104541_bib0002","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.jnca.2017.04.002","article-title":"Internet of things security: a survey","volume":"88","author":"Alaba","year":"2017","journal-title":"J Netw Comput Appl"},{"key":"10.1016\/j.jisa.2026.104541_bib0003","series-title":"Advances in cryptology \u2013 CRYPTO \u201997","first-page":"165","article-title":"Digital signcryption or how to achieve cost (signature & encryption) \u202f<\u202f cost (signature) + cost (encryption)","volume":"vol. 1294","author":"Zheng","year":"1997"},{"key":"10.1016\/j.jisa.2026.104541_bib0004","unstructured":"Bhattacharya S., Brakerski Z., Galil Z.. SEMECS: secure and efficient multiple-time elliptic curve signatures for the internet of things. arXiv preprint arXiv: 1907.039112019."},{"key":"10.1016\/j.jisa.2026.104541_bib0005","unstructured":"Ayday E., Gupta S.. LRSHA: lightweight, resilient, and secure hash-based authentication for IoT. arXiv preprint arXiv: 2409139372024."},{"key":"10.1016\/j.jisa.2026.104541_bib0006","series-title":"Communications of the ACM","first-page":"612","article-title":"How to share a secret","volume":"vol. 22","author":"Shamir","year":"1979"},{"key":"10.1016\/j.jisa.2026.104541_bib0007","series-title":"Proceedings of the twenty-fourth annual ACM symposium on theory of computing","first-page":"699","article-title":"Communication complexity of secure computation","author":"Franklin","year":"1992"},{"key":"10.1016\/j.jisa.2026.104541_bib0008","series-title":"International conference on cryptographic hardware and embedded systems","first-page":"400","article-title":"Masking vs. multiparty computation: how large is the gap for AES?","author":"Grosso","year":"2013"},{"key":"10.1016\/j.jisa.2026.104541_bib0009","series-title":"International conference on applied cryptography and network security","first-page":"3","article-title":"Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities","author":"Eldefrawy","year":"2020"},{"key":"10.1016\/j.jisa.2026.104541_bib0010","doi-asserted-by":"crossref","unstructured":"Goyal V., Polychroniadou A., Song Y.. Sharing transformation and dishonest majority MPC with packed secret sharing. Cryptology ePrint Archive, Paper 2022\/831; 2022. https:\/\/eprint.iacr.org\/2022\/831.","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"10.1016\/j.jisa.2026.104541_bib0011","article-title":"Hbacss: how to robustly share many secrets","author":"Yurek","year":"2021","journal-title":"IACR Cryptology ePrint Archive, Report"},{"key":"10.1016\/j.jisa.2026.104541_bib0012","series-title":"Advances in cryptology - ASIACRYPT 2007","first-page":"410","article-title":"Information-theoretic security without an honest majority","author":"Broadbent","year":"2008"},{"issue":"02","key":"10.1016\/j.jisa.2026.104541_bib0013","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1142\/S0129054104002510","article-title":"Several generalizations of Shamir\u2019s secret sharing scheme","volume":"15","author":"Lai","year":"2004","journal-title":"Int J Found Comput Sci"},{"issue":"3","key":"10.1016\/j.jisa.2026.104541_bib0014","doi-asserted-by":"crossref","first-page":"671","DOI":"10.46586\/tches.v2024.i3.671-706","article-title":"Polynomial sharings on two secrets: buy one, get one free","volume":"2024","author":"Arnold","year":"2024","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"10.1016\/j.jisa.2026.104541_bib0015","doi-asserted-by":"crossref","first-page":"9534","DOI":"10.1109\/TIT.2025.3622889","article-title":"Anonymous Shamir\u2019s secret-sharing via reed-solomon codes against permutations, insertions, and deletions","volume":"71","author":"Con","year":"2025","journal-title":"IEEE Trans Inf Theory"},{"key":"10.1016\/j.jisa.2026.104541_bib0016","series-title":"International conference on the theory and application of cryptology and information security","first-page":"19","article-title":"Strongly multiplicative and 3-multiplicative linear secret sharing schemes","author":"Zhang","year":"2008"},{"key":"10.1016\/j.jisa.2026.104541_bib0017","series-title":"Proceedings of the 2024 on ACM SIGSAC conference on computer and communications security","first-page":"3065","article-title":"Efficient secret sharing for large-scale applications","author":"Patel","year":"2024"},{"key":"10.1016\/j.jisa.2026.104541_bib0018","doi-asserted-by":"crossref","first-page":"420","DOI":"10.46586\/tches.v2025.i2.420-459","article-title":"All-you-can-compute: packed secret sharing for combined resilience","volume":"2","author":"Faust","year":"2025","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"10.1016\/j.jisa.2026.104541_bib0019","series-title":"International conference on the theory and application of cryptology and information security","first-page":"531","article-title":"Authenticated encryption: relations among notions and analysis of the generic composition paradigm","author":"Bellare","year":"2000"},{"key":"10.1016\/j.jisa.2026.104541_bib0020","series-title":"Proceedings of the 9th ACM conference on computer and communications security","first-page":"98","article-title":"Authenticated-encryption with associated-data","author":"Rogaway","year":"2002"},{"key":"10.1016\/j.jisa.2026.104541_bib0021","series-title":"Annual international cryptology conference","first-page":"433","article-title":"Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack","author":"Rackoff","year":"1991"},{"key":"10.1016\/j.jisa.2026.104541_bib0022","series-title":"Annual international cryptology conference","first-page":"26","article-title":"Relations among notions of security for public-key encryption schemes","author":"Bellare","year":"1998"},{"key":"10.1016\/j.jisa.2026.104541_bib0023","series-title":"Tech. Rep.","article-title":"Ascon-based lightweight cryptography standards for constrained devices: authenticated encryption, hash, and extendable output functions","author":"S\u00f6nmez Turan","year":"2024"},{"key":"10.1016\/j.jisa.2026.104541_bib0024","unstructured":"Developers T.R.P.. The rust programming language. https:\/\/www.rust-lang.org; 2024. Version 1.x."},{"key":"10.1016\/j.jisa.2026.104541_bib0025","doi-asserted-by":"crossref","unstructured":"FARAOUN K.M.. 2025. Authenticated encryption from packed secret sharing: one-pass lightweight design with provable security. https:\/\/github.com\/kamel78\/PSSCrypt.","DOI":"10.1016\/j.jisa.2026.104541"},{"key":"10.1016\/j.jisa.2026.104541_bib0026","doi-asserted-by":"crossref","unstructured":"Housley R.. Using AES-CCM and AES-GCM authenticated encryption in the cryptographic message syntax (CMS). RFC 5084, Internet Eng. Task Force; 2007. Specifies AES-CCM and AES-GCM AEAD modes in CMS.https:\/\/www.rfc-editor.org\/rfc\/rfc5084.","DOI":"10.17487\/rfc5084"},{"key":"10.1016\/j.jisa.2026.104541_bib0027","doi-asserted-by":"crossref","unstructured":"Krovetz T., Rogaway P.. The OCB authenticated-encryption algorithm. RFC 7253, IETF; 2014. Specification of AES-OCB authenticated encryption mode.https:\/\/www.rfc-editor.org\/rfc\/rfc7253.","DOI":"10.17487\/rfc7253"},{"issue":"33","key":"10.1016\/j.jisa.2026.104541_bib0028","article-title":"Ascon v1.2: lightweight authenticated encryption and hashing","volume":"34","author":"Dobraunig","year":"2021","journal-title":"J Cryptol"},{"key":"10.1016\/j.jisa.2026.104541_bib0029","series-title":"Specification Document","article-title":"Sparkle specification (including schwaemm aead and esch hash)","author":"Beierle","year":"2021"},{"key":"10.1016\/j.jisa.2026.104541_bib0030","unstructured":"Inoue A., Minematsu K.. GIFT-COFB is tightly birthday secure with encryption queries. Cryptology ePrint Archive, Paper 2021\/737; 2021. Analysis of the provable security bounds for GIFT-COFB; https:\/\/eprint.iacr.org\/2021\/737."},{"issue":"1","key":"10.1016\/j.jisa.2026.104541_bib0031","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.matcom.2004.09.001","article-title":"The strict avalanche criterion randomness test","volume":"68","author":"Castro","year":"2005","journal-title":"Math Comput Simul"},{"key":"10.1016\/j.jisa.2026.104541_bib0032","article-title":"Cryptographic randomness testing of block ciphers and hash functions","author":"Do\u011fanaksoy","year":"2010","journal-title":"Cryptol ePrint Arch"}],"container-title":["Journal of Information Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626001717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T07:30:49Z","timestamp":1782286249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2214212626001717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":32,"alternative-id":["S2214212626001717"],"URL":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104541","relation":{},"ISSN":["2214-2126"],"issn-type":[{"value":"2214-2126","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Authenticated encryption from packed secret sharing: Scalable one-pass lightweight design with provable security","name":"articletitle","label":"Article Title"},{"value":"Journal of Information Security and Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104541","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104541"}}