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.
? Tutorial for this page

Ulf Carlsen

dblp:33/5038 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2002
—ORCID · none

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

Security and privacy · 4 · 4 first-author

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 · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
formal methods
0.011994
Generating formal cryptographic protocol specifications · S&P 1994
Cryptographic protocols and secure computation
protocol verification
0.011994
Generating formal cryptographic protocol specifications · S&P 1994

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

syntax-directed translation · 0.0CKT5 · 0.0
YearPublicationVenuePosition
2002 The QX Smart Card Operating System
Ulf Carlsen
CARDIS1
1994 Cryptographic Protocols Flaws
abstract
Flaws are introduced at every stage of the protocol development cycle. The engineer is faced with the problem of how to avoid them. The first step is to gain an understanding of the different flavours of cryptographic protocol flaws, i.e. get to know the enemy. This paper provides a classification of protocol flaws, including two new flaws in an application of the mental poker protocol, and discusses appropriate countermeasures for relevant flaw-categories.>
Ulf Carlsen
CSFW1
1994 Generating formal cryptographic protocol specifications
abstract
This paper describes a tool which translates a cryptographic protocol specified in the semi-formal standard notation i. A/spl rarr/B:M into the formal language CKT5. We examine the standard notation syntax, and describe how it is exploited by the tool to infer protocol conditions which must hold for every principal, thereby obtaining a complete, formal specification of the protocol. The translation criteria described herein are applicable to other target languages than CKT5.>
Ulf Carlsen
S&P1
1993 Using logics to detect implementation-dependent flaws [cryptographic protocol design]
abstract
Vulnerabilities may be introduced at all stages of cryptographic protocol design. Reasoning about a protocol at a functional level does not unveil flaws which are inherently implementation-dependent. This paper uncovers a potential implementation-dependent flaw in a previously published protocol. Formal techniques should be able to analyse protocols with respect to such flaws. The epistemic logic CKT5 is modified and shown to operate at a sufficiently detailed bevel to capture implementation-dependent flaws.>
Ulf Carlsen
ACSAC1