Network Information Flow

  • Authors:
  • Damas P. Gruska

  • Affiliations:
  • Institute of Informatics Comenius University Mlynska dolina, 842 48 Bratislava, Slovakia. E-mail: gruska@fmph.uniba.sk

  • Venue:
  • Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A formal model for an analysis of an information flow in interconnection networks is presented. It is based on timed process algebra which can express also network properties. The information flow is based on a concept of deducibility on composition. Robustness of systems against network timing attacks is defined. A variety of different security properties which reflect different security requirements are defined and investigated.