Skip to main content
Log in

Semantic interpretation of compositional logic in instantiation space

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

The formal methods for security protocols guarantee the security properties of protocols. Instantiation Space Logic is a new security protocol logic, which has a strong expressive power. Compositional Logic is also a useful security protocol logic. This paper analyzes the relationship between these two logics, and interprets the semantics of Compositional Logic in Instantiation Space model. Through our work, the interpreted Compositional Logic can be extended more easily. Moreover, those security protocols described in Compositional Logic can be automatically verified by the verifier of Instantiation Space. The paper also proves that the expressive power of Instantiation Space Logic, which can not be completely interpreted by Compositional Logic, is stronger than Compositional Logic.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Lowe G. Breaking and fixing the needham-schroeder public-key protocol using FDR. Tools and Algorithms for the Construction and Analysis of Systems, 1996, 1055: 147–166

    Google Scholar 

  2. Burrows M, Abadi M, Needham R, et al. A logic of authentication. ACM Transactions on Computer Systems, 1990, 8(1): 18–36

    Article  Google Scholar 

  3. Paulson L C. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 1998, 6(1–2): 85–128

    Google Scholar 

  4. Thayer J, Herzog J C, Guttman J D. Strand spaces: Proving security protocols correct. Journal of Computer Security, 1999, 7(2–3):191–230

    Google Scholar 

  5. Su K L, Yue W Y, Chen Q L, et al. Instantiation space: a new model for security. Chinese Journal of Computers, 2006, 29(9): 1655–1663

    MathSciNet  Google Scholar 

  6. Durgin N, Mitchell J, Pavlovic D. A Compositional Logic for Proving Security Properties of Protocols. Journal of Computer Security, 2003, 11(4): 677–722

    Google Scholar 

  7. Dolev D, Yao A. On the security of public-key protocols. IEEE Transactions on Information Theory, 1983, 29(8):198–208

    Article  MATH  MathSciNet  Google Scholar 

  8. Halpern J Y, Pucella R. On the relationship between strand spaces and multi-agent systems. In: Proceedings of the 8th ACM Conference on Computer and Communications Security. ACM Press, 2001, 106–115

  9. Datta A, Derek A, Mitchell J C, et al. A derivation system for security protocols and its logical formalization. In: 16th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 2003, 109–125

  10. Cervesato I, Meadows C, Pavlovic D. An encapsulated authentication logic for reasoning about key distribution protocol. In: 18th Computer Security Foundations Workshop, IEEE Computer Society Press, 2005, 48–61

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to SU Kaile.

Rights and permissions

Reprints and permissions

About this article

Cite this article

SU, K., Xiao, Y., Chen, Q. et al. Semantic interpretation of compositional logic in instantiation space. Front. Comput. Sc. China 1, 191–199 (2007). https://doi.org/10.1007/s11704-007-0019-y

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-007-0019-y

Keywords

Navigation