{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:12:55Z","timestamp":1767262375075,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T00:00:00Z","timestamp":1610496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2021,2,28]]},"abstract":"<jats:p>\n            The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive from this technology, such as medical or industrial applications. However, just like any other technology, security is a huge concern. Given its distributed architecture and its processing limitations, programmable matter cannot handle the traditional security protocols and encryption algorithms. This article proposes a new security protocol optimized and dedicated for IoT programmable matter. This protocol is based on lightweight cryptography and uses the same encryption protocol as a hashing function while keeping the distributed architecture in mind. The analysis and simulation results show the efficiency of the proposed method and that a supercomputer will need about 5.93 \u00d7 10\n            <jats:sup>25<\/jats:sup>\n            years to decrypt the message.\n          <\/jats:p>","DOI":"10.1145\/3432250","type":"journal-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T11:17:41Z","timestamp":1610536661000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["PROLISEAN"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8120-3496","authenticated-orcid":false,"given":"Edy","family":"Hourany","sequence":"first","affiliation":[{"name":"Holy Spirit University of Kaslik, Kaslik, Jounieh, Lebanon"}]},{"given":"Bachir","family":"Habib","sequence":"additional","affiliation":[{"name":"Holy Spirit University of Kaslik, Kaslik, Jounieh, Lebanon"}]},{"given":"Camille","family":"Fountaine","sequence":"additional","affiliation":[{"name":"\u00c9cole Sp\u00e9ciale Militaire de Saint-Cyr Co\u00ebtquidan, Guer, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8120-3496","authenticated-orcid":false,"given":"Abdallah","family":"Makhoul","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bourgogne Franche-Comt\u00e9, FEMTO-ST Institute, CNRS"}]},{"given":"Benoit","family":"Piranda","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bourgogne Franche-Comt\u00e9, FEMTO-ST Institute, CNRS"}]},{"given":"Julien","family":"Bourgeois","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bourgogne Franche-Comt\u00e9, FEMTO-ST Institute, CNRS"}]}],"member":"320","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.02.004"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-015-0237-8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2015.7129976"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341515"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17994-5_23"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341032"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPCC.2017.8269731"},{"key":"e_1_2_1_8_1","unstructured":"Alex Biryukov and L\u00e9o Paul Perrin. 2017. State of the art in lightweight symmetric cryptography. (2017).  Alex Biryukov and L\u00e9o Paul Perrin. 2017. State of the art in lightweight symmetric cryptography. (2017)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_21"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23951-9_21"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.12709\/mest.05.05.02.03"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935784"},{"key":"e_1_2_1_14_1","unstructured":"ECRYPT Francois-Xavier Standaert II and D SYM. 2010. ECRYPT II final lightweight cryptography status report. (2010).  ECRYPT Francois-Xavier Standaert II and D SYM. 2010. ECRYPT II final lightweight cryptography status report. (2010)."},{"volume-title":"Proceedings of the 2014 IEEE 23rd International WETICE Conference \u201914)","author":"Guyeux Christophe","key":"e_1_2_1_15_1","unstructured":"Christophe Guyeux , Abdallah Makhoul , and Jacques M. Bahi . 2014. A security framework for wireless sensor networks: Theory and practice . In Proceedings of the 2014 IEEE 23rd International WETICE Conference \u201914) , Sumitra Reddy (Ed.). 269--274. Christophe Guyeux, Abdallah Makhoul, and Jacques M. Bahi. 2014. A security framework for wireless sensor networks: Theory and practice. In Proceedings of the 2014 IEEE 23rd International WETICE Conference \u201914), Sumitra Reddy (Ed.). 269--274."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2012.25"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11894063_4"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2448656"},{"key":"e_1_2_1_19_1","volume-title":"et\u00a0al","author":"Katagi Masanobu","year":"2008","unstructured":"Masanobu Katagi , Shiho Moriai , et\u00a0al . 2008 . Lightweight cryptography for the internet of things. Sony Corporation . Technical report. 7--10. 7--10. Masanobu Katagi, Shiho Moriai, et\u00a0al. 2008. Lightweight cryptography for the internet of things. Sony Corporation. Technical report. 7--10. 7--10."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-020-07346-7"},{"key":"e_1_2_1_21_1","volume-title":"31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"91","author":"Di Luna Giuseppe A.","year":"2017","unstructured":"Giuseppe A. Di Luna , Paola Flocchini , Nicola Santoro , Giovanni Viglietta , and Yukiko Yamauchi . 2017 . Brief Announcement: Shape formation by programmable particles . In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)) , Vol. 91 , Andr\u00e9a W. Richa (Ed.). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 48:1--48:3. https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2017.48 Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi. 2017. Brief Announcement: Shape formation by programmable particles. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 91, Andr\u00e9a W. Richa (Ed.). Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 48:1--48:3. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.48"},{"key":"e_1_2_1_22_1","unstructured":"Morgan L. McCorkle. 2018.ORNL Launches Summit Supercomputer. Retrieved November 3 2020 from https:\/\/www.ornl.gov\/news\/ornl-launches-summit-supercomputer.  Morgan L. McCorkle. 2018.ORNL Launches Summit Supercomputer. Retrieved November 3 2020 from https:\/\/www.ornl.gov\/news\/ornl-launches-summit-supercomputer."},{"key":"e_1_2_1_23_1","first-page":"196","article-title":"An autonomous lightweight conditional privacy-preserving authentication scheme with provable security for vehicular ad-hoc networks","volume":"42","author":"Ogundoyin Sunday Oyinlola","year":"2020","unstructured":"Sunday Oyinlola Ogundoyin . 2020 . An autonomous lightweight conditional privacy-preserving authentication scheme with provable security for vehicular ad-hoc networks . Int. J. Comput. Appl. 42 , 2 (2020), 196 -- 211 . Sunday Oyinlola Ogundoyin. 2020. An autonomous lightweight conditional privacy-preserving authentication scheme with provable security for vehicular ad-hoc networks. Int. J. Comput. Appl. 42, 2 (2020), 196--211.","journal-title":"Int. J. Comput. Appl."},{"key":"e_1_2_1_24_1","volume-title":"Univ. de Paris-Sud","volume":"22","author":"Perrin Daniel","year":"2008","unstructured":"Daniel Perrin . 2008 . La suite logistique et le chaos. Rapport Technique, D\u00e9p. Math. d\u2019Orsay , Univ. de Paris-Sud , France , Vol. 22 (2008). Daniel Perrin. 2008. La suite logistique et le chaos. Rapport Technique, D\u00e9p. Math. d\u2019Orsay, Univ. de Paris-Sud, France, Vol. 22 (2008)."},{"key":"e_1_2_1_25_1","series-title":"Dagstuhl Seminar 16271","volume-title":"Visiblesim: Your simulator for programmable matter. In Proceedings of the Algorithmic Foundations of Programmable Matter","author":"Piranda Benoit","year":"2016","unstructured":"Benoit Piranda , S. Fekete , A Richa , K. R\u00f6mer , and C. Scheideler . 2016 . Visiblesim: Your simulator for programmable matter. In Proceedings of the Algorithmic Foundations of Programmable Matter ( Dagstuhl Seminar 16271 ). Benoit Piranda, S. Fekete, A Richa, K. R\u00f6mer, and C. Scheideler. 2016. Visiblesim: Your simulator for programmable matter. In Proceedings of the Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechatronics.2013.08.009"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the Annual International Cryptology Conference. Springer, 368--378","author":"Preneel Bart","year":"1993","unstructured":"Bart Preneel , Ren\u00e9 Govaerts , and Joos Vandewalle . 1993 . Hash functions based on block ciphers: A synthetic approach . In Proceedings of the Annual International Cryptology Conference. Springer, 368--378 . Bart Preneel, Ren\u00e9 Govaerts, and Joos Vandewalle. 1993. Hash functions based on block ciphers: A synthetic approach. In Proceedings of the Annual International Cryptology Conference. Springer, 368--378."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_24"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.101423"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149359"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the International Workshop on Fast Software Encryption. Springer, 181--195","author":"Shirai Taizo","year":"2007","unstructured":"Taizo Shirai , Kyoji Shibutani , Toru Akishita , Shiho Moriai , and Tetsu Iwata . 2007 . The 128-bit blockcipher CLEFIA . In Proceedings of the International Workshop on Fast Software Encryption. Springer, 181--195 . Taizo Shirai, Kyoji Shibutani, Toru Akishita, Shiho Moriai, and Tetsu Iwata. 2007. The 128-bit blockcipher CLEFIA. In Proceedings of the International Workshop on Fast Software Encryption. Springer, 181--195."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.07.012"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.102496"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3432250","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3432250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:10Z","timestamp":1750193230000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3432250"}},"subtitle":["A New Security Protocol for Programmable Matter"],"short-title":[],"issued":{"date-parts":[[2021,1,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2,28]]}},"alternative-id":["10.1145\/3432250"],"URL":"https:\/\/doi.org\/10.1145\/3432250","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"type":"print","value":"1533-5399"},{"type":"electronic","value":"1557-6051"}],"subject":[],"published":{"date-parts":[[2021,1,13]]},"assertion":[{"value":"2020-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}