Critical field-exponents for secure message-passing in modular networks

Louis M. Shekhtman, Michael M. Danziger, Ivan Bonamassa, Sergey V. Buldyrev, Guido Caldarelli, Vinko Zlatić, Shlomo Havlin

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We study secure message-passing in the presence of multiple adversaries in modular networks. We assume a dominant fraction of nodes in each module have the same vulnerability, i.e., the same entity spying on them. We find both analytically and via simulations that the links between the modules (interlinks) have effects analogous to a magnetic field in a spin-system in that for any amount of interlinks the system no longer undergoes a phase transition. We then define the exponents δ, which relates the order parameter (the size of the giant secure component) at the critical point to the field strength (average number of interlinks per node), and γ, which describes the susceptibility near criticality. These are found to be δ = 2 and γ = 1 (with the scaling of the order parameter near the critical point given by β = 1). When two or more vulnerabilities are equally present in a module we find δ = 1 and γ = 0 (with β ≥ 2). Apart from defining a previously unidentified universality class, these exponents show that increasing connections between modules is more beneficial for security than increasing connections within modules. We also measure the correlation critical exponent ν, and the upper critical dimension d c, finding that as for ordinary percolation, suggesting that for secure message-passing d c = 6. These results provide an interesting analogy between secure message-passing in modular networks and the physics of magnetic spin-systems.

Original languageEnglish
Article number053001
JournalNew Journal of Physics
Volume20
Issue number5
DOIs
StatePublished - May 2018
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2018 The Author(s). Published by IOP Publishing Ltd on behalf of Deutsche Physikalische Gesellschaft.

Funding

Weacknowledge the Israel-Italian collaborative project NECST, Israel Science Foundation, ONR, Japan Science Foundation, BSF-NSF, the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister'sOffice, and DTRA(Grant no. HDTRA-1-10-1- 0014) for financial support.GCacknowledges support from EUprojects SoBigData nr. 654024 and CoeGSS nr. 676547. SVB acknowledges the BWGamson Computational Science Center at Yeshiva College. VZ acknowledges support by the H2020 CSA Twinning Project No. 692194, RBI-T-WINNING, and Croatian centers of excellence QuantixLie and Center of Research Excellence for Data Science and Cooperative Systems. We acknowledge the Israel–Italian collaborative project NECST, Israel Science Foundation, ONR, Japan Science Foundation, BSF-NSF, the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’sOffice, and DTRA (Grant no. HDTRA-1-10-1-0014) for financial support. GC acknowledges support from EU projects SoBigData nr. 654024 and CoeGSS nr. 676547. SVB acknowledges the B W Gamson Computational Science Center at Yeshiva College. VZ acknowledges support by the H2020 CSA Twinning Project No. 692194, RBI-T-WINNING, and Croatian centers of excellence QuantixLie and Center of Research Excellence for Data Science and Cooperative Systems. GC and VZ acknowledge support from A M Loguercio and that this publication has been made possible by support from the Italian Ministero degli Affari Esteri e della Cooperazione Internazionale.

FundersFunder number
A M Loguercio
BSF-NSF
H2020 CSA
Japan Science Foundation
NECST
Office of Naval Research
Defense Threat Reduction AgencyHDTRA-1-10-1-0014
Bloom's Syndrome Foundation
Horizon 2020 Framework Programme692194
European Commission654024, 676547
Israel Science Foundation
Ministero degli Affari Esteri e della Cooperazione Internazionale

    Keywords

    • complex networks
    • network resilience
    • percolation
    • secure message-passing

    Fingerprint

    Dive into the research topics of 'Critical field-exponents for secure message-passing in modular networks'. Together they form a unique fingerprint.

    Cite this