Skip to content
Snippets Groups Projects
Commit b9478ec1 authored by Teresa Carbajo-Garcia's avatar Teresa Carbajo-Garcia
Browse files

Update 2018-07-16-seminar.md

parent 55ac4024
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
_posts/2018-07-16-seminar.md
+ 1
− 1
View file @ b9478ec1
...@@ -14,7 +14,7 @@ to the environment as a result of interference by the intruder? ...@@ -14,7 +14,7 @@ to the environment as a result of interference by the intruder?
This project's goal is to develop a new algorithm to verify secrecy of cryptographic This project's goal is to develop a new algorithm to verify secrecy of cryptographic
protocols with unbounded sessions and nonces. protocols with unbounded sessions and nonces.
The novelty of the approach, based on a new decidability result The novelty of the approach, based on a new decidability result
by [D'Osualdo et al.(CSF17)](http://vtss.doc.ic.ac.uk/publications/DOsualdo2017Deciding.html), by [D'Osualdo et al. (CSF17)](http://vtss.doc.ic.ac.uk/publications/DOsualdo2017Deciding.html),
is in how the unboundedness caused by the use of unlimited nonces can be tamed is in how the unboundedness caused by the use of unlimited nonces can be tamed
algorithmically. We will present a new verification algorithm for secrecy based algorithmically. We will present a new verification algorithm for secrecy based
on symbolic representations of inductive invariants of protocols. on symbolic representations of inductive invariants of protocols.
\ No newline at end of file
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment