Skip to main content
Springer Nature Link
Log in

A Credible Information Fusion Method Based on Cascaded Topology Interactive Traceability

  • Conference paper
  • First Online:
Mobile Internet Security (MobiSec 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1544))

Included in the following conference series:

  • 1028 Accesses

Abstract

With the increasing scope of distributed system collaboration and the increasing number of participants, how to establish mutual trust in the process of collaboration is an important basis to promote the efficiency of collaboration. A feasible method is to abstract each node of distributed system into network node of complex system to study its interaction and cooperation behavior. Aiming at the problem of trust transmission in the process of information exchange between complex network nodes, this paper proposed a credible information fusion method based on cascaded topology interactive traceability by abstraction of an information fusion and trust model on account of interactive behavior. This method uses local interaction behavior of blockchain traceability methods provide a credible witness local information interaction, through the information credibility evaluation method in specified cascade topology, from the two aspects of information centrality and information similarity. Thus, the credible information fusion formula for the interactive traceability of the domain topology would constructed. At the same time, this paper discusses the typical problems encountered in the adaptive transformation of the existing operating system for blockchain application. Constructive suggestions are put forward for the phased development of combining blockchain with existing systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. Krnc, M., Škrekovski, R.: Group degree centrality and centralization in networks. Mathematics 8(10), 1810 (2020)

    Article  Google Scholar 

  2. Samad, A., Qadir, M., Nawaz, I., Islam, M.A., Aleem, M.: SAM centrality: a hop-based centrality measure for ranking users in social network. EAI Endorsed Trans. Ind. Netw. Intell. Syst. 7(23), e2 (2020)

    Google Scholar 

  3. Alighanbari, E.B.: An Influence maximization algorithm in social network using K-shell decomposition and community detection. Netw. Biol. 10(1), 12–23 (2020)

    Google Scholar 

  4. Agryzkov, T., Tortosa, L., Vicent, J.F., Wilson, R.: A centrality measure for urban networks based on the eigenvector centrality concept. Environ. Plann. B: Urban Anal. City Sci. 46(4), 668–689 (2019)

    Google Scholar 

  5. Salton, G.: Automatic text analysis. Science 168(3929), 335–343 (1970)

    Article  Google Scholar 

  6. Liu, Z., Zhang, Q.-M., Lü, L., Zhou, T.: Link prediction in complex networks: a local naïve Bayes model. EPL (Europhys. Lett.) 96(4), 48007 (2011)

    Article  Google Scholar 

  7. Tan, F., Xia, Y., Zhu, B.: Link prediction in complex networks: a mutual information perspective. PLoS One 9(9), e107056 (2014)

    Article  Google Scholar 

  8. Zhang, Q., Li, M., Deng, Y.: Measure the structure similarity of nodes in complex networks based on relative entropy. Phys. A: Stat. Mech. Appl. 491, 749–763 (2018)

    Article  MathSciNet  Google Scholar 

  9. Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18, 39–43 (1953)

    Article  Google Scholar 

  10. Burda, Z., Duda, J., Luck, J.M., Waclaw, B.: Localization of the maximal entropy random walk. Phys. Rev. Lett. 102, 160602 (2009)

    Article  Google Scholar 

  11. Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp. 211–220. IEEE (2011)

    Google Scholar 

  12. Ren, Z., Erkin, Z.: VAPOR: a value-centric blockchain that is scale-out, decentralized, and flexible by design. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 487–507. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-32101-7_29

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing Jiaotong University, Beijing, 100044, China

    Yueqing Gao & Huachun Zhou

  2. The 54th Research Institute of China Electronics Technology Group Corporation, Shijiazhuang, 050000, China

    Yueqing Gao, Yuting Shen, Benhui Shi, Lulu Chen & Chu Du

  3. National Space Science Center, Chinese Academy of Sciences, Beijing, 100190, China

    Yuting Shen

  4. University of Chinese Academy of Sciences, Beijing, 100039, China

    Yuting Shen

  5. Center for Future Multimedia and School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610051, China

    Lulu Chen

Authors
  1. Yueqing Gao
    View author publications

    Search author on:PubMed Google Scholar

  2. Yuting Shen
    View author publications

    Search author on:PubMed Google Scholar

  3. Huachun Zhou
    View author publications

    Search author on:PubMed Google Scholar

  4. Benhui Shi
    View author publications

    Search author on:PubMed Google Scholar

  5. Lulu Chen
    View author publications

    Search author on:PubMed Google Scholar

  6. Chu Du
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Yuting Shen .

Editor information

Editors and Affiliations

  1. Soonchunhyang University, Asan, Korea (Republic of)

    Ilsun You

  2. Sangmyung University, Cheonan, Korea (Republic of)

    Hwankuk Kim

  3. Dankook University, Yongin, Korea (Republic of)

    Taek-Young Youn

  4. University of Salerno, Fisciano, Italy

    Francesco Palmieri

  5. St. Petersburg Federal Research Center of the Russian Academy of Sciences, St. Petersburg, Russia

    Igor Kotenko

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gao, Y., Shen, Y., Zhou, H., Shi, B., Chen, L., Du, C. (2022). A Credible Information Fusion Method Based on Cascaded Topology Interactive Traceability. In: You, I., Kim, H., Youn, TY., Palmieri, F., Kotenko, I. (eds) Mobile Internet Security. MobiSec 2021. Communications in Computer and Information Science, vol 1544. Springer, Singapore. https://doi.org/10.1007/978-981-16-9576-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-9576-6_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-9575-9

  • Online ISBN: 978-981-16-9576-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Keywords

Publish with us

Policies and ethics