2005
DOI: 10.1007/978-3-540-32254-2_25
|View full text |Cite
|
Sign up to set email alerts
|

A Unification Algorithm for Analysis of Protocols with Blinded Signatures

Abstract: Abstract. Analysis of authentication cryptographic protocols, particularly finding flaws in them and determining a sequence of actions that an intruder can take to gain access to the information which a given protocol purports not to reveal, has recently received considerable attention. One effective way of detecting flaws is to hypothesize an insecure state and determine whether it is possible to get to that state by a legal sequence of actions permitted by the protocol from some legal initial state which cap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…We could either determine if we could restrict ourselves to decidable subcases via judicious use of sorts, or we could incorporate existing unification algorithms applicable to encryption homomorphic over Abelian groups, e.g. the algorithm of Kapur et al [28] into Maude-NPA. We are investigating these options.…”
Section: Discussionmentioning
confidence: 99%
“…We could either determine if we could restrict ourselves to decidable subcases via judicious use of sorts, or we could incorporate existing unification algorithms applicable to encryption homomorphic over Abelian groups, e.g. the algorithm of Kapur et al [28] into Maude-NPA. We are investigating these options.…”
Section: Discussionmentioning
confidence: 99%
“…It would be interesting to know whether the results of this paper, especially the existence of conservative solutions, can be extended to algebraic theories other than Abelian groups, or to richer equational theories that more accurately represent properties of the relevant cryptographic functions. At the same time, recent undecidability results for equational unification [KNW02,KNW03] suggest that the symbolic constraint solving problem is undecidable in the presence of rich equational theories. Therefore, it is very likely that symbolic analysis can be fully automated only for abstract protocol models, or for protocols that employ cryptographic primitives without visible mathematical properties.…”
Section: Discussionmentioning
confidence: 99%
“…Recent research by Narendran et al focuses on decidability of unification modulo the equational theory of multiplication and exponentiation [MN02,KNW02,KNW03]. While equational unification is an important subproblem in symbolic protocol analysis, unification alone is insufficient to decide whether a particular symbolic attack trace is feasible.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The second is extending the axiom set to include additional algebraic operators such as modular addition. Several other papers, including [8,6,5,7], have also considered the unification problem for equational systems that contain some type of exponentiation. For convenience, we give a condensed overview of a selection of these results in Table 1.…”
Section: Extension and Limitationsmentioning
confidence: 99%