Slide
Centre Interdisciplinaire
de Recherche et d’Innovation
en Cybersécurité et Société
de Recherche et d’Innovation
en Cybersécurité et Société
1.
Mehrban, A.; Moudoud, H.; Brik, B.; Khoukhi, L.; Houda, Z. A. El
Game-Theoretic Security Orchestration for Cross-RIC Policy Conflicts in O-RAN Proceedings Article
In: IEEE Int Conf Commun, Institute of Electrical and Electronics Engineers Inc., 2026, ISBN: 15503607 (ISSN); 979-831954209-0 (ISBN), (Journal Abbreviation: IEEE Int Conf Commun).
Abstract | Links | BibTeX | Tags: Computation theory, Computer system firewalls, Cryptography, Game theory, Game-theoretic, Multiple vendors, Network architecture, Network security, Networks security, Open radio access network, Open RAN, Policy conflict, Radio access networks, Security orchestration, Service management, Service orchestration, SMO, Xapp/rapp conflict, xApp/rApp conflicts
@inproceedings{mehrbanGameTheoreticSecurityOrchestration2026,
title = {Game-Theoretic Security Orchestration for Cross-RIC Policy Conflicts in O-RAN},
author = {A. Mehrban and H. Moudoud and B. Brik and L. Khoukhi and Z. A. El Houda},
url = {https://www.scopus.com/pages/publications/105045343135?origin=resultslist},
doi = {10.1109/ICC59461.2026.11587926},
isbn = {15503607 (ISSN); 979-831954209-0 (ISBN)},
year = {2026},
date = {2026-01-01},
booktitle = {IEEE Int Conf Commun},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {In Open Radio Access Network (Open RAN), disaggregated network components can interact through specialized xApps or rApps from multiple vendors. Despite the flexibility of operations and the dynamism of functions enabled by the open architecture, this openness can cause conflicts in security policy enforcement (e.g., encryption levels, key rotation, firewall restrictiveness), formally defined as thresholded divergences on shared or interdependent security parameters, where one app wants to set a stricter rule while another wants a more lenient policy simultaneously. The current solutions of "first-come"or "last-write"make the change one-sided for the benefit of a single app, while other apps may be harmed by the result, and at a network level, security and stability can be compromised. In this paper, we propose a novel Game-Theoretic Security Orchestrator (GTSO) that operates at the Service Management and Orchestration (SMO) layer, with cross-RIC scope, and is responsible for resolving parameter conflicts across xApps and rApps. GTSO treats xApps/rApps as strategic players and negotiates convergent solutions using game-theoretic models such as non-cooperative Nash games, cooperative bargaining, and leader-follower (Stackelberg) that guide competing control applications toward stable equilibrium points, while exchanging strategy summaries over secure channels to protect sensitive details and enhance overall network security. © 2026 IEEE.},
note = {Journal Abbreviation: IEEE Int Conf Commun},
keywords = {Computation theory, Computer system firewalls, Cryptography, Game theory, Game-theoretic, Multiple vendors, Network architecture, Network security, Networks security, Open radio access network, Open RAN, Policy conflict, Radio access networks, Security orchestration, Service management, Service orchestration, SMO, Xapp/rapp conflict, xApp/rApp conflicts},
pubstate = {published},
tppubtype = {inproceedings}
}
In Open Radio Access Network (Open RAN), disaggregated network components can interact through specialized xApps or rApps from multiple vendors. Despite the flexibility of operations and the dynamism of functions enabled by the open architecture, this openness can cause conflicts in security policy enforcement (e.g., encryption levels, key rotation, firewall restrictiveness), formally defined as thresholded divergences on shared or interdependent security parameters, where one app wants to set a stricter rule while another wants a more lenient policy simultaneously. The current solutions of "first-come"or "last-write"make the change one-sided for the benefit of a single app, while other apps may be harmed by the result, and at a network level, security and stability can be compromised. In this paper, we propose a novel Game-Theoretic Security Orchestrator (GTSO) that operates at the Service Management and Orchestration (SMO) layer, with cross-RIC scope, and is responsible for resolving parameter conflicts across xApps and rApps. GTSO treats xApps/rApps as strategic players and negotiates convergent solutions using game-theoretic models such as non-cooperative Nash games, cooperative bargaining, and leader-follower (Stackelberg) that guide competing control applications toward stable equilibrium points, while exchanging strategy summaries over secure channels to protect sensitive details and enhance overall network security. © 2026 IEEE.
2.
Murray-Rust, D.; Davoust, A.; Papapanagiotou, P.; Manataki, A.; Kleek, M. Van; Shadbolt, N.; Robertson, D.
Towards executable representations of social machines Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10871 LNAI, pp. 765–769, 2018, ISSN: 03029743, (ISBN: 9783319913759).
Abstract | Links | BibTeX | Tags: Calculations, Computation theory, Computational infrastructure, Executable architecture, Graphical formalisms, Inter-action protocols, Network architecture, Participatory design, Sociotechnical systems, Software prototyping, Technological system, Workshop participants
@article{murray-rust_towards_2018,
title = {Towards executable representations of social machines},
author = {D. Murray-Rust and A. Davoust and P. Papapanagiotou and A. Manataki and M. Van Kleek and N. Shadbolt and D. Robertson},
editor = {Moktefi A. Bellucci F. Stapleton G.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048637678&doi=10.1007%2f978-3-319-91376-6_77&partnerID=40&md5=09d785d483cad1b02b5767278b08836b},
doi = {10.1007/978-3-319-91376-6_77},
issn = {03029743},
year = {2018},
date = {2018-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {10871 LNAI},
pages = {765–769},
publisher = {Springer Verlag},
abstract = {Human interaction is increasingly mediated through technological systems, resulting in the emergence of a new class of socio-technical systems, often called Social Machines. However, many systems are designed and managed in a centralised way, limiting the participants’ autonomy and ability to shape the systems they are part of. In this paper we are concerned with creating a graphical formalism that allows novice users to simply draw the patterns of interaction that they desire, and have computational infrastructure assemble around the diagram. Our work includes a series of participatory design workshops, that help to understand the levels and types of abstraction that the general public are comfortable with when designing socio-technical systems. These design studies lead to a novel formalism that allows us to compose rich interaction protocols into functioning, executable architecture. We demonstrate this by translating one of the designs produced by workshop participants into an a running agent institution using the Lightweight Social Calculus (LSC). © Springer International Publishing AG, part of Springer Nature 2018.},
note = {ISBN: 9783319913759},
keywords = {Calculations, Computation theory, Computational infrastructure, Executable architecture, Graphical formalisms, Inter-action protocols, Network architecture, Participatory design, Sociotechnical systems, Software prototyping, Technological system, Workshop participants},
pubstate = {published},
tppubtype = {article}
}
Human interaction is increasingly mediated through technological systems, resulting in the emergence of a new class of socio-technical systems, often called Social Machines. However, many systems are designed and managed in a centralised way, limiting the participants’ autonomy and ability to shape the systems they are part of. In this paper we are concerned with creating a graphical formalism that allows novice users to simply draw the patterns of interaction that they desire, and have computational infrastructure assemble around the diagram. Our work includes a series of participatory design workshops, that help to understand the levels and types of abstraction that the general public are comfortable with when designing socio-technical systems. These design studies lead to a novel formalism that allows us to compose rich interaction protocols into functioning, executable architecture. We demonstrate this by translating one of the designs produced by workshop participants into an a running agent institution using the Lightweight Social Calculus (LSC). © Springer International Publishing AG, part of Springer Nature 2018.
3.
Murray-Rust, D.; Davoust, A.; Papapanagiotou, P.; Manataki, A.; Kleek, M. Van; Shadbolt, N.; Robertson, D.
Towards executable representations of social machines Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10871 LNAI, pp. 765–769, 2018, ISSN: 03029743, (ISBN: 9783319913759).
Abstract | Links | BibTeX | Tags: Calculations, Computation theory, Computational infrastructure, Executable architecture, Graphical formalisms, Inter-action protocols, Network architecture, Participatory design, Sociotechnical systems, Software prototyping, Technological system, Workshop participants
@article{murray-rustExecutableRepresentationsSocial2018,
title = {Towards executable representations of social machines},
author = {D. Murray-Rust and A. Davoust and P. Papapanagiotou and A. Manataki and M. Van Kleek and N. Shadbolt and D. Robertson},
editor = {Moktefi A. Bellucci F. Stapleton G.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048637678&doi=10.1007%2f978-3-319-91376-6_77&partnerID=40&md5=09d785d483cad1b02b5767278b08836b},
doi = {10.1007/978-3-319-91376-6_77},
issn = {03029743},
year = {2018},
date = {2018-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {10871 LNAI},
pages = {765–769},
publisher = {Springer Verlag},
abstract = {Human interaction is increasingly mediated through technological systems, resulting in the emergence of a new class of socio-technical systems, often called Social Machines. However, many systems are designed and managed in a centralised way, limiting the participants’ autonomy and ability to shape the systems they are part of. In this paper we are concerned with creating a graphical formalism that allows novice users to simply draw the patterns of interaction that they desire, and have computational infrastructure assemble around the diagram. Our work includes a series of participatory design workshops, that help to understand the levels and types of abstraction that the general public are comfortable with when designing socio-technical systems. These design studies lead to a novel formalism that allows us to compose rich interaction protocols into functioning, executable architecture. We demonstrate this by translating one of the designs produced by workshop participants into an a running agent institution using the Lightweight Social Calculus (LSC). © Springer International Publishing AG, part of Springer Nature 2018.},
note = {ISBN: 9783319913759},
keywords = {Calculations, Computation theory, Computational infrastructure, Executable architecture, Graphical formalisms, Inter-action protocols, Network architecture, Participatory design, Sociotechnical systems, Software prototyping, Technological system, Workshop participants},
pubstate = {published},
tppubtype = {article}
}
Human interaction is increasingly mediated through technological systems, resulting in the emergence of a new class of socio-technical systems, often called Social Machines. However, many systems are designed and managed in a centralised way, limiting the participants’ autonomy and ability to shape the systems they are part of. In this paper we are concerned with creating a graphical formalism that allows novice users to simply draw the patterns of interaction that they desire, and have computational infrastructure assemble around the diagram. Our work includes a series of participatory design workshops, that help to understand the levels and types of abstraction that the general public are comfortable with when designing socio-technical systems. These design studies lead to a novel formalism that allows us to compose rich interaction protocols into functioning, executable architecture. We demonstrate this by translating one of the designs produced by workshop participants into an a running agent institution using the Lightweight Social Calculus (LSC). © Springer International Publishing AG, part of Springer Nature 2018.
4.
Allili, M. S.; Ziou, D.
Automatic colour-texture image segmentation using active contours Journal Article
In: International Journal of Computer Mathematics, vol. 84, no. 9, pp. 1325–1338, 2007, ISSN: 00207160.
Abstract | Links | BibTeX | Tags: Automatic segmentation, Computation theory, Image segmentation, Optimization, Parameter estimation, Texture image segmentation, Textures
@article{allili_automatic_2007,
title = {Automatic colour-texture image segmentation using active contours},
author = {M. S. Allili and D. Ziou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-34548354750&doi=10.1080%2f00207160701250501&partnerID=40&md5=69002e599b1c570571b04367ec08d2ac},
doi = {10.1080/00207160701250501},
issn = {00207160},
year = {2007},
date = {2007-01-01},
journal = {International Journal of Computer Mathematics},
volume = {84},
number = {9},
pages = {1325–1338},
abstract = {In this paper we propose a fully automatic segmentation method for colour/texture images. By fully automatic, we mean that the steps of region initialization and calculation of the number of regions are performed automatically by the method. The region information is formulated using a mixture of pdfs for the combination of colour and texture features. The segmentation is obtained by minimizing an energy functional combining boundary and region information, which evolves the initial region contours towards the real region boundaries and adapts the mixture parameters to the region data. The method is implemented using the level sets that permit automatic handling of topology changes and stable numerical schemes. We validate the approach using examples of synthetic and natural colour-texture image segmentation.},
keywords = {Automatic segmentation, Computation theory, Image segmentation, Optimization, Parameter estimation, Texture image segmentation, Textures},
pubstate = {published},
tppubtype = {article}
}
In this paper we propose a fully automatic segmentation method for colour/texture images. By fully automatic, we mean that the steps of region initialization and calculation of the number of regions are performed automatically by the method. The region information is formulated using a mixture of pdfs for the combination of colour and texture features. The segmentation is obtained by minimizing an energy functional combining boundary and region information, which evolves the initial region contours towards the real region boundaries and adapts the mixture parameters to the region data. The method is implemented using the level sets that permit automatic handling of topology changes and stable numerical schemes. We validate the approach using examples of synthetic and natural colour-texture image segmentation.
5.
Allili, M. S.; Ziou, D.
Automatic colour-texture image segmentation using active contours Journal Article
In: International Journal of Computer Mathematics, vol. 84, no. 9, pp. 1325–1338, 2007, ISSN: 00207160.
Abstract | Links | BibTeX | Tags: Automatic segmentation, Computation theory, Image segmentation, Optimization, Parameter estimation, Texture image segmentation, Textures
@article{alliliAutomaticColourtextureImage2007,
title = {Automatic colour-texture image segmentation using active contours},
author = {M. S. Allili and D. Ziou},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-34548354750&doi=10.1080%2f00207160701250501&partnerID=40&md5=69002e599b1c570571b04367ec08d2ac},
doi = {10.1080/00207160701250501},
issn = {00207160},
year = {2007},
date = {2007-01-01},
journal = {International Journal of Computer Mathematics},
volume = {84},
number = {9},
pages = {1325–1338},
abstract = {In this paper we propose a fully automatic segmentation method for colour/texture images. By fully automatic, we mean that the steps of region initialization and calculation of the number of regions are performed automatically by the method. The region information is formulated using a mixture of pdfs for the combination of colour and texture features. The segmentation is obtained by minimizing an energy functional combining boundary and region information, which evolves the initial region contours towards the real region boundaries and adapts the mixture parameters to the region data. The method is implemented using the level sets that permit automatic handling of topology changes and stable numerical schemes. We validate the approach using examples of synthetic and natural colour-texture image segmentation.},
keywords = {Automatic segmentation, Computation theory, Image segmentation, Optimization, Parameter estimation, Texture image segmentation, Textures},
pubstate = {published},
tppubtype = {article}
}
In this paper we propose a fully automatic segmentation method for colour/texture images. By fully automatic, we mean that the steps of region initialization and calculation of the number of regions are performed automatically by the method. The region information is formulated using a mixture of pdfs for the combination of colour and texture features. The segmentation is obtained by minimizing an energy functional combining boundary and region information, which evolves the initial region contours towards the real region boundaries and adapts the mixture parameters to the region data. The method is implemented using the level sets that permit automatic handling of topology changes and stable numerical schemes. We validate the approach using examples of synthetic and natural colour-texture image segmentation.