Enhanced strand space for secure protocol analysis

Authors:
Yang Jie;Xianheng Ma;Li Yi
Affiliations:
School of Software, South China University of Technology, Guangzhou, China;School of Software, South China University of Technology, Guangzhou, China;School of Software, South China University of Technology, Guangzhou, China
Venue:
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Year:
2009

Citing 5
Cited 0

Authentication and authenticated key exchanges

Designs, Codes and Cryptography
Strand spaces: proving security protocols correct

Journal of Computer Security
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Using encryption for authentication in large networks of computers

Communications of the ACM
Honest Ideals on Strand Spaces

CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations

Quantified Score

Hi-index	0.00

Visualization

Abstract

Strand space inherits the merit of algebra method, which can prove the security of protocol more precisely for it overcomes the shortcoming of inconvenience. But because of shortage of primitives it can't describe some protocols as IKE, let alone verification. We made improvement to the original Strand Space by adding the description of hash function and some definitions with lemmas. So we can use the intensive model to analyze the protocols using hash function. At last, we analyze one IKE sub-protocol protocol.