Results 241 to 250 of about 63,614 (274)

A Formal Language for Cryptographic Protocol Requirements

Designs, Codes and Cryptography, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Syverson, Catherine Meadows
openaire   +2 more sources

Cryptographic Protocols Analysis in Event B

2010
We consider the proof-based development of cryptographic protocols satisfying security properties. For instance, the model of Dolev- Yao provides a way to integrate a description of possible attacks, when designing a protocol. We use existing protocols and want to provide a systematic way to prove but also to design cryptographic protocols; moreover ...
Benaissa, Nazim, Méry, Dominique
openaire   +3 more sources

Analyzing a Cryptographic Protocol

2017
Web services such as email, photo, social networks, internet commerce, and online banking require that entities authenticate themselves. Scrooge McDuck must be sure that he (it?) is communicating with the bank, and not with some bad guy with a look-a-like web page.
openaire   +2 more sources

Verifying Cryptographic Protocols with Subterms Constraints

2007
Known protocol analysis techniques consider protocols where some piece of information expected in a protocol message is located at a fixed position. However this is too restrictive to model web-services where messages are XML semi-structured documents and where significant information (such as name, signature, ...) has to be extracted from nodes ...
Chevalier, Yannick, Lugiez, Denis, Rusinowitch, Michael   +2 more
openaire   +2 more sources

Types for Cryptographic Protocols

2002
One of the many different approaches to proving properties of a cryptographic security protocol is to encode it within a process calculus [6],[7],[11],[12],[14],[20], and then to apply standard techniques from concurrency theory such as modelchecking [19] or equational reasoning [4],[5],[8],[9],[13],[15].
openaire   +2 more sources

Cryptographic Protocols

2017
This chapter is concerned with cryptographic protocols. We begin with an explanation of what components a cryptographic protocol consists of. We then illustrate the complexity of designing a secure cryptographic protocol by considering an artificially simple scenario, for which we propose and analyse seven candidate protocols.
openaire   +1 more source

Cryptographic Protocol Analysis of AN.ON

2010
This work presents a cryptographic analysis of AN.ON’s anonymization protocols. We have discovered three flaws of differing severity. The first is caused by the fact that the freshness of the session key was not checked by the mix. This flaw leads to a situation where an external attacker is able to perform a replay attack against AN.ON. A second, more
Benedikt Westermann, Lexi Pimenidis, Dogan Kesdogan, Rolf Wendolsky   +3 more
openaire   +2 more sources

Compiling and narrowing cryptographic protocols

1999
We propose a direct and fully automated translation from standard authentication protocol descriptions to rewrite rules. This compiling defines a non-ambiguous operational semantics for protocol executions. The rewrite rules are then translated to first-order Horn Logic and processed by the theorem-prover daTac The existence of flaws in the protocol is
Jacquemard, Florent, Rusinowitch, Michaël, Vigneron, Laurent   +2 more
openaire   +1 more source

Cryptographic Protocols

2002
Hans Delfs, Helmut Knebl
openaire   +1 more source

General Cryptographic Protocols

2004
The design of secure protocols that implement arbitrarily desired functionalities is a major part of modern cryptography. Taking the opposite perspective, the design of any cryptographic scheme may be viewed as the design of a secure protocol for implementing a suitable functionality. Still, we believe that it makes sense to differentiate between basic
openaire   +2 more sources