Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
psvg.doc.ic.ac.uk
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
xr119
psvg.doc.ic.ac.uk
Commits
7e7d8f2b
Commit
7e7d8f2b
authored
6 years ago
by
Teresa Carbajo-Garcia
Browse files
Options
Downloads
Patches
Plain Diff
Add new file
parent
632cd4c4
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
_posts/2018-07-16-seminar.md
+20
-0
20 additions, 0 deletions
_posts/2018-07-16-seminar.md
with
20 additions
and
0 deletions
_posts/2018-07-16-seminar.md
0 → 100644
+
20
−
0
View file @
7e7d8f2b
---
title
:
Seminar by Felix Stutz on Automated Verification of Security Protocols
---
Felix Stutz gave a talk on Monday on Automated Verification of Security Protocols.
This work is part of the project he is doing with Emanuele D’Osualdo and will
inform his Master Thesis.
The abstract is:
Security protocols are distributed programs that are designed to achieve secure
communications using cryptography. A distinctive feature of the security properties
of protocols is that they must hold in the presence of an active adversarial
environment, and this makes them challenging to verify. An important example
of such a security property is secrecy: can the protocol leak a (secret) message
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
protocols with unbounded sessions and nonces.
The novelty of the approach, based on a new decidability result
by
[
D'Osualdo et al.(CSF17)
](
http://psvg.doc.ic.ac.uk/publications/DOsualdo2017Deciding.html
)
,
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
on symbolic representations of inductive invariants of protocols.
\ No newline at end of file
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment