{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:12:06Z","timestamp":1778692326641,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:00:00Z","timestamp":1776211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:00:00Z","timestamp":1776211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP23K16887"],"award-info":[{"award-number":["JP23K16887"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,5]]},"abstract":"Abstract<\/jats:title>\n \n An information system is composed of two types of entities, subjects like users and objects like databases from the security viewpoint. A subject issues an operation to an object to manipulate data in the object. An object is protected from malicious accesses of unauthorized subjects in the AC (Access Control) models. Nevertheless, if data in an object\n \n \n $$o_j$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is stored in another object\n \n \n $$o_k$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , a subject\n \n \n $$s_i$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n which is allowed to read\n \n \n $$o_k$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n can read the data of\n \n \n $$o_j$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n in\n \n \n $$o_k$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n even if\n \n \n $$s_i$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is not granted an access right of\n \n \n $$o_j$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , i.e. illegal information flow from\n \n \n $$o_j$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n to\n \n \n $$s_i$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n occurs. In our previous studies, the O-IFC (Object-based Information Flow Control) is proposed where operations occurring illegal information flow are prohibited. Here, a unit of data exchanged among entities is an object. Even if some operations do not occur illegal information flow, the operations are prohibited in the O-IFC. In order to reduce the operations unnecessarily prohibited, a novel C-IFC (Content-based IFC) is proposed where a finer unit of data than an object is considered to be exchanged among entities. In this article, an object is composed of natural language sentences. It is critical to decide whether or not a sentence\n \n \n $$st_j$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n \n t<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n in\n \n \n $$o_j$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is the same as another sentence\n \n \n $$st_k$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n \n t<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n in\n \n \n $$o_k$$<\/jats:tex-math>\n \n \n o<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . In this article, the sentence classifier is used which is generated by using the large language model based on the neural networks. If\n \n \n $$st_j$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n \n t<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n $$st_k$$<\/jats:tex-math>\n \n \n s<\/mml:mi>\n \n t<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n are decided to be the same by the sentence classifier, the sentences are referred to as paraphrases. In the evaluation, the operations unnecessarily prohibited in the C-IFC are fewer than the O-IFC.\n <\/jats:p>","DOI":"10.1007\/s00500-026-11299-7","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T09:36:42Z","timestamp":1776245802000},"page":"3621-3629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Content-based information flow control realized by large language model based on neural networks"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1064-4056","authenticated-orcid":false,"given":"Shigenari","family":"Nakamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidia","family":"Ogiela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Takizawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"11299_CR1","unstructured":"Cheng Y, Xu M, Zhang Y et al (2025) Say what you mean: natural language access control with large language models for internet of things. arXiv preprint arXiv:2505.23835"},{"key":"11299_CR2","volume-title":"Cryptography and data security","author":"DER Denning","year":"1982","unstructured":"Denning DER (1982) Cryptography and data security. Addison Wesley, Boston"},{"key":"11299_CR3","unstructured":"Devlin J, Chang MW, Lee K et al (2019) BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp 4171\u20134186"},{"key":"11299_CR4","unstructured":"Dolan WB, Brockett C (2005) Automatically constructing a corpus of sentential paraphrases. In: Proc. of the Third International Workshop on Paraphrasing (IWP2005)"},{"key":"11299_CR5","volume-title":"Database security and integrity","author":"EB Fernandez","year":"1980","unstructured":"Fernandez EB, Summers RC, Wood C (1980) Database security and integrity. Adison Wesley, Boston"},{"issue":"5\u20136","key":"11299_CR6","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.mcm.2013.02.006","volume":"58","author":"S Gusmeroli","year":"2013","unstructured":"Gusmeroli S, Piccione S, Rotondi D (2013) A capability-based security approach to manage access control in the internet of things. Math Comput Model 58(5\u20136):1189\u20131205","journal-title":"Math Comput Model"},{"key":"11299_CR7","unstructured":"Hugging Face Inc. (2020) Hugging face hub. https:\/\/huggingface.co\/docs\/hub\/index"},{"key":"11299_CR8","unstructured":"Kindervag J, Balaouras S, Mak K et al (2016) No more chewy centers: the zero trust model of information security. Tech. rep., Forrester Research"},{"key":"11299_CR9","doi-asserted-by":"crossref","unstructured":"Moustafa N, Slay J (2015) UNSW-NB15: a comprehensive data set for network intrusion detection systems (UNSW-NB15 network data set). In: 2015 Military Communications and Information Systems Conference, pp 1\u20136","DOI":"10.1109\/MilCIS.2015.7348942"},{"issue":"1\u20133","key":"11299_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1080\/19393555.2015.1125974","volume":"25","author":"N Moustafa","year":"2016","unstructured":"Moustafa N, Slay J (2016) The evaluation of network anomaly detection systems: Statistical analysis of the UNSW-NB15 data set and the comparison with the KDD99 data set. Inf Secur J A Global Perspect 25(1\u20133):18\u201331","journal-title":"Inf Secur J A Global Perspect"},{"key":"11299_CR11","doi-asserted-by":"crossref","unstructured":"Munasinghe S, Piyarathna N, Wijerathne E et al (2023) Machine learning based zero trust architecture for secure networking. In: 2023 IEEE 17th International Conference on Industrial and Information Systems, pp 1\u20136","DOI":"10.1109\/ICIIS58898.2023.10253610"},{"issue":"8","key":"11299_CR12","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1016\/j.jcss.2014.12.020","volume":"81","author":"S Nakamura","year":"2015","unstructured":"Nakamura S, Duolikun D, Takizawa M (2015) Read-abortion (ra) based synchronization protocols to prevent illegal information flow. J Comput Syst Sci 81(8):1441\u20131451","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"11299_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.3233\/JHS-180593","volume":"24","author":"S Nakamura","year":"2018","unstructured":"Nakamura S, Ogiela L, Enokido T et al (2018) An information flow control model in a topic-based publish\/subscribe system. J High Speed Netw 24(3):243\u2013257","journal-title":"J High Speed Netw"},{"issue":"4","key":"11299_CR14","first-page":"13","volume":"10","author":"S Nakamura","year":"2019","unstructured":"Nakamura S, Enokido T, Takizawa M (2019) Information flow control based on the capbac (capability-based access control) model in the iot. Int J Mob Comput Multimed Commun 10(4):13\u201325","journal-title":"Int J Mob Comput Multimed Commun"},{"key":"11299_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2021.100423","volume":"15","author":"S Nakamura","year":"2021","unstructured":"Nakamura S, Enokido T, Takizawa M (2021) Information flow control based on capability token validity for secure iot: implementation and evaluation. Internet Things 15:100423","journal-title":"Internet Things"},{"key":"11299_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2022.100542","volume":"19","author":"S Nakamura","year":"2022","unstructured":"Nakamura S, Enokido T, Takizawa M (2022) Capability token selection algorithms to implement lightweight protocols. Internet Things 19:100542","journal-title":"Internet Things"},{"key":"11299_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2023.100992","volume":"24","author":"S Nakamura","year":"2023","unstructured":"Nakamura S, Enokido T, Takizawa M (2023) Assessment of energy consumption for information flow control protocols in iot devices. Internet Things 24:100992","journal-title":"Internet Things"},{"key":"11299_CR18","doi-asserted-by":"crossref","unstructured":"Nakamura S, Enokido T, Takizawa M (2020a) Information flow control in object-based peer-to-peer publish\/subscribe systems. Concurr Comput 32(8)","DOI":"10.1002\/cpe.5118"},{"key":"11299_CR19","doi-asserted-by":"crossref","unstructured":"Nakamura S, Enokido T, Takizawa M (2020b) Time-based legality of information flow in the capability-based access control model for the internet of things. Concurr Comput 33(23)","DOI":"10.1002\/cpe.5944"},{"key":"11299_CR20","doi-asserted-by":"crossref","unstructured":"Nakamura S, Enokido T, Takizawa M (2021a) Implementation and evaluation of the information flow control for the internet of things. Concurr Comput 33(19)","DOI":"10.1002\/cpe.6311"},{"key":"11299_CR21","doi-asserted-by":"crossref","unstructured":"Nakamura S, Enokido T, Takizawa M (2021c) Traffic reduction for information flow control in the iot. In: Proceeding of the 16th International Conference on Broad-Band Wireless Computing, Communication and Applications, pp 67\u201377","DOI":"10.1007\/978-3-030-90072-4_7"},{"key":"11299_CR22","doi-asserted-by":"crossref","unstructured":"Nakamura S, Takizawa M (2025) A trust zone model with the information flow control for the zero trust security. Int J Grid Utility Comput (accepted)","DOI":"10.1007\/978-3-031-87775-9_6"},{"key":"11299_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.iot.2018.08.003","volume":"1\u20132","author":"R Oma","year":"2018","unstructured":"Oma R, Nakamura S, Duolikun D et al (2018) An energy-efficient model for fog computing in the internet of things (iot). Internet Things 1\u20132:14\u201326","journal-title":"Internet Things"},{"key":"11299_CR24","doi-asserted-by":"crossref","unstructured":"Rose S, Borchert O, Mitchell S et al (2020) Zero trust architecture. Tech. rep., National Institute of Standards and Technology. https:\/\/csrc.nist.gov\/publications\/detail\/sp\/800\/207\/final","DOI":"10.6028\/NIST.SP.800-207-draft2"},{"issue":"11","key":"11299_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/2.241422","volume":"26","author":"RS Sandhu","year":"1993","unstructured":"Sandhu RS (1993) Lattice-based access control models. IEEE Comput 26(11):9\u201319","journal-title":"IEEE Comput"},{"issue":"2","key":"11299_CR26","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/2.485845","volume":"29","author":"RS Sandhu","year":"1996","unstructured":"Sandhu RS, Coyne EJ, Feinstein HL et al (1996) Role-based access control models. IEEE Comput 29(2):38\u201347","journal-title":"IEEE Comput"},{"key":"11299_CR27","unstructured":"Sanh V, Debut L, Chaumond J et al (2020) Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv:1910.01108"},{"key":"11299_CR28","unstructured":"Tiwari T, Gururangan S, Guo C et al (2024) Information flow control in machine learning through modular model architecture. In: 33rd USENIX Security Symposium (USENIX Security 24), pp 6921\u20136938"},{"key":"11299_CR29","unstructured":"Vaswani A, Shazeer N, Parmar N et al (2017) Attention is all you need. In: Advances in Neural Information Processing Systems"},{"key":"11299_CR30","doi-asserted-by":"crossref","unstructured":"Wang A, Singh A, Michael J et al (2018) GLUE: a multi-task benchmark and analysis platform for natural language understanding. In: Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP, pp 353\u2013355","DOI":"10.18653\/v1\/W18-5446"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-026-11299-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-026-11299-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-026-11299-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:27:40Z","timestamp":1778689660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-026-11299-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,15]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["11299"],"URL":"https:\/\/doi.org\/10.1007\/s00500-026-11299-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,15]]},"assertion":[{"value":"6 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}