Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Sven N. Wiesner

dblp:336/4245 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 50% Network security · 50%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
key exchange
0.712023
Sound Verification of Security Protocols: From Design to Interoperable Implementations · SP 2023
Network security › secure communication › secure communication protocol
wireguard
0.712023
Sound Verification of Security Protocols: From Design to Interoperable Implementations · SP 2023
Program verification
code-level verification
0.712023
Sound Verification of Security Protocols: From Design to Interoperable Implementations · SP 2023
Program verification › protocol verification
security protocol verification
0.712023
Sound Verification of Security Protocols: From Design to Interoperable Implementations · SP 2023

Methods — techniques the papers use, named apart from their topics

tamarin · 1.3separation logic · 1.3i/o specification · 1.3
YearPublicationVenuePosition
2023 Sound Verification of Security Protocols: From Design to Interoperable Implementations
abstract
We provide a framework consisting of tools and metatheorems for the end-to-end verification of security protocols, which bridges the gap between automated protocol verification and code-level proofs. We automatically translate a Tamarin protocol model into a set of I/O specifications expressed in separation logic. Each such specification describes a protocol role’s intended I/O behavior against which the role’s implementation is then verified. Our soundness result guarantees that the verified implementation inherits all security (trace) properties proved for the Tamarin model. Our framework thus enables us to leverage the substantial body of prior verification work in Tamarin to verify new and existing implementations. The possibility to use any separation logic code verifier provides flexibility regarding the target language. To validate our approach and show that it scales to real-world protocols, we verify a substantial part of the official Go implementation of the WireGuard VPN key exchange protocol.
Linard Arquint, Felix A. Wolf, Joseph Lallemand, Ralf Sasse, Christoph Sprenger 0001, Sven N. Wiesner, David A. Basin, Peter Müller 0001
SP6