Paper Info

Title | ||
---|---|---|

Constraints solution for time sensitive security protocols |

Abstract | ||
---|---|---|

With the development of network and distributed systems, more and more security protocols rely heavily on time stamps, which are taken into account by a few formal methods. Generally, these methods use constraints to describe the characteristic of time variables. However, few of them give a feasible solution to the corresponding constraints solving problem. An effective framework to model and verify time sensitive security protocols is introduced in [1], which doesn't give an automatic algorithm for constraints solution. In this paper, an effective method is presented to determine whether the constraints system has a solution, and then implemented in our verifying tool SPVT. Finally, Denning-Sacco protocol is taken as an example to show that security protocols with time constraints can be modeled naturally and verified automatically and efficiently in our models. |

Year | DOI | Venue |
---|---|---|

2007 | 10.1007/978-3-540-73814-5_18 | FAW |

Keywords | Field | DocType |

time stamp,effective method,effective framework,time variable,security protocol,feasible solution,time sensitive security protocol,constraints system,time constraint,constraints solution,algorithm,formal method,constraint,distributed system | Mathematical optimization,Cryptographic protocol,Constraint (mathematics),Effective method,Computer science,Time sensitive,Formal methods,Distributed computing | Conference |

Volume | ISSN | ISBN |

4613 | 0302-9743 | 3-540-73813-4 |

Citations | PageRank | References |

2 | 0.37 | 15 |

Authors | ||

4 |

Authors (4 rows)

Cited by (2 rows)

References (15 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

Zhoujun Li | 1 | 964 | 115.99 |

Ti Zhou | 2 | 8 | 2.87 |

Mengjun Li | 3 | 57 | 7.72 |

Huo-wang Chen | 4 | 235 | 33.47 |