EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||
|
ter Beek, M. and Lenzini, G. and Petrocchi, M.
(2003)
Team Automata for Security Analysis of Multicast/Broadcast Communication.
In: ATPN Workshop on Issues in Security and Petri Nets (WISP), 23 June 2003, Eindhoven, The Netherlands.
pp. 57-62.
Beta Research School for Operations Management and Logistics.
ISBN not assigned
Full text available as:
AbstractWe show that team automata (TeA) are well suited to model secure multicast/broadcast communication with possible packet loss. This is a consequence of the natural way in which one-to-many (one-to-all) transmissions typical of multicast (broadcast) sessions can be modelled as communications between the component automata (CA) constituting a TeA. To this aim, we use TeA to model an instance of the EMSS multicast protocol family. In addition we investigate a formulation of the Generalized Non-Deducibility on Compositions (GNDC) schema in terms of TeA with the aim to embed TeA in this well-established analysis framework. We intend to use this new setting for the formal verification of security properties for stream signature protocols.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||