Towards a symbolic bisimulation for the spi calculus

  • Authors:
  • Yinhua Lü;Xiaorong Chen;Luming Fang;Hangjun Wang

  • Affiliations:
  • Department of Computer Science, Guizhou University, Guiyang, China;Department of Computer Science, Guizhou University, Guiyang, China;School of Information Science and Technology, Zhejiang Forestry University, Lin’an, China;School of Information Science and Technology, Zhejiang Forestry University, Lin’an, China

  • Venue:
  • MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Observational equivalence is a powerful means for formulating the security properties of cryptographic protocols. However suffering from the infinite quantifications over contexts, its proof becomes notoriously troublesome. This paper addresses the problem with a symbolic technique. We propose a symbolic bisimulation for spi calculus based on an environmental sensitive label transition system semantics, which restrict the infinite inputs of a process to only finite transitions. We also prove that the symbolic bisimulation is sound to the traditional concrete bisimulation, and furthermore is a promising means to automatically verifying the security protocols.